%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM838+2 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n009.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 3.51s 1.27s
% Output : CNFRefutation 3.51s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f2ERROR: Could not build tree for root c_3709ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
greater(vd301,vd302),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','holds(antec(195), 304, 0)') ).
fof(f4,axiom,
! [X0,X1,X2] :
( less(X1,X2)
=> less(vplus(X1,X0),vplus(X2,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(proof(196), 0), 0)') ).
fof(f5,axiom,
! [X0,X1,X2] :
( less(X1,X2)
=> greater(vplus(X2,X0),vplus(X1,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(proof(196), 0), 1)') ).
fof(f6,axiom,
! [X0,X1,X2] :
( less(X1,X2)
=> greater(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(proof(196), 0), 2)') ).
fof(f7,axiom,
! [X0,X1,X2] :
( X1 = X2
=> vplus(X1,X0) = vplus(X2,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(proof(196), 0), 3)') ).
fof(f8,axiom,
! [X0,X1,X2] :
( greater(X1,X2)
=> greater(vplus(X1,X0),vplus(X2,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(proof(196), 0), 4)') ).
fof(f9,axiom,
! [X0,X1,X2] :
( greater(X1,X2)
=> vplus(vskolem7(X1,X2),vplus(X2,X0)) = vplus(vplus(X2,X0),vskolem7(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(proof(196), 0), 5)') ).
fof(f10,axiom,
! [X0,X1,X2] :
( greater(X1,X2)
=> vplus(vplus(vskolem7(X1,X2),X2),X0) = vplus(vskolem7(X1,X2),vplus(X2,X0)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(proof(196), 0), 6)') ).
fof(f11,axiom,
! [X0,X1,X2] :
( greater(X1,X2)
=> vplus(vplus(X2,vskolem7(X1,X2)),X0) = vplus(vplus(vskolem7(X1,X2),X2),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(proof(196), 0), 7)') ).
fof(f12,axiom,
! [X0,X1,X2] :
( greater(X1,X2)
=> vplus(X1,X0) = vplus(vplus(X2,vskolem7(X1,X2)),X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(proof(196), 0), 8)') ).
fof(f13,axiom,
! [X0,X1,X2] :
( greater(X1,X2)
=> X1 = vplus(X2,vskolem7(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(proof(196), 0), 9)') ).
fof(f14,axiom,
! [X0,X1] : greater(vplus(X0,X1),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(189, 0), 0)') ).
fof(f15,axiom,
! [X0,X1,X2] :
( ( leq(X0,X1)
& leq(X1,X2) )
=> leq(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(184, 0), 0)') ).
fof(f16,axiom,
! [X0,X1] :
( less(X0,X1)
=> greater(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(147, 0), 0)') ).
fof(f17,axiom,
! [X0,X1] :
( greater(X0,X1)
=> less(X1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(140, 0), 0)') ).
fof(f18,axiom,
! [X0,X1] :
( less(X0,X1)
| greater(X0,X1)
| X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 0)') ).
fof(f19,axiom,
! [X0,X1] :
( ~ less(X0,X1)
| X0 != X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 1)') ).
fof(f20,axiom,
! [X0,X1] :
( ~ less(X0,X1)
| ~ greater(X0,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 2)') ).
fof(f21,axiom,
! [X0,X1] :
( ~ greater(X0,X1)
| X0 != X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(130), 0), 3)') ).
fof(f22,axiom,
! [X0,X1] :
( less(X1,X0)
<=> ? [X2] : X0 = vplus(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 12), 1)') ).
fof(f23,axiom,
! [X0,X1] :
( greater(X1,X0)
<=> ? [X2] : X1 = vplus(X0,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','def(cond(conseq(axiom(3)), 11), 1)') ).
fof(f24,axiom,
! [X0,X1] :
( ? [X3] : X1 = vplus(X0,X3)
| ? [X2] : X0 = vplus(X1,X2)
| X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 0)') ).
fof(f25,axiom,
! [X0,X1] :
( ~ ? [X2] : X1 = vplus(X0,X2)
| X0 != X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 1)') ).
fof(f26,axiom,
! [X0,X1] :
( ~ ? [X3] : X1 = vplus(X0,X3)
| ~ ? [X2] : X0 = vplus(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 2)') ).
fof(f27,axiom,
! [X0,X1] :
( ~ ? [X2] : X0 = vplus(X1,X2)
| X0 != X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(goal(88), 0), 3)') ).
fof(f28,axiom,
! [X0,X1] : vplus(X1,X0) = vplus(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(61, 0), 0)') ).
fof(f29,axiom,
! [X0,X1] : vplus(vsucc(X0),X1) = vsucc(vplus(X0,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(52, 0), 0)') ).
fof(f30,axiom,
! [X0,X1,X2] : vplus(vplus(X0,X1),X2) = vplus(X0,vplus(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','ass(cond(33, 0), 0)') ).
fof(f31,axiom,
! [X0,X1] :
( vplus(X0,v1) = vsucc(X0)
& vplus(X0,vsucc(X1)) = vsucc(vplus(X0,X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','qu(cond(conseq(axiom(3)), 3), and(holds(definiens(29), 45, 0), holds(definiens(29), 44, 0)))') ).
fof(f32,plain,
~ greater(vplus(vd301,vd303),vplus(vd302,vd303)),
inference(flattening,[],[f2]) ).
fof(f39,plain,
! [X0,X1,X2] :
( ~ greater(X1,X2)
| greater(vplus(X1,X0),vplus(X2,X0)) ),
inference(ennf_transformation,[],[f8]) ).
fof(f61,plain,
~ greater(vplus(vd301,vd303),vplus(vd302,vd303)),
inference(cnf_transformation,[],[f32]) ).
fof(f62,plain,
greater(vd301,vd302),
inference(cnf_transformation,[],[f3]) ).
fof(f67,plain,
! [X2,X0,X1] :
( ~ greater(X1,X2)
| greater(vplus(X1,X0),vplus(X2,X0)) ),
inference(cnf_transformation,[],[f39]) ).
tcf(c_49,negated_conjecture,
~ greater(vplus(vd301,vd303),vplus(vd302,vd303)),
inference(cnf_transformation,[],[f61]) ).
tcf(c_50,plain,
greater(vd301,vd302),
inference(cnf_transformation,[],[f62]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i] :
( greater(vplus(X0,X2),vplus(X1,X2))
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f67]) ).
tcf(c_740,plain,
! [X0: $i] :
( greater(vplus(vd301,X0),vplus(vd302,X0))
| ~ greater(vd301,vd302) ),
inference(instantiation,[status(thm)],[c_54]) ).
tcf(c_3708,plain,
( greater(vplus(vd301,vd303),vplus(vd302,vd303))
| ~ greater(vd301,vd302) ),
inference(instantiation,[status(thm)],[c_740]) ).
tcf(c_3709,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3708,c_49,c_50]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : NUM838+2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.36 % Computer : n009.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Thu Sep 24 05:32:58 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.40
% 0.12/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.40
% 0.12/0.40 % Detected problem language: tptp
% 0.12/0.42 % Proving...
% 3.51/1.27 % SZS status Started for theBenchmark.p
% 3.51/1.27 % SZS status Theorem for theBenchmark.p
% 3.51/1.27
% 3.51/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.51/1.27
% 3.51/1.27 % ------ iProver source info
% 3.51/1.27
% 3.51/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 3.51/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.51/1.27 % git: non_committed_changes: false
% 3.51/1.27
% 3.51/1.27 % ------ Parsing...
% 3.51/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.51/1.27
% 3.51/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 3.51/1.27
% 3.51/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.51/1.27
% 3.51/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.51/1.27 % ------ Proving...
% 3.51/1.27 % ------ Problem Properties
% 3.51/1.27
% 3.51/1.27 %
% 3.51/1.27 % clauses 23
% 3.51/1.27 % conjectures 1
% 3.51/1.27 % EPR 8
% 3.51/1.27 % Horn 21
% 3.51/1.27 % unary 11
% 3.51/1.27 % binary 10
% 3.51/1.27 % lits 37
% 3.51/1.27 % lits eq 13
% 3.51/1.27 % fd_pure 0
% 3.51/1.27 % fd_pseudo 0
% 3.51/1.27 % fd_cond 0
% 3.51/1.27 % fd_pseudo_cond 1
% 3.51/1.27 % AC symbols 1
% 3.51/1.27
% 3.51/1.27 % ------ Schedule dynamic 5 is on
% 3.51/1.27
% 3.51/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.51/1.27
% 3.51/1.27
% 3.51/1.27 % ------
% 3.51/1.27 % Current options:
% 3.51/1.27 % ------
% 3.51/1.27
% 3.51/1.27
% 3.51/1.27 %
% 3.51/1.27
% 3.51/1.27 % ------ Proving...
% 3.51/1.27 %
% 3.51/1.27
% 3.51/1.27 % SZS status Theorem for theBenchmark.p
% 3.51/1.27
% 3.51/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.51/1.27
% 3.51/1.27
%------------------------------------------------------------------------------