%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC367+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:09:29 PM UTC 2026
% Result : Theorem 2.54s 1.30s
% Output : CNFRefutation 2.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 3
% Syntax : Number of formulae : 32 ( 13 unt; 0 def)
% Number of atoms : 102 ( 37 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 98 ( 28 ~; 29 |; 30 &)
% ( 2 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 0 ( 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 : 20 ( 0 sgn 12 !; 8 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
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 ) )
| rearsegP(X1,X0)
| 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 ) )
| rearsegP(X1,X0)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
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 ) )
& ~ rearsegP(X1,X0)
& 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 ) )
& ~ rearsegP(X1,X0)
& 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 ) )
& ~ rearsegP(sK54,sK53)
& 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(f437,plain,
! [X0] :
( ~ ssList(X0)
| nil != X0
| rearsegP(nil,X0) ),
inference(cnf_transformation,[],[f284]) ).
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(f504,plain,
~ rearsegP(sK54,sK53),
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,
~ rearsegP(sK56,sK55),
inference(definition_unfolding,[],[f504,f506,f505]) ).
fof(f528,plain,
( ~ ssList(nil)
| rearsegP(nil,nil) ),
inference(equality_resolution,[],[f437]) ).
tcf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f389]) ).
tcf(c_188,plain,
( rearsegP(nil,nil)
| ~ ssList(nil) ),
inference(cnf_transformation,[],[f528]) ).
tcf(c_246,negated_conjecture,
~ rearsegP(sK56,sK55),
inference(cnf_transformation,[],[f507]) ).
tcf(c_247,negated_conjecture,
( neq(sK55,nil)
| ( nil = sK56 ) ),
inference(cnf_transformation,[],[f503]) ).
tcf(c_248,negated_conjecture,
( rearsegP(sK56,sK55)
| ( nil = sK56 ) ),
inference(cnf_transformation,[],[f502]) ).
tcf(c_249,negated_conjecture,
( neq(sK55,nil)
| ( nil = sK55 ) ),
inference(cnf_transformation,[],[f501]) ).
tcf(c_250,negated_conjecture,
( rearsegP(sK56,sK55)
| ( nil = sK55 ) ),
inference(cnf_transformation,[],[f500]) ).
tcf(c_363,plain,
rearsegP(nil,nil),
inference(global_subsumption_just,[status(thm)],[c_188,c_141,c_188]) ).
tcf(c_369,negated_conjecture,
nil = sK55,
inference(global_subsumption_just,[status(thm)],[c_249,c_246,c_250]) ).
tcf(c_373,negated_conjecture,
nil = sK56,
inference(global_subsumption_just,[status(thm)],[c_247,c_246,c_248]) ).
tcf(c_1701,plain,
~ rearsegP(nil,nil),
inference(light_normalisation,[status(thm)],[c_246,c_369,c_373]) ).
tcf(c_1702,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_1701,c_363]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC367+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.11/0.38 % Computer : n009.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Thu Sep 24 17:51:58 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/0.42 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.43
% 0.15/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.15/0.43
% 0.15/0.43 % Detected problem language: tptp
% 0.15/0.45 % Proving...
% 2.54/1.30 % SZS status Started for theBenchmark.p
% 2.54/1.30 % SZS status Theorem for theBenchmark.p
% 2.54/1.30
% 2.54/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.54/1.30
% 2.54/1.30 % ------ iProver source info
% 2.54/1.30
% 2.54/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 2.54/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.54/1.30 % git: non_committed_changes: false
% 2.54/1.30
% 2.54/1.30 % ------ Parsing...
% 2.54/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.54/1.30
% 2.54/1.30 % ------ Preprocessing...%
% 2.54/1.30
% 2.54/1.30 % SZS status Theorem for theBenchmark.p
% 2.54/1.30
% 2.54/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.54/1.30
% 2.54/1.30
%------------------------------------------------------------------------------