%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : NUM836+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 : n005.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:50 PM UTC 2026
% Result : Theorem 3.35s 1.25s
% Output : CNFRefutation 3.35s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f15ERROR: Could not build tree for root c_401ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f23,plain,
( less(vd203,vd204)
& greater(vd203,vd204) ),
inference(ennf_transformation,[],[f2]) ).
fof(f24,plain,
! [X0,X1] :
( ~ less(X1,X0)
| ? [X2] : X0 = vplus(X1,X2) ),
inference(ennf_transformation,[],[f22]) ).
fof(f32,plain,
! [X0,X1] :
( ~ less(X1,X0)
| vplus(X1,sK0(X0,X1)) = X0 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X2,sK0(X0,X1))],[f24]) ).
fof(f33,plain,
! [X0,X1] :
( ( ~ greater(X1,X0)
| ? [X2] : X1 = vplus(X0,X2) )
& ( ! [X2] : vplus(X0,X2) != X1
| greater(X1,X0) ) ),
inference(nnf_transformation,[],[f5]) ).
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(f37,plain,
less(vd203,vd204),
inference(cnf_transformation,[],[f23]) ).
fof(f38,plain,
greater(vd203,vd204),
inference(cnf_transformation,[],[f23]) ).
fof(f40,plain,
! [X0,X1] :
( ~ less(X1,X0)
| vplus(X1,sK0(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f32]) ).
fof(f41,plain,
! [X0,X1] :
( ~ greater(X1,X0)
| vplus(X0,sK1(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f35]) ).
fof(f48,plain,
! [X0,X1] : vplus(X0,X1) != X1,
inference(cnf_transformation,[],[f11]) ).
fof(f49,plain,
! [X0,X1] : vplus(X0,X1) = vplus(X1,X0),
inference(cnf_transformation,[],[f12]) ).
fof(f52,plain,
! [X2,X0,X1] : vplus(vplus(X0,X1),X2) = vplus(X0,vplus(X1,X2)),
inference(cnf_transformation,[],[f15]) ).
tcf(c_49,negated_conjecture,
greater(vd203,vd204),
inference(cnf_transformation,[],[f38]) ).
tcf(c_50,negated_conjecture,
less(vd203,vd204),
inference(cnf_transformation,[],[f37]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] :
( ( vplus(X0,sK0(X1,X0)) = X1 )
| ~ less(X0,X1) ),
inference(cnf_transformation,[],[f40]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i] :
( ( vplus(X1,sK1(X1,X0)) = X0 )
| ~ greater(X0,X1) ),
inference(cnf_transformation,[],[f41]) ).
tcf(c_60,plain,
! [X0: $i,X1: $i] : vplus(X0,X1) != X1,
inference(cnf_transformation,[],[f48]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : vplus(X0,X1) = vplus(X1,X0),
inference(cnf_transformation,[],[f49]) ).
tcf(c_63,plain,
! [X0: $i,X1: $i,X2: $i] : vplus(vplus(X0,X1),X2) = vplus(X0,vplus(X1,X2)),
inference(cnf_transformation,[],[f52]) ).
tcf(c_150,plain,
! [X0: $i,X1: $i] :
( ( vplus(X0,sK0(X1,X0)) = X1 )
| ( X1 != vd204 )
| ( X0 != vd203 ) ),
inference(resolution_lifted,[status(thm)],[c_50,c_52]) ).
tcf(c_151,plain,
vplus(vd203,sK0(vd204,vd203)) = vd204,
inference(unflattening,[status(thm)],[c_150]) ).
tcf(c_156,plain,
! [X0: $i,X1: $i] :
( ( vplus(X1,sK1(X1,X0)) = X0 )
| ( X1 != vd204 )
| ( X0 != vd203 ) ),
inference(resolution_lifted,[status(thm)],[c_49,c_54]) ).
tcf(c_157,plain,
vplus(vd204,sK1(vd204,vd203)) = vd203,
inference(unflattening,[status(thm)],[c_156]) ).
tcf(c_216,definition,
iPr_def_10 = sK1(vd204,vd203),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_217,definition,
iPr_def_11 = vplus(vd204,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_218,definition,
iPr_def_12 = sK0(vd204,vd203),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_219,definition,
iPr_def_13 = vplus(vd203,iPr_def_12),
introduced(definition,[new_symbols(definition,[iPr_def_13])],[]) ).
tcf(c_220,plain,
iPr_def_11 = vd203,
inference(demodulation,[status(thm)],[c_157,c_216,c_217]) ).
tcf(c_221,plain,
iPr_def_13 = vd204,
inference(demodulation,[status(thm)],[c_151,c_218,c_219]) ).
tcf(c_298,plain,
vplus(iPr_def_10,vd204) = iPr_def_11,
inference(theory_normalisation,[status(thm)],[c_217,c_63,c_61]) ).
tcf(c_299,plain,
vplus(iPr_def_10,iPr_def_13) = iPr_def_11,
inference(light_normalisation,[status(thm)],[c_298,c_221]) ).
tcf(c_301,plain,
vplus(iPr_def_12,vd203) = iPr_def_13,
inference(theory_normalisation,[status(thm)],[c_219,c_63,c_61]) ).
tcf(c_302,plain,
vplus(iPr_def_12,iPr_def_11) = iPr_def_13,
inference(light_normalisation,[status(thm)],[c_301,c_220]) ).
tcf(c_303,plain,
vplus(iPr_def_11,iPr_def_12) = iPr_def_13,
inference(demodulation,[status(thm)],[c_302,c_61]) ).
tcf(c_340,plain,
! [X0: $i,X1: $i,X2: $i] : vplus(X0,vplus(X1,X2)) != X2,
inference(superposition,[status(thm)],[c_63,c_60]) ).
tcf(c_378,plain,
! [X0: $i] : vplus(X0,iPr_def_11) != iPr_def_13,
inference(superposition,[status(thm)],[c_299,c_340]) ).
tcf(c_400,plain,
! [X0: $i] : vplus(iPr_def_11,X0) != iPr_def_13,
inference(superposition,[status(thm)],[c_61,c_378]) ).
tcf(c_401,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_303,c_400]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM836+1 : 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.35 % Computer : n005.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Thu Sep 24 05:32:18 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.12/0.38 Running first-order theorem proving
% 0.12/0.38 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.12/0.39
% 0.12/0.39 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.39
% 0.12/0.39 % Detected problem language: tptp
% 0.12/0.40 % Proving...
% 3.35/1.25 % SZS status Started for theBenchmark.p
% 3.35/1.25 % SZS status Theorem for theBenchmark.p
% 3.35/1.25
% 3.35/1.25 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.35/1.25
% 3.35/1.25 % ------ iProver source info
% 3.35/1.25
% 3.35/1.25 % git: date: 2026-07-19 20:42:38 +0200
% 3.35/1.25 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.35/1.25 % git: non_committed_changes: false
% 3.35/1.25
% 3.35/1.25 % ------ Parsing...
% 3.35/1.25 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.35/1.25
% 3.35/1.25 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e %
% 3.35/1.25
% 3.35/1.25 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.35/1.25
% 3.35/1.25 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.35/1.25 % ------ Proving...
% 3.35/1.25 % ------ Problem Properties
% 3.35/1.25
% 3.35/1.25 %
% 3.35/1.25 % clauses 15
% 3.35/1.25 % conjectures 0
% 3.35/1.25 % EPR 3
% 3.35/1.25 % Horn 13
% 3.35/1.25 % unary 12
% 3.35/1.25 % binary 2
% 3.35/1.25 % lits 19
% 3.35/1.25 % lits eq 19
% 3.35/1.25 % fd_pure 0
% 3.35/1.25 % fd_pseudo 0
% 3.35/1.25 % fd_cond 0
% 3.35/1.25 % fd_pseudo_cond 1
% 3.35/1.25 % AC symbols 1
% 3.35/1.25
% 3.35/1.25 % ------ Schedule dynamic 5 is on
% 3.35/1.25
% 3.35/1.25 % ------ no conjectures: strip conj schedule
% 3.35/1.25
% 3.35/1.25 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.35/1.25
% 3.35/1.25
% 3.35/1.25 % ------
% 3.35/1.25 % Current options:
% 3.35/1.25 % ------
% 3.35/1.25
% 3.35/1.25
% 3.35/1.25 %
% 3.35/1.25
% 3.35/1.25 % ------ Proving...
% 3.35/1.25 %
% 3.35/1.25
% 3.35/1.25 % SZS status Theorem for theBenchmark.p
% 3.35/1.25
% 3.35/1.25 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.35/1.25
% 3.35/1.25
%------------------------------------------------------------------------------