%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC328+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n015.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:09:19 PM UTC 2026
% Result : Theorem 2.80s 1.38s
% Output : CNFRefutation 2.80s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f597ERROR: Could not build tree for root c_11624ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(f74,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax74) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( equalelemsP(X0)
& segmentP(X1,X0) )
| X0 != X2
| X1 != X3
| nil != X2 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( equalelemsP(X0)
& segmentP(X1,X0) )
| X0 != X2
| X1 != X3
| nil != X2 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f175,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,nil) ),
inference(ennf_transformation,[],[f57]) ).
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)
& ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& X0 = X2
& X1 = X3
& nil = X2 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ~ equalelemsP(X0)
| ~ segmentP(X1,X0) )
& X0 = X2
& X1 = X3
& nil = X2 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ( ~ equalelemsP(sK53)
| ~ segmentP(sK54,sK53) )
& sK53 = sK55
& sK54 = sK56
& nil = sK55 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56)],[f222]) ).
fof(f442,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,nil) ),
inference(cnf_transformation,[],[f175]) ).
fof(f468,plain,
equalelemsP(nil),
inference(cnf_transformation,[],[f74]) ).
fof(f482,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f201]) ).
fof(f496,plain,
ssList(sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f497,plain,
ssList(sK54),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( ~ equalelemsP(sK53)
| ~ segmentP(sK54,sK53) ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
nil = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f522,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,sK55) ),
inference(definition_unfolding,[],[f442,f503]) ).
fof(f548,plain,
equalelemsP(sK55),
inference(definition_unfolding,[],[f468,f503]) ).
fof(f559,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,sK55) = X0 ),
inference(definition_unfolding,[],[f482,f503]) ).
fof(f562,plain,
( ~ equalelemsP(sK55)
| ~ segmentP(sK56,sK55) ),
inference(definition_unfolding,[],[f500,f502,f501,f501]) ).
fof(f563,plain,
ssList(sK56),
inference(definition_unfolding,[],[f497,f502]) ).
fof(f564,plain,
ssList(sK55),
inference(definition_unfolding,[],[f496,f501]) ).
tcf(c_194,negated_conjecture,
! [X0: $i] :
( segmentP(X0,sK55)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f522]) ).
tcf(c_218,negated_conjecture,
equalelemsP(sK55),
inference(cnf_transformation,[],[f548]) ).
tcf(c_229,negated_conjecture,
( ( app(sK55,sK55) = sK55 )
| ~ ssList(sK55) ),
inference(cnf_transformation,[],[f597]) ).
tcf(c_232,negated_conjecture,
! [X0: $i] :
( ( app(X0,sK55) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f559]) ).
tcf(c_246,negated_conjecture,
( ~ equalelemsP(sK55)
| ~ segmentP(sK56,sK55) ),
inference(cnf_transformation,[],[f562]) ).
tcf(c_249,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f563]) ).
tcf(c_250,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f564]) ).
tcf(c_291,plain,
( ( app(sK55,sK55) = sK55 )
| ~ ssList(sK55) ),
inference(instantiation,[status(thm)],[c_232]) ).
tcf(c_363,negated_conjecture,
~ segmentP(sK56,sK55),
inference(global_subsumption_just,[status(thm)],[c_246,c_218,c_246]) ).
tcf(c_365,negated_conjecture,
app(sK55,sK55) = sK55,
inference(global_subsumption_just,[status(thm)],[c_229,c_250,c_291]) ).
tcf(c_8766,definition,
iPr_def_10 = app(sK55,sK55),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_8773,negated_conjecture,
iPr_def_10 = sK55,
inference(demodulation,[status(thm)],[c_365,c_8766]) ).
tcf(c_8774,negated_conjecture,
~ segmentP(sK56,sK55),
inference(demodulation,[status(thm)],[c_363]) ).
tcf(c_8778,negated_conjecture,
ssList(sK56),
inference(demodulation,[status(thm)],[c_249]) ).
tcf(c_8806,negated_conjecture,
! [X0: $i] :
( segmentP(X0,sK55)
| ~ ssList(X0) ),
inference(demodulation,[status(thm)],[c_194]) ).
tcf(c_11619,plain,
~ segmentP(sK56,iPr_def_10),
inference(light_normalisation,[status(thm)],[c_8774,c_8773]) ).
tcf(c_11620,plain,
! [X0: $i] :
( segmentP(X0,iPr_def_10)
| ~ ssList(X0) ),
inference(light_normalisation,[status(thm)],[c_8806,c_8773]) ).
tcf(c_11623,plain,
~ ssList(sK56),
inference(superposition,[status(thm)],[c_11620,c_11619]) ).
tcf(c_11624,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11623,c_8778]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC328+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/0.42 % Computer : n015.cluster.edu
% 0.15/0.42 % Model : x86_64 x86_64
% 0.15/0.42 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.42 % Memory : 8046.5625MB
% 0.15/0.42 % OS : Linux 6.8.0-71-generic
% 0.15/0.42 % CPULimit : 300
% 0.15/0.42 % WCLimit : 300
% 0.15/0.42 % DateTime : Thu Sep 24 17:42:26 UTC 2026
% 0.15/0.42 % CPUTime :
% 0.15/0.42 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/0.48 Running first-order theorem proving
% 0.15/0.48 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.15/0.49
% 0.15/0.49 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.49
% 0.15/0.49 % Detected problem language: tptp
% 0.23/0.51 % Proving...
% 2.80/1.38 % SZS status Started for theBenchmark.p
% 2.80/1.38 % SZS status Theorem for theBenchmark.p
% 2.80/1.38
% 2.80/1.38 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.80/1.38
% 2.80/1.38 % ------ iProver source info
% 2.80/1.38
% 2.80/1.38 % git: date: 2026-07-19 20:42:38 +0200
% 2.80/1.38 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.80/1.38 % git: non_committed_changes: false
% 2.80/1.38
% 2.80/1.38 % ------ Parsing...
% 2.80/1.38 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.80/1.38
% 2.80/1.38 % ------ 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: 4 0s sf_e pe_s pe_e %
% 2.80/1.38
% 2.80/1.38 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.80/1.38
% 2.80/1.38 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 2.80/1.38 % ------ Proving...
% 2.80/1.38 % ------ Problem Properties
% 2.80/1.38
% 2.80/1.38 %
% 2.80/1.38 % clauses 183
% 2.80/1.38 % conjectures 50
% 2.80/1.38 % EPR 52
% 2.80/1.38 % Horn 115
% 2.80/1.38 % unary 19
% 2.80/1.38 % binary 40
% 2.80/1.38 % lits 621
% 2.80/1.38 % lits eq 79
% 2.80/1.38 % fd_pure 0
% 2.80/1.38 % fd_pseudo 0
% 2.80/1.38 % fd_cond 21
% 2.80/1.38 % fd_pseudo_cond 14
% 2.80/1.38 % AC symbols 0
% 2.80/1.38
% 2.80/1.38 % ------ Schedule dynamic 5 is on
% 2.80/1.38
% 2.80/1.38 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.80/1.38
% 2.80/1.38
% 2.80/1.38 % ------
% 2.80/1.38 % Current options:
% 2.80/1.38 % ------
% 2.80/1.38
% 2.80/1.38
% 2.80/1.38 %
% 2.80/1.38
% 2.80/1.38 % ------ Proving...
% 2.80/1.38 %
% 2.80/1.38
% 2.80/1.38 % SZS status Theorem for theBenchmark.p
% 2.80/1.38
% 2.80/1.38 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.80/1.38
% 2.80/1.38
%------------------------------------------------------------------------------