%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : LCL893+1 : TPTP v9.3.1. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n016.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:08:37 PM UTC 2026
% Result : Theorem 1.37s 1.18s
% Output : CNFRefutation 1.37s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of formulae : 48 ( 29 unt; 1 def)
% Number of atoms : 86 ( 35 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 50 ( 24 ~; 17 |; 4 &)
% ( 1 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn 62 !; 1 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X0,X1] : '+'(X0,X1) = '+'(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_02) ).
fof(f3,axiom,
! [X0] : '+'(X0,'0') = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_03) ).
fof(f7,axiom,
! [X0,X1] :
( ( '>='(X1,X0)
& '>='(X0,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_07) ).
fof(f8,axiom,
! [X0,X1,X2] :
( '>='('+'(X0,X1),X2)
<=> '>='(X1,'==>'(X0,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_08) ).
fof(f9,axiom,
! [X0] : '>='(X0,'0'),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_09) ).
fof(f10,axiom,
! [X0,X1,X2] :
( '>='(X0,X1)
=> '>='('+'(X0,X2),'+'(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_10) ).
fof(f14,axiom,
! [X0] : h(X0) = '==>'(h(X0),X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_14) ).
fof(f15,conjecture,
! [X0] :
( h(X0) = X0
=> X0 = '0' ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals_15) ).
fof(f16,negated_conjecture,
~ ! [X0] :
( h(X0) = X0
=> X0 = '0' ),
inference(negated_conjecture,[status(cth)],[f15]) ).
fof(f19,plain,
! [X0,X1] :
( ~ '>='(X1,X0)
| ~ '>='(X0,X1)
| X0 = X1 ),
inference(ennf_transformation,[],[f7]) ).
fof(f20,plain,
! [X0,X1] :
( ~ '>='(X1,X0)
| ~ '>='(X0,X1)
| X0 = X1 ),
inference(flattening,[],[f19]) ).
fof(f21,plain,
! [X0,X1,X2] :
( ~ '>='(X0,X1)
| '>='('+'(X0,X2),'+'(X1,X2)) ),
inference(ennf_transformation,[],[f10]) ).
fof(f24,plain,
? [X0] :
( h(X0) = X0
& '0' != X0 ),
inference(ennf_transformation,[],[f16]) ).
fof(f25,plain,
! [X0,X1,X2] :
( ( ~ '>='('+'(X0,X1),X2)
| '>='(X1,'==>'(X0,X2)) )
& ( ~ '>='(X1,'==>'(X0,X2))
| '>='('+'(X0,X1),X2) ) ),
inference(nnf_transformation,[],[f8]) ).
fof(f26,plain,
( sK0 = h(sK0)
& '0' != sK0 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0]),skolemize(X0,sK0)],[f24]) ).
fof(f28,plain,
! [X0,X1] : '+'(X0,X1) = '+'(X1,X0),
inference(cnf_transformation,[],[f2]) ).
fof(f29,plain,
! [X0] : '+'(X0,'0') = X0,
inference(cnf_transformation,[],[f3]) ).
fof(f33,plain,
! [X0,X1] :
( ~ '>='(X1,X0)
| ~ '>='(X0,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f20]) ).
fof(f34,plain,
! [X2,X0,X1] :
( ~ '>='('+'(X0,X1),X2)
| '>='(X1,'==>'(X0,X2)) ),
inference(cnf_transformation,[],[f25]) ).
fof(f36,plain,
! [X0] : '>='(X0,'0'),
inference(cnf_transformation,[],[f9]) ).
fof(f37,plain,
! [X2,X0,X1] :
( ~ '>='(X0,X1)
| '>='('+'(X0,X2),'+'(X1,X2)) ),
inference(cnf_transformation,[],[f21]) ).
fof(f41,plain,
! [X0] : h(X0) = '==>'(h(X0),X0),
inference(cnf_transformation,[],[f14]) ).
fof(f42,plain,
sK0 = h(sK0),
inference(cnf_transformation,[],[f26]) ).
fof(f43,plain,
'0' != sK0,
inference(cnf_transformation,[],[f26]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i] : '+'(X0,X1) = '+'(X1,X0),
inference(cnf_transformation,[],[f28]) ).
tcf(c_51,plain,
! [X0: $i] : '+'(X0,'0') = X0,
inference(cnf_transformation,[],[f29]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ~ '>='(X1,X0)
| ~ '>='(X0,X1) ),
inference(cnf_transformation,[],[f33]) ).
tcf(c_57,plain,
! [X0: $i,X1: $i,X2: $i] :
( '>='(X1,'==>'(X0,X2))
| ~ '>='('+'(X0,X1),X2) ),
inference(cnf_transformation,[],[f34]) ).
tcf(c_58,plain,
! [X0: $i] : '>='(X0,'0'),
inference(cnf_transformation,[],[f36]) ).
tcf(c_59,plain,
! [X0: $i,X1: $i,X2: $i] :
( '>='('+'(X0,X2),'+'(X1,X2))
| ~ '>='(X0,X1) ),
inference(cnf_transformation,[],[f37]) ).
tcf(c_63,plain,
! [X0: $i] : '==>'(h(X0),X0) = h(X0),
inference(cnf_transformation,[],[f41]) ).
tcf(c_64,negated_conjecture,
'0' != sK0,
inference(cnf_transformation,[],[f43]) ).
tcf(c_65,negated_conjecture,
h(sK0) = sK0,
inference(cnf_transformation,[],[f42]) ).
tcf(c_167,definition,
iPr_def_10 = h(sK0),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_168,negated_conjecture,
iPr_def_10 = sK0,
inference(demodulation,[status(thm)],[c_65,c_167]) ).
tcf(c_169,negated_conjecture,
'0' != sK0,
inference(demodulation,[status(thm)],[c_64]) ).
tcf(c_354,plain,
'0' != iPr_def_10,
inference(light_normalisation,[status(thm)],[c_169,c_168]) ).
tcf(c_355,plain,
h(iPr_def_10) = iPr_def_10,
inference(light_normalisation,[status(thm)],[c_167,c_168]) ).
tcf(c_362,plain,
! [X0: $i] : '+'('0',X0) = X0,
inference(superposition,[status(thm)],[c_50,c_51]) ).
tcf(c_369,plain,
'==>'(iPr_def_10,iPr_def_10) = iPr_def_10,
inference(superposition,[status(thm)],[c_355,c_63]) ).
tcf(c_688,plain,
! [X0: $i,X1: $i] :
( '>='('+'(X0,X1),X1)
| ~ '>='(X0,'0') ),
inference(superposition,[status(thm)],[c_362,c_59]) ).
tcf(c_696,plain,
! [X0: $i,X1: $i] : '>='('+'(X0,X1),X1),
inference(forward_subsumption_resolution,[status(thm)],[c_688,c_58]) ).
tcf(c_913,plain,
! [X0: $i,X1: $i] : '>='('+'(X0,X1),X0),
inference(superposition,[status(thm)],[c_50,c_696]) ).
tcf(c_981,plain,
! [X0: $i,X1: $i] : '>='(X0,'==>'(X1,X1)),
inference(superposition,[status(thm)],[c_913,c_57]) ).
tcf(c_1522,plain,
! [X0: $i] : '>='(X0,iPr_def_10),
inference(superposition,[status(thm)],[c_369,c_981]) ).
tcf(c_1554,plain,
! [X0: $i] :
( ( X0 = iPr_def_10 )
| ~ '>='(iPr_def_10,X0) ),
inference(superposition,[status(thm)],[c_1522,c_55]) ).
tcf(c_1651,plain,
'0' = iPr_def_10,
inference(superposition,[status(thm)],[c_58,c_1554]) ).
tcf(c_1662,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1651,c_354]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL893+1 : TPTP v9.3.1. Released v5.5.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n016.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 00:43:58 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.39 Running first-order theorem proving
% 0.10/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.10/0.40
% 0.10/0.40 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.40
% 0.10/0.40 % Detected problem language: tptp
% 0.10/0.42 % Proving...
% 1.37/1.18 % SZS status Started for theBenchmark.p
% 1.37/1.18 % SZS status Theorem for theBenchmark.p
% 1.37/1.18
% 1.37/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.37/1.18
% 1.37/1.18 % ------ iProver source info
% 1.37/1.18
% 1.37/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 1.37/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.37/1.18 % git: non_committed_changes: false
% 1.37/1.18
% 1.37/1.18 % ------ Parsing...
% 1.37/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.37/1.18
% 1.37/1.18 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e %
% 1.37/1.18
% 1.37/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.37/1.18
% 1.37/1.18 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.37/1.18 % ------ Proving...
% 1.37/1.18 % ------ Problem Properties
% 1.37/1.18
% 1.37/1.18 %
% 1.37/1.18 % clauses 18
% 1.37/1.18 % conjectures 2
% 1.37/1.18 % EPR 6
% 1.37/1.18 % Horn 18
% 1.37/1.18 % unary 11
% 1.37/1.18 % binary 5
% 1.37/1.18 % lits 27
% 1.37/1.18 % lits eq 10
% 1.37/1.18 % fd_pure 0
% 1.37/1.18 % fd_pseudo 0
% 1.37/1.18 % fd_cond 0
% 1.37/1.18 % fd_pseudo_cond 1
% 1.37/1.18 % AC symbols 1
% 1.37/1.18
% 1.37/1.18 % ------ Schedule dynamic 5 is on
% 1.37/1.18
% 1.37/1.18 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.37/1.18
% 1.37/1.18
% 1.37/1.18 % ------
% 1.37/1.18 % Current options:
% 1.37/1.18 % ------
% 1.37/1.18
% 1.37/1.18
% 1.37/1.18 %
% 1.37/1.18
% 1.37/1.18 % ------ Proving...
% 1.37/1.18 %
% 1.37/1.18
% 1.37/1.18 % SZS status Theorem for theBenchmark.p
% 1.37/1.18
% 1.37/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.37/1.18
% 1.37/1.18
%------------------------------------------------------------------------------