%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM840+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 : n002.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:51 PM UTC 2026
% Result : Theorem 2.50s 1.26s
% Output : CNFRefutation 2.50s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f2ERROR: Could not build tree for root c_830ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','holds(antec(conjunct2(conjunct2(204))), 335, 0)') ).
fof(f4,axiom,
( vplus(vd328,vd330) = vplus(vd329,vd330)
=> vd328 = vd329 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(conjunct1(conjunct2(204)), 0), 0)') ).
fof(f5,axiom,
( greater(vplus(vd328,vd330),vplus(vd329,vd330))
=> greater(vd328,vd329) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(conjunct1(204), 0), 0)') ).
fof(f6,axiom,
! [X0,X1,X2] :
( less(X0,X1)
=> less(vplus(X0,X2),vplus(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(193), 0), 0)') ).
fof(f7,axiom,
! [X0,X1,X2] :
( X0 = X1
=> vplus(X0,X2) = vplus(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(193), 0), 1)') ).
fof(f8,axiom,
! [X0,X1,X2] :
( greater(X0,X1)
=> greater(vplus(X0,X2),vplus(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(193), 0), 2)') ).
fof(f9,axiom,
! [X0,X1] :
( less(X0,X1)
=> greater(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(147, 0), 0)') ).
fof(f10,axiom,
! [X0,X1] :
( greater(X0,X1)
=> less(X1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(140, 0), 0)') ).
fof(f11,axiom,
! [X0,X1] :
( less(X0,X1)
| greater(X0,X1)
| X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).
fof(f12,axiom,
! [X0,X1] :
( ~ less(X0,X1)
| X0 != X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 1)') ).
fof(f13,axiom,
! [X0,X1] :
( ~ less(X0,X1)
| ~ greater(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 2)') ).
fof(f14,axiom,
! [X0,X1] :
( ~ greater(X0,X1)
| X0 != X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 3)') ).
fof(f15,axiom,
! [X0,X1] :
( less(X1,X0)
<=> ? [X2] : X0 = vplus(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 12), 1)') ).
fof(f16,axiom,
! [X0,X1] :
( greater(X1,X0)
<=> ? [X2] : X1 = vplus(X0,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 11), 1)') ).
fof(f17,axiom,
! [X0,X1] :
( ? [X3] : X1 = vplus(X0,X3)
| ? [X2] : X0 = vplus(X1,X2)
| X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 0)') ).
fof(f18,axiom,
! [X0,X1] :
( ~ ? [X2] : X1 = vplus(X0,X2)
| X0 != X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 1)') ).
fof(f19,axiom,
! [X0,X1] :
( ~ ? [X3] : X1 = vplus(X0,X3)
| ~ ? [X2] : X0 = vplus(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 2)') ).
fof(f20,axiom,
! [X0,X1] :
( ~ ? [X2] : X0 = vplus(X1,X2)
| X0 != X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 3)') ).
fof(f21,axiom,
! [X0,X1] :
( X0 != X1
=> ! [X2] : vplus(X2,X0) != vplus(X2,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(81, 0), 0)') ).
fof(f22,axiom,
! [X0,X1] : X1 != vplus(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(73, 0), 0)') ).
fof(f23,axiom,
! [X0,X1] : vplus(X1,X0) = vplus(X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).
fof(f24,axiom,
! [X0,X1] : vplus(vsucc(X0),X1) = vsucc(vplus(X0,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(52, 0), 0)') ).
fof(f25,axiom,
! [X0] : vplus(v1,X0) = vsucc(X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(43, 0), 0)') ).
fof(f26,axiom,
! [X0,X1,X2] : vplus(vplus(X0,X1),X2) = vplus(X0,vplus(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','ass(cond(33, 0), 0)') ).
fof(f27,axiom,
! [X0,X1] :
( vplus(X0,v1) = vsucc(X0)
& vplus(X0,vsucc(X1)) = vsucc(vplus(X0,X1)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))') ).
fof(f28,plain,
~ less(vd328,vd329),
inference(flattening,[],[f2]) ).
fof(f33,plain,
! [X0,X1,X2] :
( ~ greater(X0,X1)
| greater(vplus(X0,X2),vplus(X1,X2)) ),
inference(ennf_transformation,[],[f8]) ).
fof(f34,plain,
! [X0,X1] :
( ~ less(X0,X1)
| greater(X1,X0) ),
inference(ennf_transformation,[],[f9]) ).
fof(f35,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| less(X1,X0) ),
inference(ennf_transformation,[],[f10]) ).
fof(f47,plain,
~ less(vd328,vd329),
inference(cnf_transformation,[],[f28]) ).
fof(f48,plain,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(cnf_transformation,[],[f3]) ).
fof(f53,plain,
! [X2,X0,X1] :
( ~ greater(X0,X1)
| greater(vplus(X0,X2),vplus(X1,X2)) ),
inference(cnf_transformation,[],[f33]) ).
fof(f54,plain,
! [X0,X1] :
( ~ less(X0,X1)
| greater(X1,X0) ),
inference(cnf_transformation,[],[f34]) ).
fof(f55,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| less(X1,X0) ),
inference(cnf_transformation,[],[f35]) ).
fof(f56,plain,
! [X0,X1] :
( less(X0,X1)
| greater(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f11]) ).
fof(f57,plain,
! [X0,X1] :
( ~ less(X0,X1)
| X0 != X1 ),
inference(cnf_transformation,[],[f12]) ).
fof(f58,plain,
! [X0,X1] :
( ~ less(X0,X1)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f13]) ).
fof(f80,plain,
! [X1] : ~ less(X1,X1),
inference(equality_resolution,[],[f57]) ).
tcf(c_49,negated_conjecture,
~ less(vd328,vd329),
inference(cnf_transformation,[],[f47]) ).
tcf(c_50,plain,
less(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(cnf_transformation,[],[f48]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] :
( greater(vplus(X0,X2),vplus(X1,X2))
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f53]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( greater(X1,X0)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f54]) ).
tcf(c_56,plain,
! [X0: $i,X1: $i] :
( less(X1,X0)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f55]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i] :
( greater(X0,X1)
| less(X0,X1)
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f56]) ).
tcf(c_58,plain,
! [X0: $i] : ~ less(X0,X0),
inference(cnf_transformation,[],[f80]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i] :
( ~ greater(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f58]) ).
tcf(c_346,negated_conjecture,
~ less(vd328,vd329),
inference(demodulation,[status(thm)],[c_49]) ).
tcf(c_580,plain,
~ greater(vplus(vd328,vd330),vplus(vd329,vd330)),
inference(superposition,[status(thm)],[c_50,c_59]) ).
tcf(c_610,plain,
! [X0: $i,X1: $i] :
( less(X1,X0)
| less(X0,X1)
| ( X0 = X1 ) ),
inference(superposition,[status(thm)],[c_57,c_56]) ).
tcf(c_627,plain,
( less(vd329,vd328)
| ( vd328 = vd329 ) ),
inference(superposition,[status(thm)],[c_610,c_346]) ).
tcf(c_646,plain,
( greater(vd328,vd329)
| ( vd328 = vd329 ) ),
inference(superposition,[status(thm)],[c_627,c_55]) ).
tcf(c_799,plain,
~ greater(vd328,vd329),
inference(superposition,[status(thm)],[c_54,c_580]) ).
tcf(c_825,plain,
vd328 = vd329,
inference(backward_subsumption_resolution,[status(thm)],[c_646,c_799]) ).
tcf(c_828,plain,
less(vplus(vd328,vd330),vplus(vd328,vd330)),
inference(demodulation,[status(thm)],[c_50,c_825]) ).
tcf(c_830,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_828,c_58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM840+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.09/0.36 % Computer : n002.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 05:36:21 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.10/0.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.42 % Proving...
% 2.50/1.26 % SZS status Started for theBenchmark.p
% 2.50/1.26 % SZS status Theorem for theBenchmark.p
% 2.50/1.26
% 2.50/1.26 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.50/1.26
% 2.50/1.26 % ------ iProver source info
% 2.50/1.26
% 2.50/1.26 % git: date: 2026-07-19 20:42:38 +0200
% 2.50/1.26 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.50/1.26 % git: non_committed_changes: false
% 2.50/1.26
% 2.50/1.26 % ------ Parsing...
% 2.50/1.26 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.50/1.26
% 2.50/1.26 % ------ 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.50/1.26
% 2.50/1.26 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.50/1.26
% 2.50/1.26 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.50/1.26 % ------ Proving...
% 2.50/1.26 % ------ Problem Properties
% 2.50/1.26
% 2.50/1.26 %
% 2.50/1.26 % clauses 22
% 2.50/1.26 % conjectures 1
% 2.50/1.26 % EPR 7
% 2.50/1.26 % Horn 20
% 2.50/1.26 % unary 10
% 2.50/1.26 % binary 10
% 2.50/1.26 % lits 36
% 2.50/1.26 % lits eq 14
% 2.50/1.26 % fd_pure 0
% 2.50/1.26 % fd_pseudo 0
% 2.50/1.26 % fd_cond 0
% 2.50/1.26 % fd_pseudo_cond 2
% 2.50/1.26 % AC symbols 1
% 2.50/1.26
% 2.50/1.26 % ------ Schedule dynamic 5 is on
% 2.50/1.26
% 2.50/1.26 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.50/1.26
% 2.50/1.26
% 2.50/1.26 % ------
% 2.50/1.26 % Current options:
% 2.50/1.26 % ------
% 2.50/1.26
% 2.50/1.26
% 2.50/1.26 %
% 2.50/1.26
% 2.50/1.26 % ------ Proving...
% 2.50/1.26 %
% 2.50/1.26
% 2.50/1.26 % SZS status Theorem for theBenchmark.p
% 2.50/1.26
% 2.50/1.26 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.50/1.27
% 2.50/1.27
%------------------------------------------------------------------------------