%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM841+1 : 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 : n012.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 1.44s 0.97s
% Output : CNFRefutation 1.44s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f4ERROR: Could not build tree for root c_1644ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f56,plain,
! [X0,X1,X2] :
( ( ( ~ less(X0,X1)
| ~ leq(X1,X2) )
& ( ~ leq(X0,X1)
| ~ less(X1,X2) ) )
| less(X0,X2) ),
inference(ennf_transformation,[],[f17]) ).
fof(f61,plain,
! [X0,X1] :
( ~ less(X0,X1)
| greater(X1,X0) ),
inference(ennf_transformation,[],[f23]) ).
fof(f62,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| less(X1,X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f70,plain,
! [X0,X1] :
( ( ~ leq(X1,X0)
| X1 = X0
| less(X1,X0) )
& ( ( X0 != X1
& ~ less(X1,X0) )
| leq(X1,X0) ) ),
inference(nnf_transformation,[],[f21]) ).
fof(f71,plain,
! [X0,X1] :
( ( ~ leq(X1,X0)
| X1 = X0
| less(X1,X0) )
& ( ( X0 != X1
& ~ less(X1,X0) )
| leq(X1,X0) ) ),
inference(flattening,[],[f70]) ).
fof(f81,plain,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(cnf_transformation,[],[f47]) ).
fof(f83,plain,
greater(vplus(vd347,vd345),vplus(vd348,vd345)),
inference(cnf_transformation,[],[f4]) ).
fof(f85,plain,
greater(vplus(vd344,vd347),vplus(vd345,vd347)),
inference(cnf_transformation,[],[f6]) ).
fof(f97,plain,
! [X2,X0,X1] :
( ~ leq(X0,X1)
| ~ less(X1,X2)
| less(X0,X2) ),
inference(cnf_transformation,[],[f56]) ).
fof(f103,plain,
! [X0,X1] :
( ~ less(X1,X0)
| leq(X1,X0) ),
inference(cnf_transformation,[],[f71]) ).
fof(f107,plain,
! [X0,X1] :
( ~ less(X0,X1)
| greater(X1,X0) ),
inference(cnf_transformation,[],[f61]) ).
fof(f108,plain,
! [X0,X1] :
( ~ greater(X0,X1)
| less(X1,X0) ),
inference(cnf_transformation,[],[f62]) ).
fof(f109,plain,
! [X0,X1] :
( less(X0,X1)
| greater(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f25]) ).
fof(f111,plain,
! [X0,X1] :
( ~ less(X0,X1)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f27]) ).
fof(f123,plain,
! [X0,X1] : vplus(X0,X1) = vplus(X1,X0),
inference(cnf_transformation,[],[f37]) ).
fof(f126,plain,
! [X2,X0,X1] : vplus(vplus(X0,X1),X2) = vplus(X0,vplus(X1,X2)),
inference(cnf_transformation,[],[f40]) ).
tcf(c_49,negated_conjecture,
~ greater(vplus(vd344,vd347),vplus(vd345,vd348)),
inference(cnf_transformation,[],[f81]) ).
tcf(c_51,plain,
greater(vplus(vd347,vd345),vplus(vd348,vd345)),
inference(cnf_transformation,[],[f83]) ).
tcf(c_53,plain,
greater(vplus(vd344,vd347),vplus(vd345,vd347)),
inference(cnf_transformation,[],[f85]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i] :
( less(X2,X1)
| ~ leq(X2,X0)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f97]) ).
tcf(c_68,plain,
! [X0: $i,X1: $i] :
( leq(X0,X1)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f103]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] :
( greater(X1,X0)
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f107]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i] :
( less(X1,X0)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f108]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i] :
( less(X0,X1)
| greater(X0,X1)
| ( X0 = X1 ) ),
inference(cnf_transformation,[],[f109]) ).
tcf(c_78,plain,
! [X0: $i,X1: $i] :
( ~ less(X0,X1)
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f111]) ).
tcf(c_90,plain,
! [X0: $i,X1: $i] : vplus(X0,X1) = vplus(X1,X0),
inference(cnf_transformation,[],[f123]) ).
tcf(c_92,plain,
! [X0: $i,X1: $i,X2: $i] : vplus(vplus(X0,X1),X2) = vplus(X0,vplus(X1,X2)),
inference(cnf_transformation,[],[f126]) ).
tcf(c_119,negated_conjecture,
~ greater(vplus(vd347,vd344),vplus(vd345,vd348)),
inference(theory_normalisation,[status(thm)],[c_49,c_92,c_90]) ).
tcf(c_120,plain,
greater(vplus(vd345,vd347),vplus(vd345,vd348)),
inference(theory_normalisation,[status(thm)],[c_51,c_92,c_90]) ).
tcf(c_121,plain,
greater(vplus(vd347,vd344),vplus(vd345,vd347)),
inference(theory_normalisation,[status(thm)],[c_53,c_92,c_90]) ).
tcf(c_655,definition,
iPr_def_10 = vplus(vd347,vd344),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_656,definition,
iPr_def_11 = vplus(vd345,vd348),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_657,negated_conjecture,
~ greater(iPr_def_10,iPr_def_11),
inference(demodulation,[status(thm)],[c_119,c_656,c_655]) ).
tcf(c_1002,plain,
greater(vplus(vd345,vd347),iPr_def_11),
inference(light_normalisation,[status(thm)],[c_120,c_656]) ).
tcf(c_1029,plain,
less(iPr_def_11,vplus(vd345,vd347)),
inference(superposition,[status(thm)],[c_1002,c_75]) ).
tcf(c_1036,plain,
greater(iPr_def_10,vplus(vd345,vd347)),
inference(light_normalisation,[status(thm)],[c_121,c_655]) ).
tcf(c_1037,plain,
less(vplus(vd345,vd347),iPr_def_10),
inference(superposition,[status(thm)],[c_1036,c_75]) ).
tcf(c_1062,plain,
~ greater(iPr_def_11,vplus(vd345,vd347)),
inference(superposition,[status(thm)],[c_1029,c_78]) ).
tcf(c_1065,plain,
~ greater(vplus(vd345,vd347),iPr_def_10),
inference(superposition,[status(thm)],[c_1037,c_78]) ).
tcf(c_1067,plain,
leq(vplus(vd345,vd347),iPr_def_10),
inference(superposition,[status(thm)],[c_1037,c_68]) ).
tcf(c_1084,plain,
( less(iPr_def_10,iPr_def_11)
| ( iPr_def_10 = iPr_def_11 ) ),
inference(superposition,[status(thm)],[c_76,c_657]) ).
tcf(c_1377,plain,
! [X0: $i] :
( less(X0,iPr_def_11)
| ( iPr_def_10 = iPr_def_11 )
| ~ leq(X0,iPr_def_10) ),
inference(superposition,[status(thm)],[c_1084,c_63]) ).
tcf(c_1531,plain,
( less(vplus(vd345,vd347),iPr_def_11)
| ( iPr_def_10 = iPr_def_11 ) ),
inference(superposition,[status(thm)],[c_1067,c_1377]) ).
tcf(c_1623,plain,
( greater(iPr_def_11,vplus(vd345,vd347))
| ( iPr_def_10 = iPr_def_11 ) ),
inference(superposition,[status(thm)],[c_1531,c_74]) ).
tcf(c_1627,plain,
iPr_def_10 = iPr_def_11,
inference(forward_subsumption_resolution,[status(thm)],[c_1623,c_1062]) ).
tcf(c_1642,plain,
greater(vplus(vd345,vd347),iPr_def_10),
inference(demodulation,[status(thm)],[c_1002,c_1627]) ).
tcf(c_1644,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1642,c_1065]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : NUM841+1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.02 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.03/0.30 % Computer : n012.cluster.edu
% 0.03/0.30 % Model : x86_64 x86_64
% 0.03/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.30 % Memory : 8046.5625MB
% 0.03/0.30 % OS : Linux 6.8.0-71-generic
% 0.03/0.30 % CPULimit : 300
% 0.03/0.30 % WCLimit : 300
% 0.03/0.30 % DateTime : Thu Sep 24 05:33:22 UTC 2026
% 0.03/0.31 % CPUTime :
% 0.03/0.31 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.07/0.33 Running first-order theorem proving
% 0.07/0.33 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.07/0.33
% 0.07/0.33 % ======== iProver multi-core TPTP/SMT =========
% 0.07/0.33
% 0.07/0.33 % Detected problem language: tptp
% 0.07/0.34 % Proving...
% 1.44/0.97 % SZS status Started for theBenchmark.p
% 1.44/0.97 % SZS status Theorem for theBenchmark.p
% 1.44/0.97
% 1.44/0.97 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.44/0.97
% 1.44/0.97 % ------ iProver source info
% 1.44/0.97
% 1.44/0.97 % git: date: 2026-07-19 20:42:38 +0200
% 1.44/0.97 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.44/0.97 % git: non_committed_changes: false
% 1.44/0.97
% 1.44/0.97 % ------ Parsing...
% 1.44/0.97 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.44/0.97
% 1.44/0.97 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.44/0.97
% 1.44/0.97 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.44/0.97
% 1.44/0.97 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.44/0.97 % ------ Proving...
% 1.44/0.97 % ------ Problem Properties
% 1.44/0.97
% 1.44/0.97 %
% 1.44/0.97 % clauses 38
% 1.44/0.97 % conjectures 1
% 1.44/0.97 % EPR 18
% 1.44/0.97 % Horn 33
% 1.44/0.97 % unary 16
% 1.44/0.97 % binary 14
% 1.44/0.97 % lits 68
% 1.44/0.97 % lits eq 20
% 1.44/0.97 % fd_pure 0
% 1.44/0.97 % fd_pseudo 0
% 1.44/0.97 % fd_cond 0
% 1.44/0.97 % fd_pseudo_cond 5
% 1.44/0.97 % AC symbols 1
% 1.44/0.97
% 1.44/0.97 % ------ Schedule dynamic 5 is on
% 1.44/0.97
% 1.44/0.97 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.44/0.97
% 1.44/0.97
% 1.44/0.97 % ------
% 1.44/0.97 % Current options:
% 1.44/0.97 % ------
% 1.44/0.97
% 1.44/0.97
% 1.44/0.97 %
% 1.44/0.97
% 1.44/0.97 % ------ Proving...
% 1.44/0.97 %
% 1.44/0.97
% 1.44/0.97 % SZS status Theorem for theBenchmark.p
% 1.44/0.97
% 1.44/0.97 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.44/0.97
% 1.44/0.97
%------------------------------------------------------------------------------