%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC037+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n011.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 03:07:37 PM UTC 2026
% Result : Theorem 3.70s 1.27s
% Output : CNFRefutation 3.70s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f614ERROR: Could not build tree for root c_11968ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssList(X4)
=> ( ~ segmentP(X2,X4)
| ~ segmentP(X3,X4)
| ~ neq(X4,nil) ) ) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssList(X4)
=> ( ~ segmentP(X2,X4)
| ~ segmentP(X3,X4)
| ~ neq(X4,nil) ) ) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f176,plain,
! [X0] :
( ~ ssList(X0)
| ( segmentP(nil,X0)
<=> nil = X0 ) ),
inference(ennf_transformation,[],[f58]) ).
fof(f201,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ssList(X4)
& segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil) ) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ssList(X4)
& segmentP(X2,X4)
& segmentP(X3,X4)
& neq(X4,nil) ) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f285,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ segmentP(nil,X0)
| nil = X0 )
& ( nil != X0
| segmentP(nil,X0) ) ) ),
inference(nnf_transformation,[],[f176]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ( ( nil = sK55
& nil = sK56 )
| ( ssList(sK57)
& segmentP(sK55,sK57)
& segmentP(sK56,sK57)
& neq(sK57,nil) ) )
& nil != sK53
& sK53 = sK55
& sK54 = sK56
& nil = sK54 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X4,sK57)],[f222]) ).
fof(f443,plain,
! [X0] :
( ~ ssList(X0)
| ~ segmentP(nil,X0)
| nil = X0 ),
inference(cnf_transformation,[],[f285]) ).
fof(f482,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f201]) ).
fof(f497,plain,
ssList(sK54),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( nil = sK55
| ssList(sK57) ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
( nil = sK55
| segmentP(sK56,sK57) ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
( nil = sK55
| neq(sK57,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
nil != sK53,
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f510,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f511,plain,
nil = sK54,
inference(cnf_transformation,[],[f296]) ).
fof(f512,plain,
nil = sK56,
inference(definition_unfolding,[],[f511,f510]) ).
fof(f533,plain,
! [X0] :
( ~ ssList(X0)
| ~ segmentP(sK56,X0)
| sK56 = X0 ),
inference(definition_unfolding,[],[f443,f512,f512]) ).
fof(f568,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,sK56) = X0 ),
inference(definition_unfolding,[],[f482,f512]) ).
fof(f571,plain,
sK55 != sK56,
inference(definition_unfolding,[],[f508,f512,f509]) ).
fof(f573,plain,
( sK55 = sK56
| neq(sK57,sK56) ),
inference(definition_unfolding,[],[f506,f512,f512]) ).
fof(f575,plain,
( sK55 = sK56
| segmentP(sK56,sK57) ),
inference(definition_unfolding,[],[f504,f512]) ).
fof(f579,plain,
( sK55 = sK56
| ssList(sK57) ),
inference(definition_unfolding,[],[f500,f512]) ).
fof(f580,plain,
ssList(sK56),
inference(definition_unfolding,[],[f497,f510]) ).
tcf(c_139,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f611]) ).
tcf(c_196,negated_conjecture,
! [X0: $i] :
( ( X0 = sK56 )
| ~ ssList(X0)
| ~ segmentP(sK56,X0) ),
inference(cnf_transformation,[],[f533]) ).
tcf(c_229,negated_conjecture,
( ( app(sK56,sK56) = sK56 )
| ~ ssList(sK56) ),
inference(cnf_transformation,[],[f614]) ).
tcf(c_232,negated_conjecture,
! [X0: $i] :
( ( app(X0,sK56) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f568]) ).
tcf(c_246,negated_conjecture,
sK56 != sK55,
inference(cnf_transformation,[],[f571]) ).
tcf(c_247,negated_conjecture,
( neq(sK57,sK56)
| ( sK56 = sK55 ) ),
inference(cnf_transformation,[],[f573]) ).
tcf(c_248,negated_conjecture,
( segmentP(sK56,sK57)
| ( sK56 = sK55 ) ),
inference(cnf_transformation,[],[f575]) ).
tcf(c_250,negated_conjecture,
( ssList(sK57)
| ( sK56 = sK55 ) ),
inference(cnf_transformation,[],[f579]) ).
tcf(c_253,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f580]) ).
tcf(c_295,plain,
( ( app(sK56,sK56) = sK56 )
| ~ ssList(sK56) ),
inference(instantiation,[status(thm)],[c_232]) ).
tcf(c_361,negated_conjecture,
ssList(sK57),
inference(global_subsumption_just,[status(thm)],[c_250,c_246,c_250]) ).
tcf(c_371,negated_conjecture,
segmentP(sK56,sK57),
inference(global_subsumption_just,[status(thm)],[c_248,c_246,c_248]) ).
tcf(c_373,negated_conjecture,
neq(sK57,sK56),
inference(global_subsumption_just,[status(thm)],[c_247,c_246,c_247]) ).
tcf(c_375,negated_conjecture,
app(sK56,sK56) = sK56,
inference(global_subsumption_just,[status(thm)],[c_229,c_253,c_295]) ).
tcf(c_3210,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( X0 != sK57 )
| ( X0 != sK56 ) ),
inference(resolution_lifted,[status(thm)],[c_139,c_373]) ).
tcf(c_3211,plain,
( ~ ssList(sK56)
| ( sK56 != sK57 ) ),
inference(unflattening,[status(thm)],[c_3210]) ).
tcf(c_3212,plain,
sK56 != sK57,
inference(global_subsumption_just,[status(thm)],[c_3211,c_253,c_3211]) ).
tcf(c_8803,definition,
iPr_def_10 = app(sK56,sK56),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_8804,plain,
sK56 != sK57,
inference(demodulation,[status(thm)],[c_3212]) ).
tcf(c_8811,negated_conjecture,
iPr_def_10 = sK56,
inference(demodulation,[status(thm)],[c_375,c_8803]) ).
tcf(c_8812,negated_conjecture,
segmentP(sK56,sK57),
inference(demodulation,[status(thm)],[c_371]) ).
tcf(c_8817,negated_conjecture,
ssList(sK57),
inference(demodulation,[status(thm)],[c_361]) ).
tcf(c_8846,negated_conjecture,
! [X0: $i] :
( ( X0 = sK56 )
| ~ ssList(X0)
| ~ segmentP(sK56,X0) ),
inference(demodulation,[status(thm)],[c_196]) ).
tcf(c_11668,plain,
segmentP(iPr_def_10,sK57),
inference(light_normalisation,[status(thm)],[c_8812,c_8811]) ).
tcf(c_11702,plain,
sK57 != iPr_def_10,
inference(light_normalisation,[status(thm)],[c_8804,c_8811]) ).
tcf(c_11955,plain,
! [X0: $i] :
( ( X0 = iPr_def_10 )
| ~ ssList(X0)
| ~ segmentP(iPr_def_10,X0) ),
inference(light_normalisation,[status(thm)],[c_8846,c_8811]) ).
tcf(c_11965,plain,
( ( sK57 = iPr_def_10 )
| ~ ssList(sK57) ),
inference(superposition,[status(thm)],[c_11668,c_11955]) ).
tcf(c_11968,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11965,c_11702,c_8817]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC037+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.36 % Computer : n011.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 16:02:43 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.08/0.39 Running first-order theorem proving
% 0.08/0.39 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.08/0.41
% 0.08/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.08/0.41
% 0.08/0.41 % Detected problem language: tptp
% 0.08/0.42 % Proving...
% 3.70/1.27 % SZS status Started for theBenchmark.p
% 3.70/1.27 % SZS status Theorem for theBenchmark.p
% 3.70/1.27
% 3.70/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.70/1.27
% 3.70/1.27 % ------ iProver source info
% 3.70/1.27
% 3.70/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 3.70/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.70/1.27 % git: non_committed_changes: false
% 3.70/1.27
% 3.70/1.27 % ------ Parsing...
% 3.70/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.70/1.27
% 3.70/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e %
% 3.70/1.27
% 3.70/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.70/1.27
% 3.70/1.27 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.70/1.27 % ------ Proving...
% 3.70/1.27 % ------ Problem Properties
% 3.70/1.27
% 3.70/1.27 %
% 3.70/1.27 % clauses 187
% 3.70/1.27 % conjectures 53
% 3.70/1.27 % EPR 56
% 3.70/1.27 % Horn 119
% 3.70/1.27 % unary 23
% 3.70/1.27 % binary 40
% 3.70/1.27 % lits 625
% 3.70/1.27 % lits eq 81
% 3.70/1.27 % fd_pure 0
% 3.70/1.27 % fd_pseudo 0
% 3.70/1.27 % fd_cond 21
% 3.70/1.27 % fd_pseudo_cond 14
% 3.70/1.27 % AC symbols 0
% 3.70/1.27
% 3.70/1.27 % ------ Schedule dynamic 5 is on
% 3.70/1.27
% 3.70/1.27 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.70/1.27
% 3.70/1.27
% 3.70/1.27 % ------
% 3.70/1.27 % Current options:
% 3.70/1.27 % ------
% 3.70/1.27
% 3.70/1.27
% 3.70/1.27 %
% 3.70/1.27
% 3.70/1.27 % ------ Proving...
% 3.70/1.27 %
% 3.70/1.27
% 3.70/1.27 % SZS status Theorem for theBenchmark.p
% 3.70/1.27
% 3.70/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.70/1.27
% 3.70/1.27
%------------------------------------------------------------------------------