%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC229-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 : n020.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:08:57 PM UTC 2026
% Result : Unsatisfiable 19.23s 3.67s
% Output : CNFRefutation 19.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 26
% Syntax : Number of formulae : 110 ( 24 unt; 0 def)
% Number of atoms : 339 ( 75 equ)
% Maximal formula atoms : 7 ( 3 avg)
% Number of connectives : 445 ( 216 ~; 229 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 158 ( 0 sgn 158 !; 0 ?; 106 :)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f9,axiom,
ssItem(skac3),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause9) ).
fof(f71,axiom,
! [X0] :
( ~ ssItem(X0)
| ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause71) ).
fof(f72,axiom,
! [X0,X1] :
( ssItem(X1)
| duplicatefreeP(X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause72) ).
fof(f73,axiom,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause73) ).
fof(f74,axiom,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause74) ).
fof(f79,axiom,
! [X0] :
( segmentP(nil,X0)
| ~ ssList(X0)
| nil != X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause79) ).
fof(f80,axiom,
! [X0] :
( nil = X0
| ~ ssList(X0)
| ~ segmentP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause80) ).
fof(f83,axiom,
! [X0] :
( frontsegP(nil,X0)
| ~ ssList(X0)
| nil != X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause83) ).
fof(f84,axiom,
! [X0] :
( nil = X0
| ~ ssList(X0)
| ~ frontsegP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause84) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
fof(f86,axiom,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
fof(f101,axiom,
! [X0,X1] :
( X1 = X0
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
fof(f102,plain,
! [X0,X1] :
( X0 = X1
| neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(reorient_equations,[],[f101]) ).
fof(f103,axiom,
! [X0] :
( cons(skaf44(X0),nil) = X0
| ~ ssList(X0)
| ~ singletonP(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).
fof(f104,axiom,
! [X0,X1] :
( X1 = X0
| neq(X1,X0)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause102) ).
fof(f105,plain,
! [X0,X1] :
( X0 = X1
| neq(X1,X0)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f104]) ).
fof(f164,axiom,
! [X2,X0,X1] :
( segmentP(X0,X2)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ segmentP(X1,X2)
| ~ segmentP(X0,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause152) ).
fof(f193,axiom,
! [X2,X3,X0,X1,X4] :
( ~ ssList(X4)
| ~ duplicatefreeP(X4)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X0,cons(X1,X2)),cons(X1,X3)) != X4 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause179) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f210,negated_conjecture,
! [X2,X0,X1] :
( memberP(X1,sk5(X2,X1,X0))
| app(app(X1,cons(X0,nil)),X2) != sk1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f211,plain,
! [X2,X0,X1] :
( memberP(X1,sk5(X2,X1,X0))
| sk1 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f210]) ).
fof(f212,negated_conjecture,
! [X2,X0,X1] :
( memberP(X2,sk5(X2,X1,X0))
| app(app(X1,cons(X0,nil)),X2) != sk1
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f213,plain,
! [X2,X0,X1] :
( memberP(X2,sk5(X2,X1,X0))
| sk1 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f212]) ).
fof(f218,negated_conjecture,
( ~ neq(sk4,nil)
| singletonP(sk3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f221,plain,
nil != sk3,
inference(definition_unfolding,[],[f207,f205]) ).
fof(f223,plain,
! [X2,X0,X1] :
( memberP(X1,sk5(X2,X1,X0))
| sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(definition_unfolding,[],[f211,f205]) ).
fof(f224,plain,
! [X2,X0,X1] :
( memberP(X2,sk5(X2,X1,X0))
| sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(definition_unfolding,[],[f213,f205]) ).
fof(f227,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f79]) ).
fof(f229,plain,
( frontsegP(nil,nil)
| ~ ssList(nil) ),
inference(equality_resolution,[],[f83]) ).
fof(f244,plain,
! [X2,X3,X0,X1] :
( ~ ssList(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ duplicatefreeP(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| ~ ssList(X3) ),
inference(equality_resolution,[],[f193]) ).
tcf(c_255,plain,
ssList(nil),
inference(cnf_transformation,[],[f8]) ).
tcf(c_256,plain,
ssItem(skac3),
inference(cnf_transformation,[],[f9]) ).
tcf(c_318,negated_conjecture,
! [X0: $i] :
( ~ ssItem(X0)
| ~ memberP(nil,X0) ),
inference(cnf_transformation,[],[f71]) ).
tcf(c_319,plain,
! [X0: $i,X1: $i] :
( duplicatefreeP(X0)
| ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f72]) ).
tcf(c_320,plain,
! [X0: $i] :
( ( app(X0,nil) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f73]) ).
tcf(c_321,plain,
! [X0: $i] :
( ( app(nil,X0) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f74]) ).
tcf(c_326,plain,
( segmentP(nil,nil)
| ~ ssList(nil) ),
inference(cnf_transformation,[],[f227]) ).
tcf(c_327,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(X0)
| ~ segmentP(nil,X0) ),
inference(cnf_transformation,[],[f80]) ).
tcf(c_330,plain,
( frontsegP(nil,nil)
| ~ ssList(nil) ),
inference(cnf_transformation,[],[f229]) ).
tcf(c_331,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(X0)
| ~ frontsegP(nil,X0) ),
inference(cnf_transformation,[],[f84]) ).
tcf(c_332,plain,
! [X0: $i,X1: $i] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f85]) ).
tcf(c_333,plain,
! [X0: $i,X1: $i] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f86]) ).
tcf(c_347,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f102]) ).
tcf(c_348,plain,
! [X0: $i] :
( ( cons(skaf44(X0),nil) = X0 )
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f103]) ).
tcf(c_349,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f105]) ).
tcf(c_399,plain,
! [X0: $i,X1: $i,X2: $i] :
( segmentP(X0,X2)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ segmentP(X1,X2)
| ~ segmentP(X0,X1) ),
inference(cnf_transformation,[],[f164]) ).
tcf(c_426,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ duplicatefreeP(app(app(X0,cons(X1,X2)),cons(X1,X3)))
| ~ ssList(app(app(X0,cons(X1,X2)),cons(X1,X3))) ),
inference(cnf_transformation,[],[f244]) ).
tcf(c_435,negated_conjecture,
ssList(sk3),
inference(cnf_transformation,[],[f202]) ).
tcf(c_436,negated_conjecture,
ssList(sk4),
inference(cnf_transformation,[],[f203]) ).
tcf(c_437,negated_conjecture,
segmentP(sk4,sk3),
inference(cnf_transformation,[],[f206]) ).
tcf(c_438,negated_conjecture,
sk3 != nil,
inference(cnf_transformation,[],[f221]) ).
tcf(c_440,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( memberP(X0,sk5(X2,X0,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ( app(app(X0,cons(X1,nil)),X2) != sk3 ) ),
inference(cnf_transformation,[],[f223]) ).
tcf(c_441,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( memberP(X2,sk5(X2,X0,X1))
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ( app(app(X0,cons(X1,nil)),X2) != sk3 ) ),
inference(cnf_transformation,[],[f224]) ).
tcf(c_444,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
inference(cnf_transformation,[],[f218]) ).
tcf(c_505,plain,
( ( nil = nil )
| ~ ssList(nil)
| ~ frontsegP(nil,nil) ),
inference(instantiation,[status(thm)],[c_331]) ).
tcf(c_710,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( segmentP(X0,X2)
| ~ segmentP(X1,X3)
| ( X2 != X3 )
| ( X0 != X1 ) ),
theory(equality) ).
tcf(c_1085,plain,
app(sk3,nil) = sk3,
inference(superposition,[status(thm)],[c_435,c_320]) ).
tcf(c_1759,plain,
( singletonP(sk3)
| ( sk4 = nil )
| ~ ssList(nil)
| ~ ssList(sk4) ),
inference(superposition,[status(thm)],[c_347,c_444]) ).
tcf(c_2270,plain,
( singletonP(sk3)
| ( sk4 = nil )
| ~ ssList(nil)
| ~ ssList(sk4) ),
inference(superposition,[status(thm)],[c_347,c_444]) ).
tcf(c_2367,plain,
( ( sk3 = nil )
| ~ ssList(sk3)
| ~ segmentP(nil,sk3) ),
inference(instantiation,[status(thm)],[c_327]) ).
tcf(c_2561,plain,
( singletonP(sk3)
| ( sk4 = nil ) ),
inference(global_subsumption_just,[status(thm)],[c_2270,c_436,c_255,c_1759]) ).
tcf(c_2563,plain,
( ( sk4 = nil )
| ( cons(skaf44(sk3),nil) = sk3 )
| ~ ssList(sk3) ),
inference(superposition,[status(thm)],[c_2561,c_348]) ).
tcf(c_3394,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ssItem(X4)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(app(app(X0,cons(X1,X2)),cons(X1,X3))) ),
inference(resolution,[status(thm)],[c_426,c_319]) ).
tcf(c_3514,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ssItem(X4)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(cons(X1,X3))
| ~ ssList(app(X0,cons(X1,X2))) ),
inference(resolution,[status(thm)],[c_3394,c_332]) ).
tcf(c_3533,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ssItem(X4)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(app(X0,cons(X1,X2))) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3514,c_333]) ).
tcf(c_3552,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ssItem(X4)
| ~ ssItem(X0)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(cons(X0,X1)) ),
inference(resolution,[status(thm)],[c_3533,c_332]) ).
tcf(c_3559,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ssItem(X4)
| ~ ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3552,c_333]) ).
tcf(c_3582,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ssItem(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(resolution,[status(thm)],[c_3559,c_256]) ).
tcf(c_3872,plain,
! [X0: $i,X1: $i,X2: $i] :
( ssItem(X2)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(resolution,[status(thm)],[c_3582,c_435]) ).
tcf(c_3925,plain,
! [X0: $i,X1: $i,X2: $i] :
( memberP(X2,sk5(X2,X0,X1))
| ~ ssList(X2)
| ~ ssList(X0)
| ( app(app(X0,cons(X1,nil)),X2) != sk3 ) ),
inference(backward_subsumption_resolution,[status(thm)],[c_441,c_3872]) ).
tcf(c_3926,plain,
! [X0: $i,X1: $i,X2: $i] :
( memberP(X0,sk5(X2,X0,X1))
| ~ ssList(X2)
| ~ ssList(X0)
| ( app(app(X0,cons(X1,nil)),X2) != sk3 ) ),
inference(backward_subsumption_resolution,[status(thm)],[c_440,c_3872]) ).
tcf(c_3934,plain,
! [X0: $i,X1: $i] :
( ssItem(X1)
| ~ ssList(X0) ),
inference(resolution,[status(thm)],[c_3872,c_435]) ).
tcf(c_4006,plain,
! [X0: $i] : ssItem(X0),
inference(resolution,[status(thm)],[c_3934,c_435]) ).
tcf(c_4063,plain,
! [X0: $i,X1: $i] :
( neq(X0,X1)
| ( X1 = X0 )
| ~ ssItem(X0) ),
inference(backward_subsumption_resolution,[status(thm)],[c_349,c_4006]) ).
tcf(c_4380,plain,
! [X0: $i] :
( segmentP(nil,sk3)
| ~ ssList(nil)
| ~ ssList(sk3)
| ~ ssList(X0)
| ~ segmentP(nil,X0)
| ~ segmentP(X0,sk3) ),
inference(instantiation,[status(thm)],[c_399]) ).
tcf(c_4866,plain,
! [X0: $i,X1: $i] :
( neq(X0,X1)
| ( X1 = X0 ) ),
inference(global_subsumption_just,[status(thm)],[c_4063,c_4006,c_4063]) ).
tcf(c_4867,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 ) ),
inference(renaming,[status(thm)],[c_4866]) ).
tcf(c_8321,negated_conjecture,
! [X0: $i] : ~ memberP(nil,X0),
inference(global_subsumption_just,[status(thm)],[c_318,c_318,c_4006]) ).
tcf(c_8346,plain,
! [X0: $i,X1: $i,X2: $i] :
( memberP(X2,sk5(X2,X0,X1))
| ( app(app(X0,cons(X1,nil)),X2) != sk3 )
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(global_subsumption_just,[status(thm)],[c_441,c_3925]) ).
tcf(c_8347,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( memberP(X2,sk5(X2,X0,X1))
| ~ ssList(X2)
| ~ ssList(X0)
| ( app(app(X0,cons(X1,nil)),X2) != sk3 ) ),
inference(renaming,[status(thm)],[c_8346]) ).
tcf(c_8436,plain,
app(nil,sk3) = sk3,
inference(superposition,[status(thm)],[c_435,c_321]) ).
tcf(c_8661,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 ) ),
inference(global_subsumption_just,[status(thm)],[c_347,c_4867]) ).
tcf(c_8663,plain,
( singletonP(sk3)
| ( sk4 = nil ) ),
inference(superposition,[status(thm)],[c_8661,c_444]) ).
tcf(c_8676,plain,
( ( sk4 = nil )
| ( cons(skaf44(sk3),nil) = sk3 )
| ~ ssList(sk3) ),
inference(superposition,[status(thm)],[c_8663,c_348]) ).
tcf(c_8693,plain,
( ( sk4 = nil )
| ( cons(skaf44(sk3),nil) = sk3 ) ),
inference(global_subsumption_just,[status(thm)],[c_8676,c_435,c_2563]) ).
tcf(c_8707,plain,
! [X0: $i,X1: $i] :
( memberP(X1,sk5(X1,X0,skaf44(sk3)))
| ( sk4 = nil )
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(app(X0,sk3),X1) != sk3 ) ),
inference(superposition,[status(thm)],[c_8693,c_8347]) ).
tcf(c_8736,plain,
! [X0: $i] :
( memberP(X0,sk5(X0,nil,skaf44(sk3)))
| ( sk4 = nil )
| ~ ssList(nil)
| ~ ssList(X0)
| ( app(sk3,X0) != sk3 ) ),
inference(superposition,[status(thm)],[c_8436,c_8707]) ).
tcf(c_8737,plain,
( memberP(nil,sk5(nil,nil,skaf44(sk3)))
| ( sk4 = nil )
| ~ ssList(nil)
| ( app(sk3,nil) != sk3 ) ),
inference(instantiation,[status(thm)],[c_8736]) ).
tcf(c_12605,plain,
( segmentP(nil,sk3)
| ~ ssList(nil)
| ~ ssList(sk4)
| ~ ssList(sk3)
| ~ segmentP(nil,sk4)
| ~ segmentP(sk4,sk3) ),
inference(instantiation,[status(thm)],[c_4380]) ).
tcf(c_14665,plain,
! [X0: $i,X1: $i] :
( segmentP(nil,sk4)
| ~ segmentP(X1,X0)
| ( nil != X1 )
| ( sk4 != X0 ) ),
inference(instantiation,[status(thm)],[c_710]) ).
tcf(c_14666,plain,
( segmentP(nil,sk4)
| ~ segmentP(nil,nil)
| ( nil != nil )
| ( sk4 != nil ) ),
inference(instantiation,[status(thm)],[c_14665]) ).
tcf(c_15403,negated_conjecture,
singletonP(sk3),
inference(global_subsumption_just,[status(thm)],[c_444,c_436,c_435,c_255,c_437,c_438,c_330,c_326,c_505,c_2367,c_2561,c_12605,c_14666]) ).
tcf(c_15419,plain,
! [X0: $i,X1: $i,X2: $i] :
( memberP(X0,sk5(X2,X0,X1))
| ( app(app(X0,cons(X1,nil)),X2) != sk3 )
| ~ ssList(X0)
| ~ ssList(X2) ),
inference(global_subsumption_just,[status(thm)],[c_440,c_3926]) ).
tcf(c_15420,negated_conjecture,
! [X0: $i,X1: $i,X2: $i] :
( memberP(X0,sk5(X2,X0,X1))
| ~ ssList(X2)
| ~ ssList(X0)
| ( app(app(X0,cons(X1,nil)),X2) != sk3 ) ),
inference(renaming,[status(thm)],[c_15419]) ).
tcf(c_15439,plain,
( ( cons(skaf44(sk3),nil) = sk3 )
| ~ ssList(sk3) ),
inference(superposition,[status(thm)],[c_15403,c_348]) ).
tcf(c_15440,plain,
cons(skaf44(sk3),nil) = sk3,
inference(global_subsumption_just,[status(thm)],[c_15439,c_436,c_435,c_255,c_437,c_438,c_330,c_326,c_505,c_2367,c_2563,c_12605,c_14666]) ).
tcf(c_15447,plain,
! [X0: $i,X1: $i] :
( memberP(X0,sk5(X1,X0,skaf44(sk3)))
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(app(X0,sk3),X1) != sk3 ) ),
inference(superposition,[status(thm)],[c_15440,c_15420]) ).
tcf(c_15543,plain,
app(sk3,nil) = sk3,
inference(superposition,[status(thm)],[c_435,c_320]) ).
tcf(c_15573,plain,
app(nil,sk3) = sk3,
inference(superposition,[status(thm)],[c_435,c_321]) ).
tcf(c_15605,plain,
! [X0: $i] :
( memberP(nil,sk5(X0,nil,skaf44(sk3)))
| ~ ssList(nil)
| ~ ssList(X0)
| ( app(sk3,X0) != sk3 ) ),
inference(superposition,[status(thm)],[c_15573,c_15447]) ).
tcf(c_15617,plain,
! [X0: $i] :
( memberP(nil,sk5(X0,nil,skaf44(sk3)))
| ( app(sk3,X0) != sk3 )
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_15605,c_255,c_15605]) ).
tcf(c_15618,plain,
! [X0: $i] :
( memberP(nil,sk5(X0,nil,skaf44(sk3)))
| ~ ssList(X0)
| ( app(sk3,X0) != sk3 ) ),
inference(renaming,[status(thm)],[c_15617]) ).
tcf(c_15619,plain,
( memberP(nil,sk5(nil,nil,skaf44(sk3)))
| ~ ssList(nil) ),
inference(superposition,[status(thm)],[c_15543,c_15618]) ).
tcf(c_15687,plain,
memberP(nil,sk5(nil,nil,skaf44(sk3))),
inference(global_subsumption_just,[status(thm)],[c_15619,c_436,c_435,c_255,c_437,c_438,c_330,c_326,c_505,c_1085,c_2367,c_8737,c_12605,c_14666]) ).
tcf(c_15689,plain,
$false,
inference(superposition,[status(thm)],[c_15687,c_8321]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC229-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.09/0.37 % Computer : n020.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Thu Sep 24 17:07:34 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/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.09/0.42
% 0.09/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.42
% 0.09/0.42 % Detected problem language: tptp
% 0.09/0.43 % Proving...
% 19.23/3.67 % SZS status Started for theBenchmark.p
% 19.23/3.67 % SZS status Unsatisfiable for theBenchmark.p
% 19.23/3.67
% 19.23/3.67 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 19.23/3.67
% 19.23/3.67 % ------ iProver source info
% 19.23/3.67
% 19.23/3.67 % git: date: 2026-07-19 20:42:38 +0200
% 19.23/3.67 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 19.23/3.67 % git: non_committed_changes: false
% 19.23/3.67
% 19.23/3.67 % ------ Parsing...% successful
% 19.23/3.67
% 19.23/3.67
% 19.23/3.67 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 19.23/3.67
% 19.23/3.67 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e sup_sim: 0 sf_s rm: 1 0s sf_e %
% 19.23/3.67
% 19.23/3.67 % ------ Preprocessing...%
% 19.23/3.67
% 19.23/3.67 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 19.23/3.67 % ------ Proving...
% 19.23/3.67 % ------ Problem Properties
% 19.23/3.67
% 19.23/3.67 %
% 19.23/3.67 % clauses 189
% 19.23/3.67 % conjectures 22
% 19.23/3.67 % EPR 59
% 19.23/3.67 % Horn 159
% 19.23/3.67 % unary 62
% 19.23/3.67 % binary 22
% 19.23/3.67 % lits 582
% 19.23/3.67 % lits eq 77
% 19.23/3.67 % fd_pure 0
% 19.23/3.67 % fd_pseudo 0
% 19.23/3.67 % fd_cond 15
% 19.23/3.67 % fd_pseudo_cond 16
% 19.23/3.67 % AC symbols 0
% 19.23/3.67
% 19.23/3.67 % ------ Input Options Time Limit: Unbounded
% 19.23/3.67
% 19.23/3.67
% 19.23/3.67 % ------
% 19.23/3.67 % Current options:
% 19.23/3.67 % ------
% 19.23/3.67
% 19.23/3.67
% 19.23/3.67 %
% 19.23/3.67
% 19.23/3.67 % ------ Proving...
% 19.23/3.67 %
% 19.23/3.67
% 19.23/3.67 % SZS status Unsatisfiable for theBenchmark.p
% 19.23/3.67
% 19.23/3.67 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 19.23/3.67
% 19.23/3.67
%------------------------------------------------------------------------------