%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM852+2 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n001.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 02:26:54 PM UTC 2026
% Result : Theorem 2.74s 6.18s
% Output : CNFRefutation 2.74s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f4ERROR: Could not build tree for root c_1706ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f30,plain,
! [X0,X1] :
( ( ~ less(X1,X0)
| ? [X2] : X0 = vplus(X1,X2) )
& ( ! [X2] : vplus(X1,X2) != X0
| less(X1,X0) ) ),
inference(nnf_transformation,[],[f20]) ).
fof(f31,plain,
! [X0,X1] :
( ( ~ less(X1,X0)
| ? [X3] : vplus(X1,X3) = X0 )
& ( ! [X2] : vplus(X1,X2) != X0
| less(X1,X0) ) ),
inference(rectify,[],[f30]) ).
fof(f32,plain,
! [X0,X1] :
( ( ~ less(X1,X0)
| vplus(X1,sK0(X0,X1)) = X0 )
& ( ! [X2] : vplus(X1,X2) != X0
| less(X1,X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X3,sK0(X0,X1))],[f31]) ).
fof(f33,plain,
! [X0,X1] :
( ( ~ greater(X1,X0)
| ? [X2] : X1 = vplus(X0,X2) )
& ( ! [X2] : vplus(X0,X2) != X1
| greater(X1,X0) ) ),
inference(nnf_transformation,[],[f21]) ).
fof(f34,plain,
! [X0,X1] :
( ( ~ greater(X1,X0)
| ? [X3] : vplus(X0,X3) = X1 )
& ( ! [X2] : vplus(X0,X2) != X1
| greater(X1,X0) ) ),
inference(rectify,[],[f33]) ).
fof(f35,plain,
! [X0,X1] :
( ( ~ greater(X1,X0)
| vplus(X0,sK1(X0,X1)) = X1 )
& ( ! [X2] : vplus(X0,X2) != X1
| greater(X1,X0) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1]),skolemize(X3,sK1(X0,X1))],[f34]) ).
fof(f36,plain,
~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
inference(cnf_transformation,[],[f22]) ).
fof(f38,plain,
less(vd480,vd481),
inference(cnf_transformation,[],[f4]) ).
fof(f44,plain,
! [X2,X0,X1] : vmul(vmul(X0,X1),X2) = vmul(X0,vmul(X1,X2)),
inference(cnf_transformation,[],[f10]) ).
fof(f45,plain,
! [X2,X0,X1] : vmul(X0,vplus(X1,X2)) = vplus(vmul(X0,X1),vmul(X0,X2)),
inference(cnf_transformation,[],[f11]) ).
fof(f46,plain,
! [X0,X1] : vmul(X0,X1) = vmul(X1,X0),
inference(cnf_transformation,[],[f12]) ).
fof(f54,plain,
! [X0,X1] :
( ~ less(X1,X0)
| vplus(X1,sK0(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f32]) ).
fof(f57,plain,
! [X2,X0,X1] :
( vplus(X0,X2) != X1
| greater(X1,X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f62,plain,
! [X2,X0] : greater(vplus(X0,X2),X0),
inference(equality_resolution,[],[f57]) ).
tcf(c_49,negated_conjecture,
~ greater(vmul(vd481,vd469),vmul(vd480,vd469)),
inference(cnf_transformation,[],[f36]) ).
tcf(c_51,plain,
less(vd480,vd481),
inference(cnf_transformation,[],[f38]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i,X2: $i] : vmul(vmul(X0,X1),X2) = vmul(X0,vmul(X1,X2)),
inference(cnf_transformation,[],[f44]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] : vplus(vmul(X0,X1),vmul(X0,X2)) = vmul(X0,vplus(X1,X2)),
inference(cnf_transformation,[],[f45]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] : vmul(X0,X1) = vmul(X1,X0),
inference(cnf_transformation,[],[f46]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] :
( ( vplus(X0,sK0(X1,X0)) = X1 )
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f54]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] : greater(vplus(X0,X1),X0),
inference(cnf_transformation,[],[f62]) ).
tcf(c_79,negated_conjecture,
~ greater(vmul(vd469,vd481),vmul(vd469,vd480)),
inference(theory_normalisation,[status(thm)],[c_49,c_56,c_58]) ).
tcf(c_1306,plain,
! [X0: $i,X1: $i,X2: $i] : greater(vmul(X0,vplus(X1,X2)),vmul(X0,X1)),
inference(superposition,[status(thm)],[c_57,c_68]) ).
tcf(c_1399,plain,
vplus(vd480,sK0(vd481,vd480)) = vd481,
inference(superposition,[status(thm)],[c_51,c_67]) ).
tcf(c_1680,plain,
! [X0: $i] : greater(vmul(X0,vd481),vmul(X0,vd480)),
inference(superposition,[status(thm)],[c_1399,c_1306]) ).
tcf(c_1705,plain,
greater(vmul(vd469,vd481),vmul(vd469,vd480)),
inference(instantiation,[status(thm)],[c_1680]) ).
tcf(c_1706,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1705,c_79]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM852+2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/5.37 % Computer : n001.cluster.edu
% 0.10/5.37 % Model : x86_64 x86_64
% 0.10/5.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.37 % Memory : 8046.5625MB
% 0.10/5.37 % OS : Linux 6.8.0-71-generic
% 0.10/5.37 % CPULimit : 300
% 0.10/5.37 % WCLimit : 300
% 0.10/5.37 % DateTime : Thu Sep 24 05:39:57 UTC 2026
% 0.10/5.37 % CPUTime :
% 0.10/5.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.14/5.41 Running first-order theorem proving
% 0.14/5.41 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.14/5.42
% 0.14/5.42 % ======== iProver multi-core TPTP/SMT =========
% 0.14/5.42
% 0.14/5.42 % Detected problem language: tptp
% 0.14/5.43 % Proving...
% 2.74/6.18 % SZS status Started for theBenchmark.p
% 2.74/6.18 % SZS status Theorem for theBenchmark.p
% 2.74/6.18
% 2.74/6.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.74/6.18
% 2.74/6.18 % ------ iProver source info
% 2.74/6.18
% 2.74/6.18 % git: date: 2026-07-19 20:42:38 +0200
% 2.74/6.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.74/6.18 % git: non_committed_changes: false
% 2.74/6.18
% 2.74/6.18 % ------ Parsing...
% 2.74/6.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.74/6.18
% 2.74/6.18 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 2.74/6.18
% 2.74/6.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.74/6.18
% 2.74/6.18 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.74/6.18 % ------ Proving...
% 2.74/6.18 % ------ Problem Properties
% 2.74/6.18
% 2.74/6.18 %
% 2.74/6.18 % clauses 22
% 2.74/6.18 % conjectures 1
% 2.74/6.18 % EPR 9
% 2.74/6.18 % Horn 21
% 2.74/6.18 % unary 13
% 2.74/6.18 % binary 8
% 2.74/6.18 % lits 32
% 2.74/6.18 % lits eq 12
% 2.74/6.18 % fd_pure 0
% 2.74/6.18 % fd_pseudo 0
% 2.74/6.18 % fd_cond 0
% 2.74/6.18 % fd_pseudo_cond 1
% 2.74/6.18 % AC symbols 1
% 2.74/6.18
% 2.74/6.18 % ------ Schedule dynamic 5 is on
% 2.74/6.18
% 2.74/6.18 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.74/6.18
% 2.74/6.18
% 2.74/6.18 % ------
% 2.74/6.18 % Current options:
% 2.74/6.18 % ------
% 2.74/6.18
% 2.74/6.18
% 2.74/6.18 %
% 2.74/6.18
% 2.74/6.18 % ------ Proving...
% 2.74/6.18 %
% 2.74/6.18
% 2.74/6.18 % SZS status Theorem for theBenchmark.p
% 2.74/6.18
% 2.74/6.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.74/6.18
% 2.74/6.18
%------------------------------------------------------------------------------