%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC315+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 : n006.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:16 PM UTC 2026
% Result : Theorem 16.48s 3.43s
% Output : CNFRefutation 16.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 6
% Syntax : Number of formulae : 109 ( 30 unt; 0 def)
% Number of atoms : 346 ( 171 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 404 ( 167 ~; 174 |; 40 &)
% ( 2 <=>; 21 =>; 0 <=; 0 <~>)
% Maximal formula depth : 21 ( 4 avg)
% Maximal term depth : 3 ( 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 : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 96 ( 0 sgn 88 !; 8 ?; 32 :)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f19,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssItem(X3)
=> ( cons(X2,X0) = cons(X3,X1)
=> ( X1 = X0
& X2 = X3 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax19) ).
fof(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax81) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( app(X7,cons(X6,nil)) != X2
| app(cons(X6,nil),X7) != X3
| ~ ssList(X7) ) ) )
| ( ( nil = X0
| nil != X1 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(X5,cons(X4,nil)) = X0
| app(cons(X4,nil),X5) != X1
| ~ ssList(X5) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( neq(X3,nil)
& ! [X6] :
( ssItem(X6)
=> ! [X7] :
( app(X7,cons(X6,nil)) != X2
| app(cons(X6,nil),X7) != X3
| ~ ssList(X7) ) ) )
| ( ( nil = X0
| nil != X1 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( app(X5,cons(X4,nil)) = X0
| app(cons(X4,nil),X5) != X1
| ~ ssList(X5) ) ) )
| ( nil = X3
& nil != X2 )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ( ~ neq(X3,nil)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( app(X7,cons(X6,nil)) = X2
& app(cons(X6,nil),X7) = X3
& ssList(X7) ) ) )
& ( ( nil != X0
& nil = X1 )
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( app(X5,cons(X4,nil)) != X0
& app(cons(X4,nil),X5) = X1
& ssList(X5) ) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) ) ),
inference(ennf_transformation,[],[f81]) ).
fof(f101,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssItem(X1)
| nil != cons(X1,X0) ) ),
inference(ennf_transformation,[],[f21]) ).
fof(f104,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| ! [X3] :
( ~ ssItem(X3)
| cons(X2,X0) != cons(X3,X1)
| ( X1 = X0
& X2 = X3 ) ) ) ) ),
inference(ennf_transformation,[],[f19]) ).
fof(f105,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ! [X2] :
( ~ ssItem(X2)
| ! [X3] :
( ~ ssItem(X3)
| cons(X2,X0) != cons(X3,X1)
| ( X1 = X0
& X2 = X3 ) ) ) ) ),
inference(flattening,[],[f104]) ).
fof(f117,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f119,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ( ~ neq(sK3,nil)
| ( ssItem(sK6)
& sK2 = app(sK7,cons(sK6,nil))
& sK3 = app(cons(sK6,nil),sK7)
& ssList(sK7) ) )
& ( ( nil != sK0
& nil = sK1 )
| ( ssItem(sK4)
& sK0 != app(sK5,cons(sK4,nil))
& sK1 = app(cons(sK4,nil),sK5)
& ssList(sK5) ) )
& ( nil != sK3
| nil = sK2 )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5,sK6,sK7]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4),skolemize(X5,sK5),skolemize(X6,sK6),skolemize(X7,sK7)],[f98]) ).
fof(f124,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ neq(X0,X1)
| X0 != X1 )
& ( X0 = X1
| neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f117]) ).
fof(f127,plain,
ssList(sK1),
inference(cnf_transformation,[],[f119]) ).
fof(f129,plain,
( ~ neq(sK3,nil)
| ssItem(sK6) ),
inference(cnf_transformation,[],[f119]) ).
fof(f130,plain,
( ~ neq(sK3,nil)
| sK2 = app(sK7,cons(sK6,nil)) ),
inference(cnf_transformation,[],[f119]) ).
fof(f131,plain,
( ~ neq(sK3,nil)
| sK3 = app(cons(sK6,nil),sK7) ),
inference(cnf_transformation,[],[f119]) ).
fof(f132,plain,
( ~ neq(sK3,nil)
| ssList(sK7) ),
inference(cnf_transformation,[],[f119]) ).
fof(f133,plain,
( nil != sK0
| ssItem(sK4) ),
inference(cnf_transformation,[],[f119]) ).
fof(f134,plain,
( nil = sK1
| ssItem(sK4) ),
inference(cnf_transformation,[],[f119]) ).
fof(f135,plain,
( nil != sK0
| sK0 != app(sK5,cons(sK4,nil)) ),
inference(cnf_transformation,[],[f119]) ).
fof(f136,plain,
( nil = sK1
| sK0 != app(sK5,cons(sK4,nil)) ),
inference(cnf_transformation,[],[f119]) ).
fof(f137,plain,
( nil != sK0
| sK1 = app(cons(sK4,nil),sK5) ),
inference(cnf_transformation,[],[f119]) ).
fof(f138,plain,
( nil = sK1
| sK1 = app(cons(sK4,nil),sK5) ),
inference(cnf_transformation,[],[f119]) ).
fof(f139,plain,
( nil != sK0
| ssList(sK5) ),
inference(cnf_transformation,[],[f119]) ).
fof(f140,plain,
( nil = sK1
| ssList(sK5) ),
inference(cnf_transformation,[],[f119]) ).
fof(f141,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f119]) ).
fof(f142,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f119]) ).
fof(f143,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f119]) ).
fof(f148,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) ),
inference(cnf_transformation,[],[f99]) ).
fof(f150,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| nil != cons(X1,X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f154,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| cons(X2,X0) != cons(X3,X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f105]) ).
fof(f155,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssItem(X2)
| ~ ssItem(X3)
| cons(X2,X0) != cons(X3,X1)
| X2 = X3 ),
inference(cnf_transformation,[],[f105]) ).
fof(f168,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f124]) ).
fof(f171,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f172,plain,
( nil = sK3
| ssList(sK5) ),
inference(definition_unfolding,[],[f140,f143]) ).
fof(f173,plain,
( nil != sK2
| ssList(sK5) ),
inference(definition_unfolding,[],[f139,f142]) ).
fof(f174,plain,
( nil = sK3
| sK3 = app(cons(sK4,nil),sK5) ),
inference(definition_unfolding,[],[f138,f143,f143]) ).
fof(f175,plain,
( nil != sK2
| sK3 = app(cons(sK4,nil),sK5) ),
inference(definition_unfolding,[],[f137,f143,f142]) ).
fof(f176,plain,
( nil = sK3
| sK2 != app(sK5,cons(sK4,nil)) ),
inference(definition_unfolding,[],[f136,f142,f143]) ).
fof(f177,plain,
( nil != sK2
| sK2 != app(sK5,cons(sK4,nil)) ),
inference(definition_unfolding,[],[f135,f142,f142]) ).
fof(f178,plain,
( nil = sK3
| ssItem(sK4) ),
inference(definition_unfolding,[],[f134,f143]) ).
fof(f179,plain,
( nil != sK2
| ssItem(sK4) ),
inference(definition_unfolding,[],[f133,f142]) ).
fof(f180,plain,
ssList(sK3),
inference(definition_unfolding,[],[f127,f143]) ).
tcf(c_50,negated_conjecture,
( ( nil = sK2 )
| ( sK3 != nil ) ),
inference(cnf_transformation,[],[f141]) ).
tcf(c_51,negated_conjecture,
( ssList(sK5)
| ( sK3 = nil ) ),
inference(cnf_transformation,[],[f172]) ).
tcf(c_52,negated_conjecture,
( ssList(sK5)
| ( nil != sK2 ) ),
inference(cnf_transformation,[],[f173]) ).
tcf(c_53,negated_conjecture,
( ( sK3 = nil )
| ( app(cons(sK4,nil),sK5) = sK3 ) ),
inference(cnf_transformation,[],[f174]) ).
tcf(c_54,negated_conjecture,
( ( app(cons(sK4,nil),sK5) = sK3 )
| ( nil != sK2 ) ),
inference(cnf_transformation,[],[f175]) ).
tcf(c_55,negated_conjecture,
( ( sK3 = nil )
| ( app(sK5,cons(sK4,nil)) != sK2 ) ),
inference(cnf_transformation,[],[f176]) ).
tcf(c_56,negated_conjecture,
( ( nil != sK2 )
| ( app(sK5,cons(sK4,nil)) != sK2 ) ),
inference(cnf_transformation,[],[f177]) ).
tcf(c_57,negated_conjecture,
( ssItem(sK4)
| ( sK3 = nil ) ),
inference(cnf_transformation,[],[f178]) ).
tcf(c_58,negated_conjecture,
( ssItem(sK4)
| ( nil != sK2 ) ),
inference(cnf_transformation,[],[f179]) ).
tcf(c_59,negated_conjecture,
( ssList(sK7)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f132]) ).
tcf(c_60,negated_conjecture,
( ( app(cons(sK6,nil),sK7) = sK3 )
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f131]) ).
tcf(c_61,negated_conjecture,
( ( app(sK7,cons(sK6,nil)) = sK2 )
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f130]) ).
tcf(c_62,negated_conjecture,
( ssItem(sK6)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f129]) ).
tcf(c_64,negated_conjecture,
ssList(sK3),
inference(cnf_transformation,[],[f180]) ).
tcf(c_69,plain,
! [X0: $i,X1: $i] :
( ( app(cons(X1,nil),X0) = cons(X1,X0) )
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f148]) ).
tcf(c_71,plain,
! [X0: $i,X1: $i] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != nil ) ),
inference(cnf_transformation,[],[f150]) ).
tcf(c_75,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X0 = X2 )
| ~ ssItem(X2)
| ~ ssItem(X0)
| ~ ssList(X3)
| ~ ssList(X1)
| ( cons(X0,X1) != cons(X2,X3) ) ),
inference(cnf_transformation,[],[f155]) ).
tcf(c_76,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( ( X1 = X3 )
| ~ ssItem(X2)
| ~ ssItem(X0)
| ~ ssList(X3)
| ~ ssList(X1)
| ( cons(X0,X1) != cons(X2,X3) ) ),
inference(cnf_transformation,[],[f154]) ).
tcf(c_88,plain,
! [X0: $i,X1: $i] :
( neq(X1,X0)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f168]) ).
tcf(c_92,plain,
ssList(nil),
inference(cnf_transformation,[],[f171]) ).
tcf(c_110,negated_conjecture,
ssItem(sK4),
inference(global_subsumption_just,[status(thm)],[c_57,c_57,c_58,c_50]) ).
tcf(c_112,negated_conjecture,
ssList(sK5),
inference(global_subsumption_just,[status(thm)],[c_51,c_51,c_52,c_50]) ).
tcf(c_114,negated_conjecture,
ssItem(sK4),
inference(global_subsumption_just,[status(thm)],[c_58,c_110]) ).
tcf(c_116,negated_conjecture,
ssList(sK5),
inference(global_subsumption_just,[status(thm)],[c_52,c_112]) ).
tcf(c_120,negated_conjecture,
app(cons(sK4,nil),sK5) = sK3,
inference(global_subsumption_just,[status(thm)],[c_53,c_50,c_53,c_54]) ).
tcf(c_122,negated_conjecture,
app(sK5,cons(sK4,nil)) != sK2,
inference(global_subsumption_just,[status(thm)],[c_55,c_50,c_55,c_56]) ).
tcf(c_124,negated_conjecture,
app(cons(sK4,nil),sK5) = sK3,
inference(global_subsumption_just,[status(thm)],[c_54,c_120]) ).
tcf(c_126,negated_conjecture,
app(sK5,cons(sK4,nil)) != sK2,
inference(global_subsumption_just,[status(thm)],[c_56,c_122]) ).
tcf(c_522,plain,
! [X0: $i,X1: $i] :
( ssItem(sK6)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( X1 != nil )
| ( X0 != sK3 ) ),
inference(resolution_lifted,[status(thm)],[c_62,c_88]) ).
tcf(c_523,plain,
( ssItem(sK6)
| ( sK3 = nil )
| ~ ssList(nil)
| ~ ssList(sK3) ),
inference(unflattening,[status(thm)],[c_522]) ).
tcf(c_524,plain,
( ssItem(sK6)
| ( sK3 = nil ) ),
inference(global_subsumption_just,[status(thm)],[c_523,c_64,c_92,c_523]) ).
tcf(c_546,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( app(sK7,cons(sK6,nil)) = sK2 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( X1 != nil )
| ( X0 != sK3 ) ),
inference(resolution_lifted,[status(thm)],[c_61,c_88]) ).
tcf(c_547,plain,
( ( sK3 = nil )
| ( app(sK7,cons(sK6,nil)) = sK2 )
| ~ ssList(nil)
| ~ ssList(sK3) ),
inference(unflattening,[status(thm)],[c_546]) ).
tcf(c_548,plain,
( ( sK3 = nil )
| ( app(sK7,cons(sK6,nil)) = sK2 ) ),
inference(global_subsumption_just,[status(thm)],[c_547,c_64,c_92,c_547]) ).
tcf(c_570,plain,
! [X0: $i,X1: $i] :
( ( X0 = X1 )
| ( app(cons(sK6,nil),sK7) = sK3 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( X1 != nil )
| ( X0 != sK3 ) ),
inference(resolution_lifted,[status(thm)],[c_60,c_88]) ).
tcf(c_571,plain,
( ( sK3 = nil )
| ( app(cons(sK6,nil),sK7) = sK3 )
| ~ ssList(nil)
| ~ ssList(sK3) ),
inference(unflattening,[status(thm)],[c_570]) ).
tcf(c_572,plain,
( ( sK3 = nil )
| ( app(cons(sK6,nil),sK7) = sK3 ) ),
inference(global_subsumption_just,[status(thm)],[c_571,c_64,c_92,c_571]) ).
tcf(c_594,plain,
! [X0: $i,X1: $i] :
( ssList(sK7)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0)
| ( X1 != nil )
| ( X0 != sK3 ) ),
inference(resolution_lifted,[status(thm)],[c_59,c_88]) ).
tcf(c_595,plain,
( ssList(sK7)
| ( sK3 = nil )
| ~ ssList(nil)
| ~ ssList(sK3) ),
inference(unflattening,[status(thm)],[c_594]) ).
tcf(c_596,plain,
( ssList(sK7)
| ( sK3 = nil ) ),
inference(global_subsumption_just,[status(thm)],[c_595,c_64,c_92,c_595]) ).
tcf(c_1666,plain,
! [X0: $i] :
( ( app(cons(X0,nil),sK5) = cons(X0,sK5) )
| ~ ssItem(X0) ),
inference(superposition,[status(thm)],[c_116,c_69]) ).
tcf(c_1925,plain,
app(cons(sK4,nil),sK5) = cons(sK4,sK5),
inference(superposition,[status(thm)],[c_114,c_1666]) ).
tcf(c_1930,plain,
cons(sK4,sK5) = sK3,
inference(light_normalisation,[status(thm)],[c_1925,c_124]) ).
tcf(c_1942,plain,
( ~ ssItem(sK4)
| ~ ssList(sK5)
| ( sK3 != nil ) ),
inference(superposition,[status(thm)],[c_1930,c_71]) ).
tcf(c_1944,plain,
sK3 != nil,
inference(forward_subsumption_resolution,[status(thm)],[c_1942,c_114,c_116]) ).
tcf(c_1952,plain,
ssList(sK7),
inference(backward_subsumption_resolution,[status(thm)],[c_596,c_1944]) ).
tcf(c_1953,plain,
app(cons(sK6,nil),sK7) = sK3,
inference(backward_subsumption_resolution,[status(thm)],[c_572,c_1944]) ).
tcf(c_1954,plain,
app(sK7,cons(sK6,nil)) = sK2,
inference(backward_subsumption_resolution,[status(thm)],[c_548,c_1944]) ).
tcf(c_1955,plain,
ssItem(sK6),
inference(backward_subsumption_resolution,[status(thm)],[c_524,c_1944]) ).
tcf(c_2364,plain,
! [X0: $i,X1: $i] :
( ( X0 = sK4 )
| ~ ssItem(sK4)
| ~ ssList(sK5)
| ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != sK3 ) ),
inference(superposition,[status(thm)],[c_1930,c_75]) ).
tcf(c_2366,plain,
! [X0: $i,X1: $i] :
( ( X0 = sK4 )
| ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != sK3 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2364,c_114,c_116]) ).
tcf(c_2390,plain,
! [X0: $i] :
( ( app(cons(X0,nil),sK7) = cons(X0,sK7) )
| ~ ssItem(X0) ),
inference(superposition,[status(thm)],[c_1952,c_69]) ).
tcf(c_2575,plain,
! [X0: $i,X1: $i] :
( ( X1 = sK5 )
| ~ ssItem(sK4)
| ~ ssList(sK5)
| ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != sK3 ) ),
inference(superposition,[status(thm)],[c_1930,c_76]) ).
tcf(c_2577,plain,
! [X0: $i,X1: $i] :
( ( X1 = sK5 )
| ~ ssItem(X0)
| ~ ssList(X1)
| ( cons(X0,X1) != sK3 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_2575,c_114,c_116]) ).
tcf(c_23318,plain,
app(cons(sK6,nil),sK7) = cons(sK6,sK7),
inference(superposition,[status(thm)],[c_1955,c_2390]) ).
tcf(c_23322,plain,
cons(sK6,sK7) = sK3,
inference(light_normalisation,[status(thm)],[c_23318,c_1953]) ).
tcf(c_23441,plain,
( ( sK5 = sK7 )
| ~ ssItem(sK6)
| ~ ssList(sK7) ),
inference(superposition,[status(thm)],[c_23322,c_2577]) ).
tcf(c_23442,plain,
( ( sK4 = sK6 )
| ~ ssItem(sK6)
| ~ ssList(sK7) ),
inference(superposition,[status(thm)],[c_23322,c_2366]) ).
tcf(c_23450,plain,
sK4 = sK6,
inference(forward_subsumption_resolution,[status(thm)],[c_23442,c_1955,c_1952]) ).
tcf(c_23451,plain,
sK5 = sK7,
inference(forward_subsumption_resolution,[status(thm)],[c_23441,c_1955,c_1952]) ).
tcf(c_23505,plain,
app(sK7,cons(sK4,nil)) = sK2,
inference(demodulation,[status(thm)],[c_1954,c_23450]) ).
tcf(c_23556,plain,
app(sK5,cons(sK4,nil)) = sK2,
inference(light_normalisation,[status(thm)],[c_23505,c_23451]) ).
tcf(c_23557,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_23556,c_126]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SWC315+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.43 % Computer : n006.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Thu Sep 24 17:34:41 UTC 2026
% 0.17/0.43 % CPUTime :
% 0.17/0.43 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.17/0.49 Running first-order theorem proving
% 0.17/0.49 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.17/0.50
% 0.17/0.50 % ======== iProver multi-core TPTP/SMT =========
% 0.17/0.50
% 0.17/0.50 % Detected problem language: tptp
% 0.25/0.51 % Proving...
% 16.48/3.43 % SZS status Started for theBenchmark.p
% 16.48/3.43 % SZS status Theorem for theBenchmark.p
% 16.48/3.43
% 16.48/3.43 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 16.48/3.43
% 16.48/3.43 % ------ iProver source info
% 16.48/3.43
% 16.48/3.43 % git: date: 2026-07-19 20:42:38 +0200
% 16.48/3.43 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 16.48/3.43 % git: non_committed_changes: false
% 16.48/3.43
% 16.48/3.43 % ------ Parsing...
% 16.48/3.43 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 16.48/3.43
% 16.48/3.43 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe_e sup_sim: 0 sf_s rm: 2 0s sf_e pe_s pe_e %
% 16.48/3.43
% 16.48/3.43 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 16.48/3.43
% 16.48/3.43 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 16.48/3.43 % ------ Proving...
% 16.48/3.43 % ------ Problem Properties
% 16.48/3.43
% 16.48/3.43 %
% 16.48/3.43 % clauses 34
% 16.48/3.43 % conjectures 7
% 16.48/3.43 % EPR 11
% 16.48/3.43 % Horn 27
% 16.48/3.43 % unary 11
% 16.48/3.43 % binary 7
% 16.48/3.43 % lits 87
% 16.48/3.43 % lits eq 35
% 16.48/3.43 % fd_pure 0
% 16.48/3.43 % fd_pseudo 0
% 16.48/3.43 % fd_cond 4
% 16.48/3.43 % fd_pseudo_cond 4
% 16.48/3.43 % AC symbols 0
% 16.48/3.43
% 16.48/3.43 % ------ Schedule dynamic 5 is on
% 16.48/3.43
% 16.48/3.43 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 16.48/3.43
% 16.48/3.43
% 16.48/3.43 % ------
% 16.48/3.43 % Current options:
% 16.48/3.43 % ------
% 16.48/3.43
% 16.48/3.43
% 16.48/3.43 %
% 16.48/3.43
% 16.48/3.43 % ------ Proving...
% 16.48/3.43 %
% 16.48/3.43
% 16.48/3.43 % SZS status Theorem for theBenchmark.p
% 16.48/3.43
% 16.48/3.43 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 16.48/3.44
% 16.48/3.44
%------------------------------------------------------------------------------