%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC039+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 : n013.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:37 PM UTC 2026
% Result : Theorem 3.74s 1.19s
% Output : CNFRefutation 3.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 6
% Syntax : Number of formulae : 69 ( 22 unt; 1 def)
% Number of atoms : 317 ( 104 equ)
% Maximal formula atoms : 21 ( 4 avg)
% Number of connectives : 391 ( 143 ~; 131 |; 96 &)
% ( 4 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 7 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 : 9 ( 7 usr; 2 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 5 con; 0-2 aty)
% Number of variables : 138 ( 0 sgn 99 !; 39 ?; 31 :)
% 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/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) )
| ? [X7] :
( lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2 ) ) ) ) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ssList(X6)
=> ( ? [X8] :
( lt(X8,X4)
& memberP(X6,X8)
& ssItem(X8) )
| ? [X7] :
( lt(X4,X7)
& memberP(X5,X7)
& ssItem(X7) )
| app(app(X5,X2),X6) != X3
| cons(X4,nil) != X2 ) ) ) ) )
| nil = X0
| X0 != X2
| X1 != X3
| nil != X1 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f103,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(f176,plain,
! [X0] :
( ~ ssList(X0)
| ( segmentP(nil,X0)
<=> nil = X0 ) ),
inference(ennf_transformation,[],[f58]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ! [X8] :
( ~ lt(X8,X4)
| ~ memberP(X6,X8)
| ~ ssItem(X8) )
& ! [X7] :
( ~ lt(X4,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2 ) ) ) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( nil = X2
& nil = X3 )
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ! [X8] :
( ~ lt(X8,X4)
| ~ memberP(X6,X8)
| ~ ssItem(X8) )
& ! [X7] :
( ~ lt(X4,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2 ) ) ) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f248,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,[],[f103]) ).
fof(f249,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,[],[f248]) ).
fof(f250,plain,
! [X0] :
( ~ ssList(X0)
| ! [X1] :
( ~ ssList(X1)
| ( ( ~ segmentP(X0,X1)
| ( app(app(sK14(X0,X1),X1),sK15(X0,X1)) = X0
& ssList(sK15(X0,X1))
& ssList(sK14(X0,X1)) ) )
& ( ! [X2] :
( ! [X3] :
( app(app(X2,X1),X3) != X0
| ~ ssList(X3) )
| ~ ssList(X2) )
| segmentP(X0,X1) ) ) ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14,sK15]),skolemize(X4,sK14(X0,X1)),skolemize(X5,sK15(X0,X1))],[f249]) ).
fof(f287,plain,
! [X0] :
( ~ ssList(X0)
| ( ( ~ segmentP(nil,X0)
| nil = X0 )
& ( nil != X0
| segmentP(nil,X0) ) ) ),
inference(nnf_transformation,[],[f176]) ).
fof(f301,plain,
( ssList(sK57)
& ssList(sK58)
& ssList(sK59)
& ssList(sK60)
& ( ( nil = sK59
& nil = sK60 )
| sP6(sK59,sK60) )
& nil != sK57
& sK57 = sK59
& sK58 = sK60
& nil = sK58 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK57,sK58,sK59,sK60]),skolemize(X0,sK57),skolemize(X1,sK58),skolemize(X2,sK59),skolemize(X3,sK60)],[f233]) ).
fof(f323,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,[],[f250]) ).
fof(f448,plain,
! [X0] :
( ~ ssList(X0)
| ~ segmentP(nil,X0)
| nil = X0 ),
inference(cnf_transformation,[],[f287]) ).
fof(f508,plain,
ssList(sK57),
inference(cnf_transformation,[],[f301]) ).
fof(f509,plain,
ssList(sK58),
inference(cnf_transformation,[],[f301]) ).
fof(f512,plain,
( nil = sK59
| sP6(sK59,sK60) ),
inference(cnf_transformation,[],[f301]) ).
fof(f514,plain,
nil != sK57,
inference(cnf_transformation,[],[f301]) ).
fof(f515,plain,
sK57 = sK59,
inference(cnf_transformation,[],[f301]) ).
fof(f516,plain,
sK58 = sK60,
inference(cnf_transformation,[],[f301]) ).
fof(f517,plain,
nil = sK58,
inference(cnf_transformation,[],[f301]) ).
fof(f518,plain,
nil = sK60,
inference(definition_unfolding,[],[f517,f516]) ).
fof(f539,plain,
! [X0] :
( ~ ssList(X0)
| ~ segmentP(sK60,X0)
| sK60 = X0 ),
inference(definition_unfolding,[],[f448,f518,f518]) ).
fof(f578,plain,
sK59 != sK60,
inference(definition_unfolding,[],[f514,f518,f515]) ).
fof(f580,plain,
( sK59 = sK60
| sP6(sK59,sK60) ),
inference(definition_unfolding,[],[f512,f518]) ).
fof(f581,plain,
ssList(sK60),
inference(definition_unfolding,[],[f509,f516]) ).
fof(f582,plain,
ssList(sK59),
inference(definition_unfolding,[],[f508,f515]) ).
fof(f588,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,[],[f323]) ).
tcf(c_67,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,[],[f588]) ).
tcf(c_196,negated_conjecture,
! [X0: $i] :
( ( X0 = sK60 )
| ~ ssList(X0)
| ~ segmentP(sK60,X0) ),
inference(cnf_transformation,[],[f539]) ).
tcf(c_253,negated_conjecture,
sK60 != sK59,
inference(cnf_transformation,[],[f578]) ).
tcf(c_254,negated_conjecture,
( sP6(sK59,sK60)
| ( sK60 = sK59 ) ),
inference(cnf_transformation,[],[f580]) ).
tcf(c_257,negated_conjecture,
ssList(sK60),
inference(cnf_transformation,[],[f581]) ).
tcf(c_258,negated_conjecture,
ssList(sK59),
inference(cnf_transformation,[],[f582]) ).
tcf(c_378,negated_conjecture,
sP6(sK59,sK60),
inference(global_subsumption_just,[status(thm)],[c_254,c_253,c_254]) ).
tcf(c_4168,negated_conjecture,
sK60 != sK59,
inference(subtyping,[status(esa)],[c_253]) ).
tcf(c_4207,negated_conjecture,
! [X0_iProver_app_2: iProver_app_2] :
( ( X0_iProver_app_2 = sK60 )
| ~ ssList(X0_iProver_app_2)
| ~ segmentP(sK60,X0_iProver_app_2) ),
inference(subtyping,[status(esa)],[c_196]) ).
tcf(c_4322,plain,
! [X0_iProver_app_2: iProver_app_2,X1_iProver_app_2: iProver_app_2,X2_iProver_app_2: iProver_app_2] :
( segmentP(app(app(X0_iProver_app_2,X1_iProver_app_2),X2_iProver_app_2),X1_iProver_app_2)
| ~ ssList(X2_iProver_app_2)
| ~ ssList(X1_iProver_app_2)
| ~ ssList(X0_iProver_app_2)
| ~ ssList(app(app(X0_iProver_app_2,X1_iProver_app_2),X2_iProver_app_2)) ),
inference(subtyping,[status(esa)],[c_67]) ).
tcf(c_4527,plain,
! [X0_iProver_app_2: iProver_app_2] : X0_iProver_app_2 = X0_iProver_app_2,
theory(equality) ).
tcf(c_4529,plain,
! [X0_iProver_app_2: iProver_app_2,X1_iProver_app_2: iProver_app_2,X2_iProver_app_2: iProver_app_2] :
( ( X2_iProver_app_2 = X0_iProver_app_2 )
| ( X2_iProver_app_2 != X1_iProver_app_2 )
| ( X0_iProver_app_2 != X1_iProver_app_2 ) ),
theory(equality) ).
tcf(c_4654,plain,
sK60 = sK60,
inference(instantiation,[status(thm)],[c_4527]) ).
tcf(c_6025,plain,
! [X0_iProver_app_2: iProver_app_2] :
( ( sK60 = sK59 )
| ( sK59 != X0_iProver_app_2 )
| ( sK60 != X0_iProver_app_2 ) ),
inference(instantiation,[status(thm)],[c_4529]) ).
tcf(c_6026,plain,
( ( sK60 = sK59 )
| ( sK59 != sK60 )
| ( sK60 != sK60 ) ),
inference(instantiation,[status(thm)],[c_6025]) ).
tcf(c_12114,plain,
( ( sK59 = sK60 )
| ~ ssList(sK59)
| ~ segmentP(sK60,sK59) ),
inference(instantiation,[status(thm)],[c_4207]) ).
fof(f232,definition,
! [X2,X3] :
( ~ sP6(X2,X3)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ! [X8] :
( ~ lt(X8,X4)
| ~ memberP(X6,X8)
| ~ ssItem(X8) )
& ! [X7] :
( ~ lt(X4,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2 ) ) ) ),
introduced(definition,[new_symbols(definition,[sP6])],[predicate_definition_introduction]) ).
fof(f233,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( nil = X2
& nil = X3 )
| sP6(X2,X3) )
& nil != X0
& X0 = X2
& X1 = X3
& nil = X1 ) ) ) ),
inference(definition_folding,[],[f222,f232]) ).
fof(f298,plain,
! [X2,X3] :
( ~ sP6(X2,X3)
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& ! [X8] :
( ~ lt(X8,X4)
| ~ memberP(X6,X8)
| ~ ssItem(X8) )
& ! [X7] :
( ~ lt(X4,X7)
| ~ memberP(X5,X7)
| ~ ssItem(X7) )
& app(app(X5,X2),X6) = X3
& cons(X4,nil) = X2 ) ) ) ),
inference(nnf_transformation,[],[f232]) ).
fof(f299,plain,
! [X0,X1] :
( ~ sP6(X0,X1)
| ? [X2] :
( ssItem(X2)
& ? [X3] :
( ssList(X3)
& ? [X4] :
( ssList(X4)
& ! [X6] :
( ~ lt(X6,X2)
| ~ memberP(X4,X6)
| ~ ssItem(X6) )
& ! [X5] :
( ~ lt(X2,X5)
| ~ memberP(X3,X5)
| ~ ssItem(X5) )
& app(app(X3,X0),X4) = X1
& cons(X2,nil) = X0 ) ) ) ),
inference(rectify,[],[f298]) ).
fof(f300,plain,
! [X0,X1] :
( ~ sP6(X0,X1)
| ( ssItem(sK54(X0,X1))
& ssList(sK55(X0,X1))
& ssList(sK56(X0,X1))
& ! [X6] :
( ~ lt(X6,sK54(X0,X1))
| ~ memberP(sK56(X0,X1),X6)
| ~ ssItem(X6) )
& ! [X5] :
( ~ lt(sK54(X0,X1),X5)
| ~ memberP(sK55(X0,X1),X5)
| ~ ssItem(X5) )
& app(app(sK55(X0,X1),X0),sK56(X0,X1)) = X1
& cons(sK54(X0,X1),nil) = X0 ) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK54,sK55,sK56]),skolemize(X2,sK54(X0,X1)),skolemize(X3,sK55(X0,X1)),skolemize(X4,sK56(X0,X1))],[f299]) ).
fof(f502,plain,
! [X0,X1] :
( ~ sP6(X0,X1)
| ssList(sK55(X0,X1)) ),
inference(cnf_transformation,[],[f300]) ).
fof(f503,plain,
! [X0,X1] :
( ~ sP6(X0,X1)
| ssList(sK56(X0,X1)) ),
inference(cnf_transformation,[],[f300]) ).
fof(f506,plain,
! [X0,X1] :
( ~ sP6(X0,X1)
| app(app(sK55(X0,X1),X0),sK56(X0,X1)) = X1 ),
inference(cnf_transformation,[],[f300]) ).
tcf(c_247,plain,
! [X0: $i,X1: $i] :
( ( app(app(sK55(X0,X1),X0),sK56(X0,X1)) = X1 )
| ~ sP6(X0,X1) ),
inference(cnf_transformation,[],[f506]) ).
tcf(c_250,plain,
! [X0: $i,X1: $i] :
( ssList(sK56(X0,X1))
| ~ sP6(X0,X1) ),
inference(cnf_transformation,[],[f503]) ).
tcf(c_251,plain,
! [X0: $i,X1: $i] :
( ssList(sK55(X0,X1))
| ~ sP6(X0,X1) ),
inference(cnf_transformation,[],[f502]) ).
tcf(c_512,plain,
! [X0: $i,X1: $i] :
( ( app(app(sK55(X0,X1),X0),sK56(X0,X1)) = X1 )
| ~ sP6(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_247]) ).
tcf(c_514,plain,
! [X0: $i,X1: $i] :
( ssList(sK56(X0,X1))
| ~ sP6(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_250]) ).
tcf(c_516,plain,
! [X0: $i,X1: $i] :
( ssList(sK55(X0,X1))
| ~ sP6(X0,X1) ),
inference(prop_impl_just,[status(thm)],[c_251]) ).
tcf(c_815,plain,
! [X0: $i,X1: $i] :
( ssList(sK55(X0,X1))
| ( X1 != sK60 )
| ( X0 != sK59 ) ),
inference(resolution_lifted,[status(thm)],[c_516,c_378]) ).
tcf(c_816,plain,
ssList(sK55(sK59,sK60)),
inference(unflattening,[status(thm)],[c_815]) ).
tcf(c_820,plain,
! [X0: $i,X1: $i] :
( ssList(sK56(X0,X1))
| ( X1 != sK60 )
| ( X0 != sK59 ) ),
inference(resolution_lifted,[status(thm)],[c_514,c_378]) ).
tcf(c_821,plain,
ssList(sK56(sK59,sK60)),
inference(unflattening,[status(thm)],[c_820]) ).
tcf(c_849,plain,
! [X0: $i,X1: $i] :
( ( app(app(sK55(X0,X1),X0),sK56(X0,X1)) = X1 )
| ( X1 != sK60 )
| ( X0 != sK59 ) ),
inference(resolution_lifted,[status(thm)],[c_512,c_378]) ).
tcf(c_850,plain,
app(app(sK55(sK59,sK60),sK59),sK56(sK59,sK60)) = sK60,
inference(unflattening,[status(thm)],[c_849]) ).
tcf(c_4149,plain,
app(app(sK55(sK59,sK60),sK59),sK56(sK59,sK60)) = sK60,
inference(subtyping,[status(esa)],[c_850]) ).
tcf(c_13902,plain,
( segmentP(sK60,sK59)
| ~ ssList(sK59)
| ~ ssList(sK56(sK59,sK60))
| ~ ssList(sK55(sK59,sK60))
| ~ ssList(app(app(sK55(sK59,sK60),sK59),sK56(sK59,sK60))) ),
inference(superposition,[status(thm)],[c_4149,c_4322]) ).
tcf(c_13938,plain,
( segmentP(sK60,sK59)
| ~ ssList(sK59)
| ~ ssList(sK60)
| ~ ssList(sK56(sK59,sK60))
| ~ ssList(sK55(sK59,sK60)) ),
inference(demodulation,[status(thm)],[c_13902,c_4149]) ).
tcf(c_14010,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_13938,c_12114,c_6026,c_4168,c_4654,c_821,c_816,c_257,c_258]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC039+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.09/0.36 % Computer : n013.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Thu Sep 24 16:02:39 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.40 Running first-order theorem proving
% 0.09/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.09/0.41
% 0.09/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.41
% 0.09/0.41 % Detected problem language: tptp
% 0.09/0.42 % Proving...
% 3.74/1.19 % SZS status Started for theBenchmark.p
% 3.74/1.19 % SZS status Theorem for theBenchmark.p
% 3.74/1.19
% 3.74/1.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.74/1.19
% 3.74/1.19 % ------ iProver source info
% 3.74/1.19
% 3.74/1.19 % git: date: 2026-07-19 20:42:38 +0200
% 3.74/1.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.74/1.19 % git: non_committed_changes: false
% 3.74/1.19
% 3.74/1.19 % ------ Parsing...
% 3.74/1.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.74/1.19
% 3.74/1.19 % ------ Preprocessing... sup_sim: 0 pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sup_sim: 0 pe_s pe_e %
% 3.74/1.19
% 3.74/1.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e scvd_s sp: 0 0s scvd_e snvd_s sp: 0 0s snvd_e %
% 3.74/1.19
% 3.74/1.19 % ------ Preprocessing...
% 3.74/1.19 % ------ Proving...
% 3.74/1.19 % ------ Problem Properties
% 3.74/1.19
% 3.74/1.19 %
% 3.74/1.19 % clauses 189
% 3.74/1.19 % conjectures 50
% 3.74/1.19 % EPR 51
% 3.74/1.19 % Horn 121
% 3.74/1.19 % unary 23
% 3.74/1.19 % binary 40
% 3.74/1.19 % lits 631
% 3.74/1.19 % lits eq 81
% 3.74/1.19 % fd_pure 0
% 3.74/1.19 % fd_pseudo 0
% 3.74/1.19 % fd_cond 21
% 3.74/1.19 % fd_pseudo_cond 14
% 3.74/1.19 % AC symbols 0
% 3.74/1.19
% 3.74/1.19 % ------ Input Options Time Limit: Unbounded
% 3.74/1.19
% 3.74/1.19
% 3.74/1.19 % ------
% 3.74/1.19 % Current options:
% 3.74/1.19 % ------
% 3.74/1.19
% 3.74/1.19
% 3.74/1.19 %
% 3.74/1.19
% 3.74/1.19 % ------ Proving...
% 3.74/1.19 %
% 3.74/1.19
% 3.74/1.19 % SZS status Theorem for theBenchmark.p
% 3.74/1.19
% 3.74/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.74/1.19
% 3.74/1.19
%------------------------------------------------------------------------------