%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC075+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:07:47 PM UTC 2026
% Result : Theorem 7.48s 2.00s
% Output : CNFRefutation 7.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 7
% Syntax : Number of formulae : 93 ( 34 unt; 0 def)
% Number of atoms : 310 ( 80 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 382 ( 165 ~; 154 |; 44 &)
% ( 4 <=>; 15 =>; 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 : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-2 aty)
% Number of variables : 96 ( 0 sgn 80 !; 16 ?; 24 :)
% Comments :
%------------------------------------------------------------------------------
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(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(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ( nil = X0
& nil = X1 )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( app(X6,X5) != X2
| app(X5,X6) != X3
| ~ ssList(X6) ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| 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] :
( ( nil = X0
& nil = X1 )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( app(X6,X5) != X2
| app(X5,X6) != X3
| ~ ssList(X6) ) )
| ? [X4] :
( segmentP(X0,X4)
& segmentP(X1,X4)
& neq(X4,nil)
& ssList(X4) )
| 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] :
( ( nil != X0
| nil != X1 )
& ? [X5] :
( ssList(X5)
& ? [X6] :
( app(X6,X5) = X2
& app(X5,X6) = X3
& ssList(X6) ) )
& ! [X4] :
( ~ segmentP(X0,X4)
| ~ segmentP(X1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& X0 = X2
& X1 = X3
& ssList(X3) ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(ennf_transformation,[],[f84]) ).
fof(f107,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(ennf_transformation,[],[f28]) ).
fof(f110,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( neq(X0,X1)
<=> X0 != X1 ) ) ),
inference(ennf_transformation,[],[f15]) ).
fof(f119,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,X0) ),
inference(ennf_transformation,[],[f55]) ).
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(f129,plain,
( ssList(sK0)
& ssList(sK1)
& ssList(sK2)
& ( nil != sK0
| nil != sK1 )
& ssList(sK4)
& sK2 = app(sK5,sK4)
& sK3 = app(sK4,sK5)
& ssList(sK5)
& ! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
& sK0 = sK2
& sK1 = sK3
& ssList(sK3) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0,sK1,sK2,sK3,sK4,sK5]),skolemize(X0,sK0),skolemize(X1,sK1),skolemize(X2,sK2),skolemize(X3,sK3),skolemize(X5,sK4),skolemize(X6,sK5)],[f98]) ).
fof(f133,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ neq(X0,X1)
| X0 != X1 )
& ( X0 = X1
| neq(X0,X1) ) ) ) ),
inference(nnf_transformation,[],[f110]) ).
fof(f137,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(f138,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,[],[f137]) ).
fof(f139,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))],[f138]) ).
fof(f140,plain,
ssList(sK0),
inference(cnf_transformation,[],[f129]) ).
fof(f141,plain,
ssList(sK1),
inference(cnf_transformation,[],[f129]) ).
fof(f143,plain,
( nil != sK0
| nil != sK1 ),
inference(cnf_transformation,[],[f129]) ).
fof(f144,plain,
ssList(sK4),
inference(cnf_transformation,[],[f129]) ).
fof(f145,plain,
sK2 = app(sK5,sK4),
inference(cnf_transformation,[],[f129]) ).
fof(f146,plain,
sK3 = app(sK4,sK5),
inference(cnf_transformation,[],[f129]) ).
fof(f147,plain,
ssList(sK5),
inference(cnf_transformation,[],[f129]) ).
fof(f148,plain,
! [X4] :
( ~ segmentP(sK0,X4)
| ~ segmentP(sK1,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f129]) ).
fof(f149,plain,
sK0 = sK2,
inference(cnf_transformation,[],[f129]) ).
fof(f150,plain,
sK1 = sK3,
inference(cnf_transformation,[],[f129]) ).
fof(f155,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f99]) ).
fof(f163,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f107]) ).
fof(f167,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f133]) ).
fof(f174,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f179,plain,
! [X0] :
( ~ ssList(X0)
| segmentP(X0,X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f185,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,[],[f139]) ).
fof(f190,plain,
! [X4] :
( ~ segmentP(sK2,X4)
| ~ segmentP(sK3,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f148,f150,f149]) ).
fof(f191,plain,
( nil != sK2
| nil != sK3 ),
inference(definition_unfolding,[],[f143,f150,f149]) ).
fof(f192,plain,
ssList(sK3),
inference(definition_unfolding,[],[f141,f150]) ).
fof(f193,plain,
ssList(sK2),
inference(definition_unfolding,[],[f140,f149]) ).
fof(f199,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,[],[f185]) ).
tcf(c_50,negated_conjecture,
! [X0: $i] :
( ~ ssList(X0)
| ~ segmentP(sK2,X0)
| ~ segmentP(sK3,X0)
| ~ neq(X0,nil) ),
inference(cnf_transformation,[],[f190]) ).
tcf(c_51,negated_conjecture,
ssList(sK5),
inference(cnf_transformation,[],[f147]) ).
tcf(c_52,negated_conjecture,
app(sK4,sK5) = sK3,
inference(cnf_transformation,[],[f146]) ).
tcf(c_53,negated_conjecture,
app(sK5,sK4) = sK2,
inference(cnf_transformation,[],[f145]) ).
tcf(c_54,negated_conjecture,
ssList(sK4),
inference(cnf_transformation,[],[f144]) ).
tcf(c_55,negated_conjecture,
( ( nil != sK2 )
| ( sK3 != nil ) ),
inference(cnf_transformation,[],[f191]) ).
tcf(c_57,negated_conjecture,
ssList(sK3),
inference(cnf_transformation,[],[f192]) ).
tcf(c_58,negated_conjecture,
ssList(sK2),
inference(cnf_transformation,[],[f193]) ).
tcf(c_62,plain,
! [X0: $i] :
( ( app(X0,nil) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f155]) ).
tcf(c_70,plain,
! [X0: $i] :
( ( app(nil,X0) = X0 )
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f163]) ).
tcf(c_73,plain,
! [X0: $i,X1: $i] :
( neq(X0,X1)
| ( X0 = X1 )
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f167]) ).
tcf(c_81,plain,
ssList(nil),
inference(cnf_transformation,[],[f174]) ).
tcf(c_86,plain,
! [X0: $i] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f179]) ).
tcf(c_89,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,[],[f199]) ).
tcf(c_677,plain,
! [X0: $i,X1: $i,X2: $i] :
( ( X1 = X2 )
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ segmentP(sK2,X0)
| ~ segmentP(sK3,X0)
| ( X2 != nil )
| ( X0 != X1 ) ),
inference(resolution_lifted,[status(thm)],[c_50,c_73]) ).
tcf(c_678,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(nil)
| ~ ssList(X0)
| ~ segmentP(sK2,X0)
| ~ segmentP(sK3,X0) ),
inference(unflattening,[status(thm)],[c_677]) ).
tcf(c_680,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ segmentP(sK3,X0)
| ~ segmentP(sK2,X0)
| ~ ssList(X0) ),
inference(global_subsumption_just,[status(thm)],[c_678,c_81,c_678]) ).
tcf(c_681,plain,
! [X0: $i] :
( ( X0 = nil )
| ~ ssList(X0)
| ~ segmentP(sK2,X0)
| ~ segmentP(sK3,X0) ),
inference(renaming,[status(thm)],[c_680]) ).
tcf(c_1801,plain,
( ( nil = sK2 )
| ~ ssList(sK2)
| ~ segmentP(sK3,sK2) ),
inference(superposition,[status(thm)],[c_86,c_681]) ).
tcf(c_1802,plain,
( ( nil = sK2 )
| ~ segmentP(sK3,sK2) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1801,c_58]) ).
tcf(c_1813,plain,
app(sK3,nil) = sK3,
inference(superposition,[status(thm)],[c_57,c_62]) ).
tcf(c_1815,plain,
app(sK4,nil) = sK4,
inference(superposition,[status(thm)],[c_54,c_62]) ).
tcf(c_1822,plain,
app(nil,sK3) = sK3,
inference(superposition,[status(thm)],[c_57,c_70]) ).
tcf(c_1823,plain,
app(nil,sK5) = sK5,
inference(superposition,[status(thm)],[c_51,c_70]) ).
tcf(c_3697,plain,
! [X0: $i] :
( segmentP(app(sK3,X0),sK5)
| ~ ssList(sK4)
| ~ ssList(sK5)
| ~ ssList(X0)
| ~ ssList(app(app(sK4,sK5),X0)) ),
inference(superposition,[status(thm)],[c_52,c_89]) ).
tcf(c_3704,plain,
! [X0: $i] :
( segmentP(app(sK3,X0),sK3)
| ~ ssList(nil)
| ~ ssList(sK3)
| ~ ssList(X0)
| ~ ssList(app(app(nil,sK3),X0)) ),
inference(superposition,[status(thm)],[c_1822,c_89]) ).
tcf(c_3705,plain,
! [X0: $i] :
( segmentP(app(sK5,X0),sK5)
| ~ ssList(sK5)
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(app(app(nil,sK5),X0)) ),
inference(superposition,[status(thm)],[c_1823,c_89]) ).
tcf(c_3741,plain,
! [X0: $i] :
( segmentP(app(sK5,X0),sK5)
| ~ ssList(sK5)
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(app(sK5,X0)) ),
inference(light_normalisation,[status(thm)],[c_3705,c_1823]) ).
tcf(c_3742,plain,
! [X0: $i] :
( segmentP(app(sK5,X0),sK5)
| ~ ssList(X0)
| ~ ssList(app(sK5,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3741,c_51,c_81]) ).
tcf(c_3746,plain,
! [X0: $i] :
( segmentP(app(sK3,X0),sK3)
| ~ ssList(nil)
| ~ ssList(sK3)
| ~ ssList(X0)
| ~ ssList(app(sK3,X0)) ),
inference(light_normalisation,[status(thm)],[c_3704,c_1822]) ).
tcf(c_3747,plain,
! [X0: $i] :
( segmentP(app(sK3,X0),sK3)
| ~ ssList(X0)
| ~ ssList(app(sK3,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3746,c_81,c_57]) ).
tcf(c_3776,plain,
! [X0: $i] :
( segmentP(app(sK3,X0),sK5)
| ~ ssList(sK4)
| ~ ssList(sK5)
| ~ ssList(X0)
| ~ ssList(app(sK3,X0)) ),
inference(light_normalisation,[status(thm)],[c_3697,c_52]) ).
tcf(c_3777,plain,
! [X0: $i] :
( segmentP(app(sK3,X0),sK5)
| ~ ssList(X0)
| ~ ssList(app(sK3,X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[c_3776,c_54,c_51]) ).
tcf(c_5209,plain,
( segmentP(sK2,sK5)
| ~ ssList(sK4)
| ~ ssList(app(sK5,sK4)) ),
inference(superposition,[status(thm)],[c_53,c_3742]) ).
tcf(c_5216,plain,
( segmentP(sK2,sK5)
| ~ ssList(sK4)
| ~ ssList(sK2) ),
inference(light_normalisation,[status(thm)],[c_5209,c_53]) ).
tcf(c_5217,plain,
segmentP(sK2,sK5),
inference(forward_subsumption_resolution,[status(thm)],[c_5216,c_54,c_58]) ).
tcf(c_5290,plain,
( ( nil = sK5 )
| ~ ssList(sK5)
| ~ segmentP(sK3,sK5) ),
inference(superposition,[status(thm)],[c_5217,c_681]) ).
tcf(c_5294,plain,
( ( nil = sK5 )
| ~ segmentP(sK3,sK5) ),
inference(forward_subsumption_resolution,[status(thm)],[c_5290,c_51]) ).
tcf(c_5993,plain,
( segmentP(sK3,sK3)
| ~ ssList(nil)
| ~ ssList(app(sK3,nil)) ),
inference(superposition,[status(thm)],[c_1813,c_3747]) ).
tcf(c_5998,plain,
( segmentP(sK3,sK3)
| ~ ssList(nil)
| ~ ssList(sK3) ),
inference(light_normalisation,[status(thm)],[c_5993,c_1813]) ).
tcf(c_5999,plain,
segmentP(sK3,sK3),
inference(forward_subsumption_resolution,[status(thm)],[c_5998,c_81,c_57]) ).
tcf(c_6695,plain,
( segmentP(sK3,sK5)
| ~ ssList(nil)
| ~ ssList(app(sK3,nil)) ),
inference(superposition,[status(thm)],[c_1813,c_3777]) ).
tcf(c_6699,plain,
( segmentP(sK3,sK5)
| ~ ssList(nil)
| ~ ssList(sK3) ),
inference(light_normalisation,[status(thm)],[c_6695,c_1813]) ).
tcf(c_6700,plain,
segmentP(sK3,sK5),
inference(forward_subsumption_resolution,[status(thm)],[c_6699,c_81,c_57]) ).
tcf(c_6716,plain,
nil = sK5,
inference(backward_subsumption_resolution,[status(thm)],[c_5294,c_6700]) ).
tcf(c_6742,plain,
app(nil,sK4) = sK2,
inference(demodulation,[status(thm)],[c_53,c_6716]) ).
tcf(c_6743,plain,
app(sK4,nil) = sK3,
inference(demodulation,[status(thm)],[c_52,c_6716]) ).
tcf(c_6745,plain,
sK3 = sK4,
inference(demodulation,[status(thm)],[c_1815,c_6743]) ).
tcf(c_6791,plain,
sK3 = sK2,
inference(light_normalisation,[status(thm)],[c_6742,c_1822,c_6745]) ).
tcf(c_6812,plain,
( ( sK3 = nil )
| ~ segmentP(sK3,sK3) ),
inference(demodulation,[status(thm)],[c_1802,c_6791]) ).
tcf(c_6814,plain,
sK3 != nil,
inference(demodulation,[status(thm)],[c_55,c_6791]) ).
tcf(c_6816,plain,
~ segmentP(sK3,sK3),
inference(forward_subsumption_resolution,[status(thm)],[c_6812,c_6814]) ).
tcf(c_6817,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_6816,c_5999]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SWC075+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.07 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.18/0.43 % Computer : n006.cluster.edu
% 0.18/0.43 % Model : x86_64 x86_64
% 0.18/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.43 % Memory : 8046.5625MB
% 0.18/0.43 % OS : Linux 6.8.0-71-generic
% 0.18/0.43 % CPULimit : 300
% 0.18/0.43 % WCLimit : 300
% 0.18/0.43 % DateTime : Thu Sep 24 16:14:56 UTC 2026
% 0.18/0.44 % CPUTime :
% 0.18/0.44 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.18/0.50 Running first-order theorem proving
% 0.18/0.50 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.27/0.52
% 0.27/0.52 % ======== iProver multi-core TPTP/SMT =========
% 0.27/0.52
% 0.27/0.52 % Detected problem language: tptp
% 0.27/0.54 % Proving...
% 7.48/2.00 % SZS status Started for theBenchmark.p
% 7.48/2.00 % SZS status Theorem for theBenchmark.p
% 7.48/2.00
% 7.48/2.00 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 7.48/2.00
% 7.48/2.00 % ------ iProver source info
% 7.48/2.00
% 7.48/2.00 % git: date: 2026-07-19 20:42:38 +0200
% 7.48/2.00 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 7.48/2.00 % git: non_committed_changes: false
% 7.48/2.00
% 7.48/2.00 % ------ Parsing...
% 7.48/2.00 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 7.48/2.00
% 7.48/2.00 % ------ 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 %
% 7.48/2.00
% 7.48/2.00 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 7.48/2.00
% 7.48/2.00 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.48/2.00 % ------ Proving...
% 7.48/2.00 % ------ Problem Properties
% 7.48/2.00
% 7.48/2.00 %
% 7.48/2.00 % clauses 42
% 7.48/2.00 % conjectures 7
% 7.48/2.00 % EPR 16
% 7.48/2.00 % Horn 39
% 7.48/2.00 % unary 12
% 7.48/2.00 % binary 5
% 7.48/2.00 % lits 125
% 7.48/2.00 % lits eq 33
% 7.48/2.00 % fd_pure 0
% 7.48/2.00 % fd_pseudo 0
% 7.48/2.00 % fd_cond 6
% 7.48/2.00 % fd_pseudo_cond 5
% 7.48/2.00 % AC symbols 0
% 7.48/2.00
% 7.48/2.00 % ------ Schedule dynamic 5 is on
% 7.48/2.00
% 7.48/2.00 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.48/2.00
% 7.48/2.00
% 7.48/2.00 % ------
% 7.48/2.00 % Current options:
% 7.48/2.00 % ------
% 7.48/2.00
% 7.48/2.00
% 7.48/2.00 %
% 7.48/2.00
% 7.48/2.00 % ------ Proving...
% 7.48/2.00 %
% 7.48/2.00
% 7.48/2.00 % SZS status Theorem for theBenchmark.p
% 7.48/2.00
% 7.48/2.00 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.48/2.00
% 7.48/2.00
%------------------------------------------------------------------------------