%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC048+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 : n003.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 3.80s 1.28s
% Output : CNFRefutation 3.80s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f545ERROR: Could not build tree for root c_17199ERROR: MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f49,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax49) ).
fof(f52,axiom,
! [X0] :
( ssList(X0)
=> ( rearsegP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax52) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( ( ? [X4] :
( rearsegP(X0,X4)
& rearsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| 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)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& ( nil != X2
| nil != X3 ) )
| ( ( ? [X4] :
( rearsegP(X0,X4)
& rearsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f163,plain,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,X0) ),
inference(ennf_transformation,[],[f49]) ).
fof(f167,plain,
! [X0] :
( ~ ssList(X0)
| ( rearsegP(nil,X0)
<=> nil = X0 ) ),
inference(ennf_transformation,[],[f52]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ( nil = X2
& nil = X3 ) )
& ( ( ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f284,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ rearsegP(nil,X0)
| nil = X0 )
& ( nil != X0
| rearsegP(nil,X0) ) ) ),
inference(nnf_transformation,[],[f167]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ( ( rearsegP(sK56,sK55)
& neq(sK55,nil) )
| ( nil = sK55
& nil = sK56 ) )
& ( ( ! [X4] :
( ~ rearsegP(sK53,X4)
| ~ rearsegP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil) )
| ( nil != sK53
& nil = sK54 ) )
& 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(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f433,plain,
! [X0] :
( ~ ssList(X0)
| rearsegP(X0,X0) ),
inference(cnf_transformation,[],[f163]) ).
fof(f436,plain,
! [X0] :
( ~ ssList(X0)
| ~ rearsegP(nil,X0)
| nil = X0 ),
inference(cnf_transformation,[],[f284]) ).
fof(f496,plain,
ssList(sK53),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( rearsegP(sK56,sK55)
| nil = sK55 ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
( neq(sK55,nil)
| nil = sK55 ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
( rearsegP(sK56,sK55)
| nil = sK56 ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
( neq(sK55,nil)
| nil = sK56 ),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
( neq(sK54,nil)
| nil != sK53 ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
! [X4] :
( ~ rearsegP(sK53,X4)
| ~ rearsegP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK54 ),
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f511,plain,
! [X4] :
( ~ rearsegP(sK55,X4)
| ~ rearsegP(sK56,X4)
| ~ neq(X4,nil)
| ~ ssList(X4)
| nil = sK56 ),
inference(definition_unfolding,[],[f506,f509,f509,f508]) ).
fof(f512,plain,
( neq(sK56,nil)
| nil != sK55 ),
inference(definition_unfolding,[],[f505,f508,f509]) ).
fof(f515,plain,
ssList(sK55),
inference(definition_unfolding,[],[f496,f508]) ).
tcf(c_139,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ neq(X0,X0) ),
inference(cnf_transformation,[],[f545]) ).
tcf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f389]) ).
tcf(c_185,plain,
! [X0: $i] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f433]) ).
tcf(c_189,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(X0)
| ~ rearsegP(nil,X0) ),
inference(cnf_transformation,[],[f436]) ).
tcf(c_247,negated_conjecture,
! [X0: $i] :
( ( nil = sK56 )
| ~ ssList(X0)
| ~ rearsegP(sK55,X0)
| ~ rearsegP(sK56,X0)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f511]) ).
tcf(c_248,negated_conjecture,
( neq(sK56,nil)
| ( nil != sK55 ) ),
inference(cnf_transformation,[],[f512]) ).
tcf(c_250,negated_conjecture,
( neq(sK55,nil)
| ( nil = sK56 ) ),
inference(cnf_transformation,[],[f503]) ).
tcf(c_251,negated_conjecture,
( rearsegP(sK56,sK55)
| ( nil = sK56 ) ),
inference(cnf_transformation,[],[f502]) ).
tcf(c_252,negated_conjecture,
( neq(sK55,nil)
| ( nil = sK55 ) ),
inference(cnf_transformation,[],[f501]) ).
tcf(c_253,negated_conjecture,
( rearsegP(sK56,sK55)
| ( nil = sK55 ) ),
inference(cnf_transformation,[],[f500]) ).
tcf(c_257,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f515]) ).
tcf(c_4890,plain,
! [X0: $i] :
( ~ ssList(X0)
| ( nil != sK55 )
| ( X0 != sK56 )
| ( X0 != nil ) ),
inference(resolution_lifted,[status(thm)],[c_139,c_248]) ).
tcf(c_4891,plain,
( ~ ssList(nil)
| ( nil != sK55 )
| ( nil != sK56 ) ),
inference(unflattening,[status(thm)],[c_4890]) ).
tcf(c_4908,plain,
! [X0: $i] :
( ( nil = sK56 )
| ~ ssList(X0)
| ( X0 != sK55 )
| ( X0 != nil ) ),
inference(resolution_lifted,[status(thm)],[c_139,c_250]) ).
tcf(c_4909,plain,
( ( nil = sK56 )
| ~ ssList(nil)
| ( nil != sK55 ) ),
inference(unflattening,[status(thm)],[c_4908]) ).
tcf(c_4910,plain,
nil != sK55,
inference(global_subsumption_just,[status(thm)],[c_4909,c_141,c_4891,c_4909]) ).
tcf(c_4942,plain,
! [X0: $i] :
( ( nil = sK55 )
| ( nil = sK56 )
| ~ ssList(X0)
| ~ rearsegP(sK55,X0)
| ~ rearsegP(sK56,X0)
| ( nil != nil )
| ( X0 != sK55 ) ),
inference(resolution_lifted,[status(thm)],[c_247,c_252]) ).
tcf(c_4943,plain,
( ( nil = sK55 )
| ( nil = sK56 )
| ~ ssList(sK55)
| ~ rearsegP(sK55,sK55)
| ~ rearsegP(sK56,sK55) ),
inference(unflattening,[status(thm)],[c_4942]) ).
tcf(c_4944,plain,
( ~ rearsegP(sK55,sK55)
| ( nil = sK56 ) ),
inference(global_subsumption_just,[status(thm)],[c_4943,c_257,c_141,c_253,c_4891,c_4909,c_4943]) ).
tcf(c_4945,plain,
( ( nil = sK56 )
| ~ rearsegP(sK55,sK55) ),
inference(renaming,[status(thm)],[c_4944]) ).
tcf(c_4968,negated_conjecture,
rearsegP(sK56,sK55),
inference(global_subsumption_just,[status(thm)],[c_251,c_253,c_4910]) ).
tcf(c_13102,negated_conjecture,
rearsegP(sK56,sK55),
inference(demodulation,[status(thm)],[c_4968]) ).
tcf(c_13103,plain,
( ( nil = sK56 )
| ~ rearsegP(sK55,sK55) ),
inference(demodulation,[status(thm)],[c_4945]) ).
tcf(c_13105,plain,
nil != sK55,
inference(demodulation,[status(thm)],[c_4910]) ).
tcf(c_13107,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_257]) ).
tcf(c_16044,plain,
( ( nil = sK56 )
| ~ ssList(sK55) ),
inference(superposition,[status(thm)],[c_185,c_13103]) ).
tcf(c_16045,plain,
nil = sK56,
inference(forward_subsumption_resolution,[status(thm)],[c_16044,c_13107]) ).
tcf(c_16046,plain,
rearsegP(nil,sK55),
inference(demodulation,[status(thm)],[c_13102,c_16045]) ).
tcf(c_17198,plain,
( ( nil = sK55 )
| ~ ssList(sK55) ),
inference(superposition,[status(thm)],[c_16046,c_189]) ).
tcf(c_17199,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_17198,c_13105,c_13107]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC048+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.36 % Computer : n003.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 16:07:21 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.40 Running first-order theorem proving
% 0.09/0.40 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.09/0.41
% 0.09/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41
% 0.09/0.41 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 3.80/1.28 % SZS status Started for theBenchmark.p
% 3.80/1.28 % SZS status Theorem for theBenchmark.p
% 3.80/1.28
% 3.80/1.28 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.80/1.28
% 3.80/1.28 % ------ iProver source info
% 3.80/1.28
% 3.80/1.28 % git: date: 2026-07-19 20:42:38 +0200
% 3.80/1.28 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.80/1.28 % git: non_committed_changes: false
% 3.80/1.28
% 3.80/1.28 % ------ Parsing...
% 3.80/1.28 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.80/1.28
% 3.80/1.28 % ------ 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 sup_sim: 0 sf_s rm: 5 0s sf_e pe_s pe_e %
% 3.80/1.28
% 3.80/1.28 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.80/1.28
% 3.80/1.28 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.80/1.28 % ------ Proving...
% 3.80/1.28 % ------ Problem Properties
% 3.80/1.28
% 3.80/1.28 %
% 3.80/1.28 % clauses 187
% 3.80/1.28 % conjectures 3
% 3.80/1.28 % EPR 56
% 3.80/1.28 % Horn 118
% 3.80/1.28 % unary 20
% 3.80/1.28 % binary 41
% 3.80/1.28 % lits 632
% 3.80/1.28 % lits eq 83
% 3.80/1.28 % fd_pure 0
% 3.80/1.28 % fd_pseudo 0
% 3.80/1.28 % fd_cond 22
% 3.80/1.28 % fd_pseudo_cond 14
% 3.80/1.28 % AC symbols 0
% 3.80/1.28
% 3.80/1.28 % ------ Schedule dynamic 5 is on
% 3.80/1.28
% 3.80/1.28 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.80/1.28
% 3.80/1.28
% 3.80/1.28 % ------
% 3.80/1.28 % Current options:
% 3.80/1.28 % ------
% 3.80/1.28
% 3.80/1.28
% 3.80/1.28 %
% 3.80/1.28
% 3.80/1.28 % ------ Proving...
% 3.80/1.28 %
% 3.80/1.28
% 3.80/1.28 % SZS status Theorem for theBenchmark.p
% 3.80/1.28
% 3.80/1.28 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.80/1.28
% 3.80/1.28
%------------------------------------------------------------------------------