%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC004+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 : n004.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:28 PM UTC 2026
% Result : Theorem 3.57s 1.18s
% Output : CNFRefutation 3.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 6
% Syntax : Number of formulae : 74 ( 13 unt; 1 def)
% Number of atoms : 375 ( 113 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 479 ( 198 ~; 182 |; 77 &)
% ( 2 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 8 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 : 7 ( 5 usr; 1 prp; 0-4 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 214 ( 0 sgn 181 !; 33 ?; 75 :)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(X8,X9) != X2
| app(app(X8,cons(X7,nil)),X9) != X3 ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( neq(X5,nil)
& app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| ~ neq(X1,nil) ) )
| 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)
=> ( ( ( neq(X3,nil)
| ~ neq(X1,nil) )
& ( ! [X7] :
( ssItem(X7)
=> ! [X8] :
( ssList(X8)
=> ! [X9] :
( ssList(X9)
=> ( app(X8,X9) != X2
| app(app(X8,cons(X7,nil)),X9) != X3 ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( neq(X5,nil)
& app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| ~ neq(X1,nil) ) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& app(X8,X9) = X2
& app(app(X8,cons(X7,nil)),X9) = X3 ) ) )
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(X5,nil)
| app(X4,X6) != X0
| app(app(X4,X5),X6) != X1
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| ( ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& app(X8,X9) = X2
& app(app(X8,cons(X7,nil)),X9) = X3 ) ) )
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(X5,nil)
| app(X4,X6) != X0
| app(app(X4,X5),X6) != X1
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& neq(X1,nil) ) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f98]) ).
fof(f102,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| nil != cons(X1,X0) ) ),
inference(ennf_transformation,[],[f21]) ).
fof(f108,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| ssList(cons(X1,X0)) ) ),
inference(ennf_transformation,[],[f16]) ).
fof(f118,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f125,plain,
( ssList(sK4)
& ssList(sK5)
& ssList(sK6)
& ssList(sK7)
& ( ( ~ neq(sK7,nil)
& neq(sK5,nil) )
| sP0(sK5,sK4,sK7,sK6) )
& sK4 = sK6
& sK5 = sK7 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6),skolemize(X3,sK7)],[f121]) ).
fof(f130,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ neq(X0,X1)
| X0 != X1 )
& ( X0 = X1
| neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f118]) ).
fof(f143,plain,
( ~ neq(sK7,nil)
| sP0(sK5,sK4,sK7,sK6) ),
inference(cnf_transformation,[],[f125]) ).
fof(f144,plain,
( neq(sK5,nil)
| sP0(sK5,sK4,sK7,sK6) ),
inference(cnf_transformation,[],[f125]) ).
fof(f145,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f125]) ).
fof(f146,plain,
sK5 = sK7,
inference(cnf_transformation,[],[f125]) ).
fof(f152,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| nil != cons(X1,X0) ),
inference(cnf_transformation,[],[f102]) ).
fof(f159,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| ssList(cons(X1,X0)) ),
inference(cnf_transformation,[],[f108]) ).
fof(f170,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f130]) ).
fof(f173,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f174,plain,
( neq(sK7,nil)
| sP0(sK7,sK6,sK7,sK6) ),
inference(definition_unfolding,[],[f144,f146,f145,f146]) ).
fof(f175,plain,
( ~ neq(sK7,nil)
| sP0(sK7,sK6,sK7,sK6) ),
inference(definition_unfolding,[],[f143,f146,f145]) ).
tcf(c_56,negated_conjecture,
( neq(sK7,nil)
| sP0(sK7,sK6,sK7,sK6) ),
inference(cnf_transformation,[],[f174]) ).
tcf(c_57,negated_conjecture,
( sP0(sK7,sK6,sK7,sK6)
| ~ neq(sK7,nil) ),
inference(cnf_transformation,[],[f175]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != nil ) ),
inference(cnf_transformation,[],[f152]) ).
tcf(c_74,plain,
! [X0: $i,X1: $i] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f159]) ).
tcf(c_84,plain,
! [X0: $i,X1: $i] :
( neq(X0,X1)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f170]) ).
tcf(c_88,plain,
ssList(nil),
inference(cnf_transformation,[],[f173]) ).
tcf(c_112,negated_conjecture,
sP0(sK7,sK6,sK7,sK6),
inference(global_subsumption_just,[status(thm)],[c_56,c_56,c_57]) ).
tcf(c_114,negated_conjecture,
sP0(sK7,sK6,sK7,sK6),
inference(global_subsumption_just,[status(thm)],[c_57,c_112]) ).
tcf(c_1815,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ ssItem(sK1(sK7,sK6))
| ( cons(sK1(sK7,sK6),X0) != nil ) ),
inference(instantiation,[status(thm)],[c_67]) ).
tcf(c_1816,plain,
( ~ ssList(nil)
| ~ ssItem(sK1(sK7,sK6))
| ( cons(sK1(sK7,sK6),nil) != nil ) ),
inference(instantiation,[status(thm)],[c_1815]) ).
tcf(c_1823,plain,
! [X0: $i] :
( ssList(cons(sK1(sK7,sK6),X0))
| ~ ssList(X0)
| ~ ssItem(sK1(sK7,sK6)) ),
inference(instantiation,[status(thm)],[c_74]) ).
tcf(c_1824,plain,
( ssList(cons(sK1(sK7,sK6),nil))
| ~ ssList(nil)
| ~ ssItem(sK1(sK7,sK6)) ),
inference(instantiation,[status(thm)],[c_1823]) ).
fof(f120,definition,
! [X1,X0,X3,X2] :
( ~ sP0(X1,X0,X3,X2)
| ( ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& app(X8,X9) = X2
& app(app(X8,cons(X7,nil)),X9) = X3 ) ) )
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(X5,nil)
| app(X4,X6) != X0
| app(app(X4,X5),X6) != X1
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& neq(X1,nil) ) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f121,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( ~ neq(X3,nil)
& neq(X1,nil) )
| sP0(X1,X0,X3,X2) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(definition_folding,[],[f99,f120]) ).
fof(f122,plain,
! [X1,X0,X3,X2] :
( ~ sP0(X1,X0,X3,X2)
| ( ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& app(X8,X9) = X2
& app(app(X8,cons(X7,nil)),X9) = X3 ) ) )
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(X5,nil)
| app(X4,X6) != X0
| app(app(X4,X5),X6) != X1
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& neq(X1,nil) ) ),
inference(nnf_transformation,[],[f120]) ).
fof(f123,plain,
! [X0,X1,X2,X3] :
( ~ sP0(X0,X1,X2,X3)
| ( ? [X7] :
( ssItem(X7)
& ? [X8] :
( ssList(X8)
& ? [X9] :
( ssList(X9)
& app(X8,X9) = X3
& app(app(X8,cons(X7,nil)),X9) = X2 ) ) )
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(X5,nil)
| app(X4,X6) != X1
| app(app(X4,X5),X6) != X0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& neq(X0,nil) ) ),
inference(rectify,[],[f122]) ).
fof(f124,plain,
! [X0,X1,X2,X3] :
( ~ sP0(X0,X1,X2,X3)
| ( ssItem(sK1(X2,X3))
& ssList(sK2(X2,X3))
& ssList(sK3(X2,X3))
& app(sK2(X2,X3),sK3(X2,X3)) = X3
& app(app(sK2(X2,X3),cons(sK1(X2,X3),nil)),sK3(X2,X3)) = X2
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ~ neq(X5,nil)
| app(X4,X6) != X1
| app(app(X4,X5),X6) != X0
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssList(X4) )
& neq(X0,nil) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X7,sK1(X2,X3)),skolemize(X8,sK2(X2,X3)),skolemize(X9,sK3(X2,X3))],[f123]) ).
fof(f132,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ssItem(sK1(X2,X3)) ),
inference(cnf_transformation,[],[f124]) ).
fof(f133,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ssList(sK2(X2,X3)) ),
inference(cnf_transformation,[],[f124]) ).
fof(f134,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| ssList(sK3(X2,X3)) ),
inference(cnf_transformation,[],[f124]) ).
fof(f135,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| app(sK2(X2,X3),sK3(X2,X3)) = X3 ),
inference(cnf_transformation,[],[f124]) ).
fof(f136,plain,
! [X2,X3,X0,X1] :
( ~ sP0(X0,X1,X2,X3)
| app(app(sK2(X2,X3),cons(sK1(X2,X3),nil)),sK3(X2,X3)) = X2 ),
inference(cnf_transformation,[],[f124]) ).
fof(f137,plain,
! [X2,X3,X0,X1,X6,X4,X5] :
( ~ sP0(X0,X1,X2,X3)
| ~ neq(X5,nil)
| app(X4,X6) != X1
| app(app(X4,X5),X6) != X0
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f124]) ).
fof(f178,plain,
! [X2,X3,X1,X6,X4,X5] :
( ~ sP0(app(app(X4,X5),X6),X1,X2,X3)
| ~ neq(X5,nil)
| app(X4,X6) != X1
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(equality_resolution,[],[f137]) ).
fof(f179,plain,
! [X2,X3,X6,X4,X5] :
( ~ sP0(app(app(X4,X5),X6),app(X4,X6),X2,X3)
| ~ neq(X5,nil)
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssList(X4) ),
inference(equality_resolution,[],[f178]) ).
tcf(c_50,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ neq(X1,nil)
| ~ sP0(app(app(X0,X1),X2),app(X0,X2),X3,X4) ),
inference(cnf_transformation,[],[f179]) ).
tcf(c_51,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( app(app(sK2(X2,X3),cons(sK1(X2,X3),nil)),sK3(X2,X3)) = X2 )
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f136]) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( app(sK2(X2,X3),sK3(X2,X3)) = X3 )
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f135]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ssList(sK3(X2,X3))
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f134]) ).
tcf(c_54,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ssList(sK2(X2,X3))
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f133]) ).
tcf(c_55,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ssItem(sK1(X2,X3))
| ~ sP0(X0,X1,X2,X3) ),
inference(cnf_transformation,[],[f132]) ).
tcf(c_521,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ssItem(sK1(X2,X3))
| ( X3 != sK6 )
| ( X2 != sK7 )
| ( X1 != sK6 )
| ( X0 != sK7 ) ),
inference(resolution_lifted,[status(thm)],[c_55,c_114]) ).
tcf(c_522,plain,
ssItem(sK1(sK7,sK6)),
inference(unflattening,[status(thm)],[c_521]) ).
tcf(c_526,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ssList(sK2(X2,X3))
| ( X3 != sK6 )
| ( X2 != sK7 )
| ( X1 != sK6 )
| ( X0 != sK7 ) ),
inference(resolution_lifted,[status(thm)],[c_54,c_114]) ).
tcf(c_527,plain,
ssList(sK2(sK7,sK6)),
inference(unflattening,[status(thm)],[c_526]) ).
tcf(c_531,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ssList(sK3(X2,X3))
| ( X3 != sK6 )
| ( X2 != sK7 )
| ( X1 != sK6 )
| ( X0 != sK7 ) ),
inference(resolution_lifted,[status(thm)],[c_53,c_114]) ).
tcf(c_532,plain,
ssList(sK3(sK7,sK6)),
inference(unflattening,[status(thm)],[c_531]) ).
tcf(c_536,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( app(sK2(X2,X3),sK3(X2,X3)) = X3 )
| ( X3 != sK6 )
| ( X2 != sK7 )
| ( X1 != sK6 )
| ( X0 != sK7 ) ),
inference(resolution_lifted,[status(thm)],[c_52,c_114]) ).
tcf(c_537,plain,
app(sK2(sK7,sK6),sK3(sK7,sK6)) = sK6,
inference(unflattening,[status(thm)],[c_536]) ).
tcf(c_541,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( app(app(sK2(X2,X3),cons(sK1(X2,X3),nil)),sK3(X2,X3)) = X2 )
| ( X3 != sK6 )
| ( X2 != sK7 )
| ( X1 != sK6 )
| ( X0 != sK7 ) ),
inference(resolution_lifted,[status(thm)],[c_51,c_114]) ).
tcf(c_542,plain,
app(app(sK2(sK7,sK6),cons(sK1(sK7,sK6),nil)),sK3(sK7,sK6)) = sK7,
inference(unflattening,[status(thm)],[c_541]) ).
tcf(c_551,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ neq(X1,nil)
| ( X4 != sK6 )
| ( X3 != sK7 )
| ( app(X0,X2) != sK6 )
| ( app(app(X0,X1),X2) != sK7 ) ),
inference(resolution_lifted,[status(thm)],[c_50,c_114]) ).
tcf(c_552,plain,
! [X0: $i,X1: $i,X2: $i] :
( ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ neq(X1,nil)
| ( app(X0,X2) != sK6 )
| ( app(app(X0,X1),X2) != sK7 ) ),
inference(unflattening,[status(thm)],[c_551]) ).
tcf(c_628,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i,X4: $i] :
( ( X3 = X4 )
| ~ ssList(X4)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ( X4 != nil )
| ( X1 != X3 )
| ( app(X0,X2) != sK6 )
| ( app(app(X0,X1),X2) != sK7 ) ),
inference(resolution_lifted,[status(thm)],[c_552,c_84]) ).
tcf(c_629,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = nil )
| ~ ssList(nil)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X2) != sK6 )
| ( app(app(X0,X1),X2) != sK7 ) ),
inference(unflattening,[status(thm)],[c_628]) ).
tcf(c_631,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = nil )
| ( app(app(X0,X1),X2) != sK7 )
| ( app(X0,X2) != sK6 )
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(global_subsumption_just,[status(thm)],[c_629,c_88,c_629]) ).
tcf(c_632,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = nil )
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ( app(X0,X2) != sK6 )
| ( app(app(X0,X1),X2) != sK7 ) ),
inference(renaming,[status(thm)],[c_631]) ).
tcf(c_1540,plain,
( ( cons(sK1(sK7,sK6),nil) = nil )
| ~ ssList(sK3(sK7,sK6))
| ~ ssList(sK2(sK7,sK6))
| ~ ssList(cons(sK1(sK7,sK6),nil))
| ( app(sK2(sK7,sK6),sK3(sK7,sK6)) != sK6 ) ),
inference(superposition,[status(thm)],[c_542,c_632]) ).
tcf(c_1572,plain,
( ( cons(sK1(sK7,sK6),nil) = nil )
| ~ ssList(sK3(sK7,sK6))
| ~ ssList(sK2(sK7,sK6))
| ~ ssList(cons(sK1(sK7,sK6),nil)) ),
inference(ground_joinability,[status(thm)],[c_1540,c_537]) ).
tcf(c_1573,plain,
( ( cons(sK1(sK7,sK6),nil) = nil )
| ~ ssList(cons(sK1(sK7,sK6),nil)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1572,c_532,c_527]) ).
tcf(c_1825,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_1824,c_1816,c_1573,c_522,c_88]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC004+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.10/0.36 % Computer : n004.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Thu Sep 24 15:51:39 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.12/0.40 Running first-order theorem proving
% 0.12/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.12/0.41
% 0.12/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.12/0.41
% 0.12/0.41 % Detected problem language: tptp
% 0.12/0.42 % Proving...
% 3.57/1.18 % SZS status Started for theBenchmark.p
% 3.57/1.18 % SZS status Theorem for theBenchmark.p
% 3.57/1.18
% 3.57/1.18 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.57/1.18
% 3.57/1.18 % ------ iProver source info
% 3.57/1.18
% 3.57/1.18 % git: date: 2026-07-19 20:42:38 +0200
% 3.57/1.18 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.57/1.18 % git: non_committed_changes: false
% 3.57/1.18
% 3.57/1.18 % ------ Parsing...
% 3.57/1.18 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.57/1.18
% 3.57/1.18 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sup_sim: 0 sf_s rm: 3 0s sf_e pe_s pe_e %
% 3.57/1.18
% 3.57/1.18 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.57/1.18
% 3.57/1.18 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.57/1.18 % ------ Proving...
% 3.57/1.18 % ------ Problem Properties
% 3.57/1.18
% 3.57/1.18 %
% 3.57/1.18 % clauses 33
% 3.57/1.18 % conjectures 2
% 3.57/1.18 % EPR 7
% 3.57/1.18 % Horn 30
% 3.57/1.18 % unary 13
% 3.57/1.18 % binary 2
% 3.57/1.18 % lits 89
% 3.57/1.18 % lits eq 33
% 3.57/1.18 % fd_pure 0
% 3.57/1.18 % fd_pseudo 0
% 3.57/1.18 % fd_cond 5
% 3.57/1.18 % fd_pseudo_cond 4
% 3.57/1.18 % AC symbols 0
% 3.57/1.18
% 3.57/1.18 % ------ Schedule dynamic 5 is on
% 3.57/1.18
% 3.57/1.18 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.57/1.18
% 3.57/1.18
% 3.57/1.18 % ------
% 3.57/1.18 % Current options:
% 3.57/1.18 % ------
% 3.57/1.18
% 3.57/1.18
% 3.57/1.18 %
% 3.57/1.18
% 3.57/1.18 % ------ Proving...
% 3.57/1.18 %
% 3.57/1.18
% 3.57/1.18 % SZS status Theorem for theBenchmark.p
% 3.57/1.18
% 3.57/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.57/1.18
%------------------------------------------------------------------------------