%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC047+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 : n009.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:40 PM UTC 2026
% Result : Theorem 1.45s 1.30s
% Output : CNFRefutation 3.65s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f550ERROR: Could not build tree for root c_11731ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f49,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax49) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X4] :
( rearsegP(X0,X4)
& rearsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| X3 != X2
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ? [X4] :
( rearsegP(X0,X4)
& rearsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| X3 != X2
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f163,plain,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& X2 = X3
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& X2 = X3
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ( ( ! [X4] :
( ~ rearsegP(sK53,X4)
| ~ rearsegP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& sK55 = sK56
& sK53 = sK55
& sK54 = sK56 ),
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(f433,plain,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,X0) ),
inference(cnf_transformation,[],[f163]) ).
fof(f496,plain,
ssList(sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
( neq(sK54,nil)
| nil != sK53 ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
( neq(sK54,nil)
| nil = sK54 ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
sK55 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
sK53 = sK56,
inference(definition_unfolding,[],[f505,f504]) ).
fof(f508,plain,
( neq(sK56,nil)
| nil = sK56 ),
inference(definition_unfolding,[],[f503,f506,f506]) ).
fof(f510,plain,
( neq(sK56,nil)
| nil != sK56 ),
inference(definition_unfolding,[],[f501,f507,f506]) ).
fof(f514,plain,
ssList(sK56),
inference(definition_unfolding,[],[f496,f507]) ).
tcf(c_185,plain,
! [X0: $i] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f433]) ).
tcf(c_246,negated_conjecture,
( neq(sK56,nil)
| ( nil = sK56 ) ),
inference(cnf_transformation,[],[f508]) ).
tcf(c_247,negated_conjecture,
! [X0: $i] :
( ( nil = sK56 )
| ~ ssList(X0)
| ~ rearsegP(sK56,X0)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f549]) ).
tcf(c_248,negated_conjecture,
( neq(sK56,nil)
| ( nil != sK56 ) ),
inference(cnf_transformation,[],[f510]) ).
tcf(c_249,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ rearsegP(sK56,X0)
| ~ neq(X0,nil)
| ( nil != sK56 ) ),
inference(cnf_transformation,[],[f550]) ).
tcf(c_253,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f514]) ).
tcf(c_368,negated_conjecture,
neq(sK56,nil),
inference(global_subsumption_just,[status(thm)],[c_246,c_246,c_248]) ).
tcf(c_370,negated_conjecture,
neq(sK56,nil),
inference(global_subsumption_just,[status(thm)],[c_248,c_368]) ).
tcf(c_378,plain,
! [X0: $i] :
( ~ neq(X0,nil)
| ~ rearsegP(sK56,X0)
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_247,c_247,c_249]) ).
tcf(c_379,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ rearsegP(sK56,X0)
| ~ neq(X0,nil) ),
inference(renaming,[status(thm)],[c_378]) ).
tcf(c_380,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ rearsegP(sK56,X0)
| ~ neq(X0,nil) ),
inference(global_subsumption_just,[status(thm)],[c_249,c_379]) ).
tcf(c_3243,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ rearsegP(sK56,X0)
| ( nil != nil )
| ( X0 != sK56 ) ),
inference(resolution_lifted,[status(thm)],[c_370,c_380]) ).
tcf(c_3244,plain,
( ~ ssList(sK56)
| ~ rearsegP(sK56,sK56) ),
inference(unflattening,[status(thm)],[c_3243]) ).
tcf(c_3245,plain,
~ rearsegP(sK56,sK56),
inference(global_subsumption_just,[status(thm)],[c_3244,c_253,c_3244]) ).
tcf(c_8844,plain,
~ rearsegP(sK56,sK56),
inference(demodulation,[status(thm)],[c_3245]) ).
tcf(c_8847,negated_conjecture,
ssList(sK56),
inference(demodulation,[status(thm)],[c_253]) ).
tcf(c_11730,plain,
~ ssList(sK56),
inference(superposition,[status(thm)],[c_185,c_8844]) ).
tcf(c_11731,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11730,c_8847]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC047+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Thu Sep 24 16:05:44 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 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.42
% 0.10/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.42
% 0.10/0.42 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 1.45/1.30 % SZS status Started for theBenchmark.p
% 1.45/1.30 % SZS status Theorem for theBenchmark.p
% 1.45/1.30
% 1.45/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.45/1.30
% 1.45/1.30 % ------ iProver source info
% 1.45/1.30
% 1.45/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 1.45/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.45/1.30 % git: non_committed_changes: false
% 1.45/1.30
% 1.45/1.30 % ------ Parsing...
% 1.45/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.45/1.30
% 1.45/1.30 % ------ 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 %
% 1.45/1.30
% 1.45/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.45/1.30
% 1.45/1.30 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 1.45/1.30 % ------ Proving...
% 1.45/1.30 % ------ Problem Properties
% 1.45/1.30
% 1.45/1.30 %
% 1.45/1.30 % clauses 184
% 1.45/1.30 % conjectures 1
% 1.45/1.30 % EPR 53
% 1.45/1.30 % Horn 116
% 1.45/1.30 % unary 19
% 1.45/1.30 % binary 40
% 1.45/1.30 % lits 624
% 1.45/1.30 % lits eq 80
% 1.45/1.30 % fd_pure 0
% 1.45/1.30 % fd_pseudo 0
% 1.45/1.30 % fd_cond 22
% 1.45/1.30 % fd_pseudo_cond 14
% 1.45/1.30 % AC symbols 0
% 1.45/1.30
% 1.45/1.30 % ------ Schedule dynamic 5 is on
% 1.45/1.30
% 1.45/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 1.45/1.30
% 1.45/1.30
% 1.45/1.30 % ------
% 1.45/1.30 % Current options:
% 1.45/1.30 % ------
% 1.45/1.30
% 1.45/1.30
% 1.45/1.30 %
% 1.45/1.30
% 1.45/1.30 % ------ Proving...
% 1.45/1.30 %
% 1.45/1.30
% 1.45/1.30 % SZS status Theorem for theBenchmark.p
% 1.45/1.30
% 1.45/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.65/1.30
% 3.65/1.30
%------------------------------------------------------------------------------