%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC051+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 : n002.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:41 PM UTC 2026
% Result : Theorem 3.77s 1.51s
% Output : CNFRefutation 3.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 2
% Syntax : Number of formulae : 32 ( 14 unt; 0 def)
% Number of atoms : 130 ( 24 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 159 ( 61 ~; 49 |; 40 &)
% ( 0 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 29 ( 0 sgn 19 !; 10 ?; 3 :)
% Comments :
%------------------------------------------------------------------------------
fof(f49,axiom,
! [X0] :
( ssList(X0)
=> rearsegP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax49) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( ~ rearsegP(X3,X2)
| ~ neq(X2,nil) )
& neq(X3,nil) )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( rearsegP(X0,X4)
& rearsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/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) )
& neq(X3,nil) )
| ( nil = X3
& nil != X2 )
| ? [X4] :
( rearsegP(X0,X4)
& rearsegP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| ~ neq(X1,nil)
| 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)
& ( ( rearsegP(X3,X2)
& neq(X2,nil) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& 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) )
| ~ neq(X3,nil) )
& ( nil != X3
| nil = X2 )
& ! [X4] :
( ~ rearsegP(X0,X4)
| ~ rearsegP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ( ( rearsegP(sK56,sK55)
& neq(sK55,nil) )
| ~ neq(sK56,nil) )
& ( nil != sK56
| nil = sK55 )
& ! [X4] :
( ~ rearsegP(sK53,X4)
| ~ rearsegP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& neq(sK54,nil)
& 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(f500,plain,
( rearsegP(sK56,sK55)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
( neq(sK55,nil)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
! [X4] :
( ~ rearsegP(sK53,X4)
| ~ rearsegP(sK54,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
neq(sK54,nil),
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,
neq(sK56,nil),
inference(definition_unfolding,[],[f504,f506]) ).
fof(f508,plain,
! [X4] :
( ~ rearsegP(sK55,X4)
| ~ rearsegP(sK56,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f503,f506,f505]) ).
fof(f510,plain,
ssList(sK55),
inference(definition_unfolding,[],[f496,f505]) ).
tcf(c_185,plain,
! [X0: $i] :
( rearsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f433]) ).
tcf(c_246,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f507]) ).
tcf(c_247,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ rearsegP(sK55,X0)
| ~ rearsegP(sK56,X0)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f508]) ).
tcf(c_249,negated_conjecture,
( neq(sK55,nil)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f501]) ).
tcf(c_250,negated_conjecture,
( rearsegP(sK56,sK55)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f500]) ).
tcf(c_254,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f510]) ).
tcf(c_369,negated_conjecture,
neq(sK55,nil),
inference(global_subsumption_just,[status(thm)],[c_249,c_246,c_249]) ).
tcf(c_3278,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ rearsegP(sK55,X0)
| ~ rearsegP(sK56,X0)
| ( nil != nil )
| ( X0 != sK55 ) ),
inference(resolution_lifted,[status(thm)],[c_247,c_369]) ).
tcf(c_3279,plain,
( ~ ssList(sK55)
| ~ rearsegP(sK55,sK55)
| ~ rearsegP(sK56,sK55) ),
inference(unflattening,[status(thm)],[c_3278]) ).
tcf(c_3280,plain,
~ rearsegP(sK55,sK55),
inference(global_subsumption_just,[status(thm)],[c_3279,c_254,c_246,c_250,c_3279]) ).
tcf(c_8901,plain,
~ rearsegP(sK55,sK55),
inference(demodulation,[status(thm)],[c_3280]) ).
tcf(c_8907,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_254]) ).
tcf(c_11829,plain,
~ ssList(sK55),
inference(superposition,[status(thm)],[c_185,c_8901]) ).
tcf(c_11830,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_11829,c_8907]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC051+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.11/0.58 % Computer : n002.cluster.edu
% 0.11/0.58 % Model : x86_64 x86_64
% 0.11/0.58 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.58 % Memory : 8046.5625MB
% 0.11/0.58 % OS : Linux 6.8.0-71-generic
% 0.11/0.58 % CPULimit : 300
% 0.11/0.58 % WCLimit : 300
% 0.11/0.58 % DateTime : Thu Sep 24 16:09:36 UTC 2026
% 0.11/0.59 % CPUTime :
% 0.11/0.59 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.63 Running first-order theorem proving
% 0.11/0.63 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.15/0.64
% 0.15/0.64 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.64
% 0.15/0.64 % Detected problem language: tptp
% 0.15/0.65 % Proving...
% 3.77/1.51 % SZS status Started for theBenchmark.p
% 3.77/1.51 % SZS status Theorem for theBenchmark.p
% 3.77/1.51
% 3.77/1.51 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.77/1.51
% 3.77/1.51 % ------ iProver source info
% 3.77/1.51
% 3.77/1.51 % git: date: 2026-07-19 20:42:38 +0200
% 3.77/1.51 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.77/1.51 % git: non_committed_changes: false
% 3.77/1.51
% 3.77/1.51 % ------ Parsing...
% 3.77/1.51 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.77/1.51
% 3.77/1.51 % ------ 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.77/1.51
% 3.77/1.51 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.77/1.51
% 3.77/1.51 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.77/1.51 % ------ Proving...
% 3.77/1.51 % ------ Problem Properties
% 3.77/1.51
% 3.77/1.51 %
% 3.77/1.51 % clauses 188
% 3.77/1.51 % conjectures 3
% 3.77/1.51 % EPR 57
% 3.77/1.51 % Horn 120
% 3.77/1.51 % unary 22
% 3.77/1.51 % binary 41
% 3.77/1.51 % lits 630
% 3.77/1.51 % lits eq 81
% 3.77/1.51 % fd_pure 0
% 3.77/1.51 % fd_pseudo 0
% 3.77/1.51 % fd_cond 22
% 3.77/1.51 % fd_pseudo_cond 14
% 3.77/1.51 % AC symbols 0
% 3.77/1.51
% 3.77/1.51 % ------ Schedule dynamic 5 is on
% 3.77/1.51
% 3.77/1.51 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.77/1.51
% 3.77/1.51
% 3.77/1.51 % ------
% 3.77/1.51 % Current options:
% 3.77/1.51 % ------
% 3.77/1.51
% 3.77/1.51
% 3.77/1.51 %
% 3.77/1.51
% 3.77/1.51 % ------ Proving...
% 3.77/1.51 %
% 3.77/1.51
% 3.77/1.51 % SZS status Theorem for theBenchmark.p
% 3.77/1.51
% 3.77/1.51 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.77/1.51
% 3.77/1.51
%------------------------------------------------------------------------------