%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC052+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 : 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:07:41 PM UTC 2026
% Result : Theorem 3.25s 1.19s
% Output : CNFRefutation 3.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of formulae : 89 ( 22 unt; 0 def)
% Number of atoms : 346 ( 72 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 452 ( 195 ~; 183 |; 59 &)
% ( 4 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 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 : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 95 ( 0 sgn 76 !; 19 ?; 17 :)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( ( ? [X5] :
( segmentP(X0,X5)
& segmentP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ~ frontsegP(X2,X4)
| ~ frontsegP(X3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( 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] :
( ( ( ? [X5] :
( segmentP(X0,X5)
& segmentP(X1,X5)
& neq(X5,nil)
& ssList(X5) )
| ~ neq(X1,nil) )
& ( nil = X0
| nil != X1 ) )
| ( neq(X3,nil)
& ! [X4] :
( ~ frontsegP(X2,X4)
| ~ frontsegP(X3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ) )
| ( 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] :
( ( ( ! [X5] :
( ~ segmentP(X0,X5)
| ~ segmentP(X1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(X1,nil) )
| ( nil != X0
& nil = X1 ) )
& ( ~ neq(X3,nil)
| ? [X4] :
( frontsegP(X2,X4)
& frontsegP(X3,X4)
& neq(X4,nil)
& ssList(X4) ) )
& ( nil != X3
| nil = X2 )
& X0 = X2
& X1 = X3
& ssList(X3) ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f114,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( frontsegP(X0,X1)
<=> ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) ) ) ),
inference(ennf_transformation,[],[f5]) ).
fof(f124,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( segmentP(X0,X1)
<=> ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) ) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f138,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(ennf_transformation,[],[f28]) ).
fof(f140,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ( ( ! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5) )
& neq(sK1,nil) )
| ( nil != sK0
& nil = sK1 ) )
& ( ~ neq(sK3,nil)
| ( frontsegP(sK2,sK4)
& frontsegP(sK3,sK4)
& neq(sK4,nil)
& ssList(sK4) ) )
& ( nil != sK3
| nil = sK2 )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X4,sK4)],[f98]) ).
fof(f148,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ frontsegP(X0,X1)
| ? [X2] :
( app(X1,X2) = X0
& ssList(X2) ) )
& ( ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) )
| frontsegP(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f114]) ).
fof(f149,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ frontsegP(X0,X1)
| ? [X3] :
( app(X1,X3) = X0
& ssList(X3) ) )
& ( ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) )
| frontsegP(X0,X1) ) ) ) ),
inference(rectify,[],[f148]) ).
fof(f150,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ frontsegP(X0,X1)
| ( app(X1,sK9(X0,X1)) = X0
& ssList(sK9(X0,X1)) ) )
& ( ! [X2] :
( app(X1,X2) != X0
| ~ ssList(X2) )
| frontsegP(X0,X1) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK9]),skolemize(X3,sK9(X0,X1))],[f149]) ).
fof(f152,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(X0,X1)
| ? [X2] :
( ? [X3] :
( app(app(X2,X1),X3) = X0
& ssList(X3) )
& ssList(X2) ) )
& ( ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) )
| segmentP(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f124]) ).
fof(f153,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(X0,X1)
| ? [X4] :
( ? [X5] :
( app(app(X4,X1),X5) = X0
& ssList(X5) )
& ssList(X4) ) )
& ( ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) )
| segmentP(X0,X1) ) ) ) ),
inference(rectify,[],[f152]) ).
fof(f154,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(X0,X1)
| ( app(app(sK10(X0,X1),X1),sK11(X0,X1)) = X0
& ssList(sK11(X0,X1))
& ssList(sK10(X0,X1)) ) )
& ( ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) )
| segmentP(X0,X1) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10,sK11]),skolemize(X4,sK10(X0,X1)),skolemize(X5,sK11(X0,X1))],[f153]) ).
fof(f157,plain,
ssList(sK0),
inference(cnf_transformation,[],[f140]) ).
fof(f158,plain,
ssList(sK1),
inference(cnf_transformation,[],[f140]) ).
fof(f160,plain,
! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil != sK0 ),
inference(cnf_transformation,[],[f140]) ).
fof(f161,plain,
( neq(sK1,nil)
| nil != sK0 ),
inference(cnf_transformation,[],[f140]) ).
fof(f162,plain,
! [X5] :
( ~ segmentP(sK0,X5)
| ~ segmentP(sK1,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil = sK1 ),
inference(cnf_transformation,[],[f140]) ).
fof(f163,plain,
( neq(sK1,nil)
| nil = sK1 ),
inference(cnf_transformation,[],[f140]) ).
fof(f164,plain,
( ~ neq(sK3,nil)
| frontsegP(sK2,sK4) ),
inference(cnf_transformation,[],[f140]) ).
fof(f165,plain,
( ~ neq(sK3,nil)
| frontsegP(sK3,sK4) ),
inference(cnf_transformation,[],[f140]) ).
fof(f166,plain,
( ~ neq(sK3,nil)
| neq(sK4,nil) ),
inference(cnf_transformation,[],[f140]) ).
fof(f167,plain,
( ~ neq(sK3,nil)
| ssList(sK4) ),
inference(cnf_transformation,[],[f140]) ).
fof(f168,plain,
( nil != sK3
| nil = sK2 ),
inference(cnf_transformation,[],[f140]) ).
fof(f169,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f140]) ).
fof(f170,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f140]) ).
fof(f183,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f194,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ frontsegP(X0,X1)
| app(X1,sK9(X0,X1)) = X0 ),
inference(cnf_transformation,[],[f150]) ).
fof(f195,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ frontsegP(X0,X1)
| ssList(sK9(X0,X1)) ),
inference(cnf_transformation,[],[f150]) ).
fof(f207,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(X0,X1) ),
inference(cnf_transformation,[],[f154]) ).
fof(f221,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f138]) ).
fof(f223,plain,
( neq(sK3,nil)
| nil = sK3 ),
inference(definition_unfolding,[],[f163,f170,f170]) ).
fof(f224,plain,
! [X5] :
( ~ segmentP(sK2,X5)
| ~ segmentP(sK3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil = sK3 ),
inference(definition_unfolding,[],[f162,f170,f170,f169]) ).
fof(f225,plain,
( neq(sK3,nil)
| nil != sK2 ),
inference(definition_unfolding,[],[f161,f169,f170]) ).
fof(f226,plain,
! [X5] :
( ~ segmentP(sK2,X5)
| ~ segmentP(sK3,X5)
| ~ neq(X5,nil)
| ~ ssList(X5)
| nil != sK2 ),
inference(definition_unfolding,[],[f160,f169,f170,f169]) ).
fof(f227,plain,
ssList(sK3),
inference(definition_unfolding,[],[f158,f170]) ).
fof(f228,plain,
ssList(sK2),
inference(definition_unfolding,[],[f157,f169]) ).
fof(f235,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f207]) ).
tcf(c_50,negated_conjecture,
( ( nil = sK2 )
| ( sK3 != nil ) ),
inference(cnf_transformation,[],[f168]) ).
tcf(c_51,negated_conjecture,
( ssList(sK4)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f167]) ).
tcf(c_52,negated_conjecture,
( neq(sK4,nil)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f166]) ).
tcf(c_53,negated_conjecture,
( frontsegP(sK3,sK4)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f165]) ).
tcf(c_54,negated_conjecture,
( frontsegP(sK2,sK4)
| ~ neq(sK3,nil) ),
inference(cnf_transformation,[],[f164]) ).
tcf(c_55,negated_conjecture,
( neq(sK3,nil)
| ( sK3 = nil ) ),
inference(cnf_transformation,[],[f223]) ).
tcf(c_56,negated_conjecture,
! [X0: $i] :
( ( sK3 = nil )
| ~ ssList(X0)
| ~ segmentP(sK2,X0)
| ~ segmentP(sK3,X0)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f224]) ).
tcf(c_57,negated_conjecture,
( neq(sK3,nil)
| ( nil != sK2 ) ),
inference(cnf_transformation,[],[f225]) ).
tcf(c_58,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sK2,X0)
| ~ segmentP(sK3,X0)
| ~ neq(X0,nil)
| ( nil != sK2 ) ),
inference(cnf_transformation,[],[f226]) ).
tcf(c_60,negated_conjecture,
ssList(sK3),
inference(cnf_transformation,[],[f227]) ).
tcf(c_61,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f228]) ).
tcf(c_73,plain,
ssList(nil),
inference(cnf_transformation,[],[f183]) ).
tcf(c_85,plain,
! [X0: $i,X1: $i] :
( ssList(sK9(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ frontsegP(X0,X1) ),
inference(cnf_transformation,[],[f195]) ).
tcf(c_86,plain,
! [X0: $i,X1: $i] :
( ( app(X1,sK9(X0,X1)) = X0 )
| ~ ssList(X1)
| ~ ssList(X0)
| ~ frontsegP(X0,X1) ),
inference(cnf_transformation,[],[f194]) ).
tcf(c_94,plain,
! [X0: $i,X1: $i,X2: $i] :
( segmentP(app(app(X0,X1),X2),X1)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssList(app(app(X0,X1),X2)) ),
inference(cnf_transformation,[],[f235]) ).
tcf(c_111,plain,
! [X0: $i] :
( ( app(nil,X0) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f221]) ).
tcf(c_145,negated_conjecture,
ssList(sK4),
inference(global_subsumption_just,[status(thm)],[c_51,c_51,c_55,c_57,c_50]) ).
tcf(c_151,negated_conjecture,
neq(sK3,nil),
inference(global_subsumption_just,[status(thm)],[c_55,c_55,c_57,c_50]) ).
tcf(c_153,negated_conjecture,
frontsegP(sK2,sK4),
inference(global_subsumption_just,[status(thm)],[c_54,c_55,c_54,c_57,c_50]) ).
tcf(c_155,negated_conjecture,
frontsegP(sK3,sK4),
inference(global_subsumption_just,[status(thm)],[c_53,c_53,c_151]) ).
tcf(c_157,negated_conjecture,
neq(sK4,nil),
inference(global_subsumption_just,[status(thm)],[c_52,c_55,c_52,c_57,c_50]) ).
tcf(c_166,plain,
! [X0: $i] :
( ~ neq(X0,nil)
| ~ segmentP(sK3,X0)
| ~ segmentP(sK2,X0)
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_56,c_50,c_56,c_58]) ).
tcf(c_167,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sK2,X0)
| ~ segmentP(sK3,X0)
| ~ neq(X0,nil) ),
inference(renaming,[status(thm)],[c_166]) ).
tcf(c_168,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sK2,X0)
| ~ segmentP(sK3,X0)
| ~ neq(X0,nil) ),
inference(global_subsumption_just,[status(thm)],[c_58,c_167]) ).
tcf(c_935,plain,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sK2,X0)
| ~ segmentP(sK3,X0)
| ( nil != nil )
| ( X0 != sK4 ) ),
inference(resolution_lifted,[status(thm)],[c_157,c_168]) ).
tcf(c_936,plain,
( ~ ssList(sK4)
| ~ segmentP(sK2,sK4)
| ~ segmentP(sK3,sK4) ),
inference(unflattening,[status(thm)],[c_935]) ).
tcf(c_937,plain,
( ~ segmentP(sK3,sK4)
| ~ segmentP(sK2,sK4) ),
inference(global_subsumption_just,[status(thm)],[c_936,c_51,c_55,c_57,c_50,c_936]) ).
tcf(c_938,plain,
( ~ segmentP(sK2,sK4)
| ~ segmentP(sK3,sK4) ),
inference(renaming,[status(thm)],[c_937]) ).
tcf(c_2600,plain,
app(nil,sK4) = sK4,
inference(superposition,[status(thm)],[c_145,c_111]) ).
tcf(c_3315,plain,
( ( app(sK4,sK9(sK3,sK4)) = sK3 )
| ~ ssList(sK4)
| ~ ssList(sK3) ),
inference(superposition,[status(thm)],[c_155,c_86]) ).
tcf(c_3316,plain,
( ( app(sK4,sK9(sK2,sK4)) = sK2 )
| ~ ssList(sK4)
| ~ ssList(sK2) ),
inference(superposition,[status(thm)],[c_153,c_86]) ).
tcf(c_3341,plain,
app(sK4,sK9(sK2,sK4)) = sK2,
inference(forward_subsumption_resolution,[status(thm)],[c_3316,c_145,c_61]) ).
tcf(c_3342,plain,
app(sK4,sK9(sK3,sK4)) = sK3,
inference(forward_subsumption_resolution,[status(thm)],[c_3315,c_145,c_60]) ).
tcf(c_5533,plain,
! [X0: $i] :
( segmentP(app(sK4,X0),sK4)
| ~ ssList(sK4)
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(app(app(nil,sK4),X0)) ),
inference(superposition,[status(thm)],[c_2600,c_94]) ).
tcf(c_5566,plain,
! [X0: $i] :
( segmentP(app(sK4,X0),sK4)
| ~ ssList(sK4)
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(app(sK4,X0)) ),
inference(light_normalisation,[status(thm)],[c_5533,c_2600]) ).
tcf(c_5567,plain,
! [X0: $i] :
( segmentP(app(sK4,X0),sK4)
| ~ ssList(X0)
| ~ ssList(app(sK4,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5566,c_145,c_73]) ).
tcf(c_6207,plain,
( segmentP(sK3,sK4)
| ~ ssList(sK9(sK3,sK4))
| ~ ssList(app(sK4,sK9(sK3,sK4))) ),
inference(superposition,[status(thm)],[c_3342,c_5567]) ).
tcf(c_6208,plain,
( segmentP(sK2,sK4)
| ~ ssList(sK9(sK2,sK4))
| ~ ssList(app(sK4,sK9(sK2,sK4))) ),
inference(superposition,[status(thm)],[c_3341,c_5567]) ).
tcf(c_6215,plain,
( segmentP(sK2,sK4)
| ~ ssList(sK2)
| ~ ssList(sK9(sK2,sK4)) ),
inference(light_normalisation,[status(thm)],[c_6208,c_3341]) ).
tcf(c_6216,plain,
( segmentP(sK2,sK4)
| ~ ssList(sK9(sK2,sK4)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_6215,c_61]) ).
tcf(c_6219,plain,
( segmentP(sK3,sK4)
| ~ ssList(sK3)
| ~ ssList(sK9(sK3,sK4)) ),
inference(light_normalisation,[status(thm)],[c_6207,c_3342]) ).
tcf(c_6220,plain,
( segmentP(sK3,sK4)
| ~ ssList(sK9(sK3,sK4)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_6219,c_60]) ).
tcf(c_6277,plain,
( segmentP(sK2,sK4)
| ~ ssList(sK4)
| ~ ssList(sK2)
| ~ frontsegP(sK2,sK4) ),
inference(superposition,[status(thm)],[c_85,c_6216]) ).
tcf(c_6278,plain,
segmentP(sK2,sK4),
inference(forward_subsumption_resolution,[status(thm)],[c_6277,c_145,c_61,c_153]) ).
tcf(c_6293,plain,
~ ssList(sK9(sK3,sK4)),
inference(global_subsumption_just,[status(thm)],[c_6220,c_938,c_6220,c_6278]) ).
tcf(c_6295,plain,
( ~ ssList(sK4)
| ~ ssList(sK3)
| ~ frontsegP(sK3,sK4) ),
inference(superposition,[status(thm)],[c_85,c_6293]) ).
tcf(c_6296,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6295,c_145,c_60,c_155]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC052+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.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 16:08:04 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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.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...
% 3.25/1.19 % SZS status Started for theBenchmark.p
% 3.25/1.19 % SZS status Theorem for theBenchmark.p
% 3.25/1.19
% 3.25/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.25/1.19
% 3.25/1.19 % ------ iProver source info
% 3.25/1.19
% 3.25/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 3.25/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.25/1.19 % git: non_committed_changes: false
% 3.25/1.19
% 3.25/1.19 % ------ Parsing...
% 3.25/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.25/1.19
% 3.25/1.19 % ------ 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 %
% 3.25/1.19
% 3.25/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.25/1.19
% 3.25/1.19 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.25/1.19 % ------ Proving...
% 3.25/1.19 % ------ Problem Properties
% 3.25/1.19
% 3.25/1.19 %
% 3.25/1.19 % clauses 57
% 3.25/1.19 % conjectures 5
% 3.25/1.19 % EPR 26
% 3.25/1.19 % Horn 54
% 3.25/1.19 % unary 14
% 3.25/1.19 % binary 8
% 3.25/1.19 % lits 180
% 3.25/1.19 % lits eq 35
% 3.25/1.19 % fd_pure 0
% 3.25/1.19 % fd_pseudo 0
% 3.25/1.19 % fd_cond 7
% 3.25/1.19 % fd_pseudo_cond 7
% 3.25/1.19 % AC symbols 0
% 3.25/1.19
% 3.25/1.19 % ------ Schedule dynamic 5 is on
% 3.25/1.19
% 3.25/1.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.25/1.19
% 3.25/1.19
% 3.25/1.19 % ------
% 3.25/1.19 % Current options:
% 3.25/1.19 % ------
% 3.25/1.19
% 3.25/1.19
% 3.25/1.19 %
% 3.25/1.19
% 3.25/1.19 % ------ Proving...
% 3.25/1.19 %
% 3.25/1.19
% 3.25/1.19 % SZS status Theorem for theBenchmark.p
% 3.25/1.19
% 3.25/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.25/1.20
% 3.25/1.20
%------------------------------------------------------------------------------