%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC098+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 : n016.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:53 PM UTC 2026
% Result : Theorem 3.60s 1.48s
% Output : CNFRefutation 3.60s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 2
% Syntax : Number of formulae : 72 ( 18 unt; 1 def)
% Number of atoms : 309 ( 120 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 387 ( 156 ~; 158 |; 61 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 63 ( 0 sgn 47 !; 16 ?; 19 :)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X6] :
( ssItem(X6)
=> ( ? [X7] :
( leq(X6,X7)
& memberP(X3,X7)
& X6 != X7
& ssItem(X7) )
| ~ memberP(X3,X6)
| cons(X6,nil) != X2 ) ) )
| ( nil = X0
& nil = X1 )
| ? [X4] :
( memberP(X1,X4)
& ! [X5] :
( ssItem(X5)
=> ( X4 = X5
| ~ leq(X4,X5)
| ~ memberP(X1,X5) ) )
& cons(X4,nil) = X0
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( ( nil != X2
| nil != X3 )
& ! [X6] :
( ssItem(X6)
=> ( ? [X7] :
( leq(X6,X7)
& memberP(X3,X7)
& X6 != X7
& ssItem(X7) )
| ~ memberP(X3,X6)
| cons(X6,nil) != X2 ) ) )
| ( nil = X0
& nil = X1 )
| ? [X4] :
( memberP(X1,X4)
& ! [X5] :
( ssItem(X5)
=> ( X4 = X5
| ~ leq(X4,X5)
| ~ memberP(X1,X5) ) )
& cons(X4,nil) = X0
& ssItem(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f221,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( nil = X2
& nil = X3 )
| ? [X6] :
( ssItem(X6)
& ! [X7] :
( ~ leq(X6,X7)
| ~ memberP(X3,X7)
| X6 = X7
| ~ ssItem(X7) )
& memberP(X3,X6)
& cons(X6,nil) = X2 ) )
& ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ memberP(X1,X4)
| ? [X5] :
( ssItem(X5)
& X4 != X5
& leq(X4,X5)
& memberP(X1,X5) )
| cons(X4,nil) != X0
| ~ ssItem(X4) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ssList(X0)
& ? [X1] :
( ssList(X1)
& ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& ( ( nil = X2
& nil = X3 )
| ? [X6] :
( ssItem(X6)
& ! [X7] :
( ~ leq(X6,X7)
| ~ memberP(X3,X7)
| X6 = X7
| ~ ssItem(X7) )
& memberP(X3,X6)
& cons(X6,nil) = X2 ) )
& ( nil != X0
| nil != X1 )
& ! [X4] :
( ~ memberP(X1,X4)
| ? [X5] :
( ssItem(X5)
& X4 != X5
& leq(X4,X5)
& memberP(X1,X5) )
| cons(X4,nil) != X0
| ~ ssItem(X4) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ( ( nil = sK55
& nil = sK56 )
| ( ssItem(sK58)
& ! [X7] :
( ~ leq(sK58,X7)
| ~ memberP(sK56,X7)
| sK58 = X7
| ~ ssItem(X7) )
& memberP(sK56,sK58)
& sK55 = cons(sK58,nil) ) )
& ( nil != sK53
| nil != sK54 )
& ! [X4] :
( ~ memberP(sK54,X4)
| ( ssItem(sK57(X4))
& sK57(X4) != X4
& leq(X4,sK57(X4))
& memberP(sK54,sK57(X4)) )
| cons(X4,nil) != sK53
| ~ ssItem(X4) )
& sK53 = sK55
& sK54 = sK56 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X5,sK57(X4)),skolemize(X6,sK58)],[f222]) ).
fof(f500,plain,
( nil = sK55
| ssItem(sK58) ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
( nil = sK56
| ssItem(sK58) ),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
! [X7] :
( nil = sK55
| ~ leq(sK58,X7)
| ~ memberP(sK56,X7)
| sK58 = X7
| ~ ssItem(X7) ),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
! [X7] :
( nil = sK56
| ~ leq(sK58,X7)
| ~ memberP(sK56,X7)
| sK58 = X7
| ~ ssItem(X7) ),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
( nil = sK55
| memberP(sK56,sK58) ),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
( nil = sK56
| memberP(sK56,sK58) ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
( nil = sK55
| sK55 = cons(sK58,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
( nil = sK56
| sK55 = cons(sK58,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
( nil != sK53
| nil != sK54 ),
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
! [X4] :
( ~ memberP(sK54,X4)
| ssItem(sK57(X4))
| cons(X4,nil) != sK53
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f510,plain,
! [X4] :
( ~ memberP(sK54,X4)
| sK57(X4) != X4
| cons(X4,nil) != sK53
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f511,plain,
! [X4] :
( ~ memberP(sK54,X4)
| leq(X4,sK57(X4))
| cons(X4,nil) != sK53
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f512,plain,
! [X4] :
( ~ memberP(sK54,X4)
| memberP(sK54,sK57(X4))
| cons(X4,nil) != sK53
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f513,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f514,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f296]) ).
fof(f515,plain,
! [X4] :
( ~ memberP(sK56,X4)
| memberP(sK56,sK57(X4))
| cons(X4,nil) != sK55
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f512,f513,f514,f514]) ).
fof(f516,plain,
! [X4] :
( ~ memberP(sK56,X4)
| leq(X4,sK57(X4))
| cons(X4,nil) != sK55
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f511,f513,f514]) ).
fof(f517,plain,
! [X4] :
( ~ memberP(sK56,X4)
| sK57(X4) != X4
| cons(X4,nil) != sK55
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f510,f513,f514]) ).
fof(f518,plain,
! [X4] :
( ~ memberP(sK56,X4)
| ssItem(sK57(X4))
| cons(X4,nil) != sK55
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f509,f513,f514]) ).
fof(f519,plain,
( nil != sK55
| nil != sK56 ),
inference(definition_unfolding,[],[f508,f514,f513]) ).
tcf(c_246,negated_conjecture,
! [X0: $i] :
( memberP(sK56,sK57(X0))
| ~ ssItem(X0)
| ~ memberP(sK56,X0)
| ( cons(X0,nil) != sK55 ) ),
inference(cnf_transformation,[],[f515]) ).
tcf(c_247,negated_conjecture,
! [X0: $i] :
( leq(X0,sK57(X0))
| ~ ssItem(X0)
| ~ memberP(sK56,X0)
| ( cons(X0,nil) != sK55 ) ),
inference(cnf_transformation,[],[f516]) ).
tcf(c_248,negated_conjecture,
! [X0: $i] :
( ~ ssItem(X0)
| ~ memberP(sK56,X0)
| ( sK57(X0) != X0 )
| ( cons(X0,nil) != sK55 ) ),
inference(cnf_transformation,[],[f517]) ).
tcf(c_249,negated_conjecture,
! [X0: $i] :
( ssItem(sK57(X0))
| ~ ssItem(X0)
| ~ memberP(sK56,X0)
| ( cons(X0,nil) != sK55 ) ),
inference(cnf_transformation,[],[f518]) ).
tcf(c_250,negated_conjecture,
( ( nil != sK56 )
| ( nil != sK55 ) ),
inference(cnf_transformation,[],[f519]) ).
tcf(c_251,negated_conjecture,
( ( nil = sK56 )
| ( cons(sK58,nil) = sK55 ) ),
inference(cnf_transformation,[],[f507]) ).
tcf(c_252,negated_conjecture,
( ( nil = sK55 )
| ( cons(sK58,nil) = sK55 ) ),
inference(cnf_transformation,[],[f506]) ).
tcf(c_253,negated_conjecture,
( memberP(sK56,sK58)
| ( nil = sK56 ) ),
inference(cnf_transformation,[],[f505]) ).
tcf(c_254,negated_conjecture,
( memberP(sK56,sK58)
| ( nil = sK55 ) ),
inference(cnf_transformation,[],[f504]) ).
tcf(c_255,negated_conjecture,
! [X0: $i] :
( ( nil = sK56 )
| ( X0 = sK58 )
| ~ ssItem(X0)
| ~ leq(sK58,X0)
| ~ memberP(sK56,X0) ),
inference(cnf_transformation,[],[f503]) ).
tcf(c_256,negated_conjecture,
! [X0: $i] :
( ( nil = sK55 )
| ( X0 = sK58 )
| ~ ssItem(X0)
| ~ leq(sK58,X0)
| ~ memberP(sK56,X0) ),
inference(cnf_transformation,[],[f502]) ).
tcf(c_257,negated_conjecture,
( ssItem(sK58)
| ( nil = sK56 ) ),
inference(cnf_transformation,[],[f501]) ).
tcf(c_258,negated_conjecture,
( ssItem(sK58)
| ( nil = sK55 ) ),
inference(cnf_transformation,[],[f500]) ).
tcf(c_375,negated_conjecture,
ssItem(sK58),
inference(global_subsumption_just,[status(thm)],[c_258,c_258,c_257,c_250]) ).
tcf(c_377,negated_conjecture,
ssItem(sK58),
inference(global_subsumption_just,[status(thm)],[c_257,c_375]) ).
tcf(c_385,negated_conjecture,
memberP(sK56,sK58),
inference(global_subsumption_just,[status(thm)],[c_254,c_254,c_253,c_250]) ).
tcf(c_387,negated_conjecture,
memberP(sK56,sK58),
inference(global_subsumption_just,[status(thm)],[c_253,c_385]) ).
tcf(c_391,negated_conjecture,
cons(sK58,nil) = sK55,
inference(global_subsumption_just,[status(thm)],[c_252,c_252,c_251,c_250]) ).
tcf(c_393,negated_conjecture,
cons(sK58,nil) = sK55,
inference(global_subsumption_just,[status(thm)],[c_251,c_391]) ).
tcf(c_405,plain,
! [X0: $i] :
( ~ memberP(sK56,X0)
| ~ leq(sK58,X0)
| ~ ssItem(X0)
| ( X0 = sK58 ) ),
inference(global_subsumption_just,[status(thm)],[c_256,c_250,c_256,c_255]) ).
tcf(c_406,negated_conjecture,
! [X0: $i] :
( ( X0 = sK58 )
| ~ ssItem(X0)
| ~ leq(sK58,X0)
| ~ memberP(sK56,X0) ),
inference(renaming,[status(thm)],[c_405]) ).
tcf(c_408,plain,
! [X0: $i] :
( ~ memberP(sK56,X0)
| ~ leq(sK58,X0)
| ~ ssItem(X0)
| ( X0 = sK58 ) ),
inference(global_subsumption_just,[status(thm)],[c_255,c_406]) ).
tcf(c_409,negated_conjecture,
! [X0: $i] :
( ( X0 = sK58 )
| ~ ssItem(X0)
| ~ leq(sK58,X0)
| ~ memberP(sK56,X0) ),
inference(renaming,[status(thm)],[c_408]) ).
tcf(c_8987,definition,
iPr_def_10 = cons(sK58,nil),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_8988,negated_conjecture,
! [X0: $i] :
( ( X0 = sK58 )
| ~ ssItem(X0)
| ~ leq(sK58,X0)
| ~ memberP(sK56,X0) ),
inference(demodulation,[status(thm)],[c_409]) ).
tcf(c_8989,negated_conjecture,
iPr_def_10 = sK55,
inference(demodulation,[status(thm)],[c_393,c_8987]) ).
tcf(c_8990,negated_conjecture,
memberP(sK56,sK58),
inference(demodulation,[status(thm)],[c_387]) ).
tcf(c_8991,negated_conjecture,
ssItem(sK58),
inference(demodulation,[status(thm)],[c_377]) ).
tcf(c_8995,negated_conjecture,
! [X0: $i] :
( ssItem(sK57(X0))
| ~ ssItem(X0)
| ~ memberP(sK56,X0)
| ( cons(X0,nil) != sK55 ) ),
inference(demodulation,[status(thm)],[c_249]) ).
tcf(c_8996,negated_conjecture,
! [X0: $i] :
( ~ ssItem(X0)
| ~ memberP(sK56,X0)
| ( sK57(X0) != X0 )
| ( cons(X0,nil) != sK55 ) ),
inference(demodulation,[status(thm)],[c_248]) ).
tcf(c_8997,negated_conjecture,
! [X0: $i] :
( leq(X0,sK57(X0))
| ~ ssItem(X0)
| ~ memberP(sK56,X0)
| ( cons(X0,nil) != sK55 ) ),
inference(demodulation,[status(thm)],[c_247]) ).
tcf(c_8998,negated_conjecture,
! [X0: $i] :
( memberP(sK56,sK57(X0))
| ~ ssItem(X0)
| ~ memberP(sK56,X0)
| ( cons(X0,nil) != sK55 ) ),
inference(demodulation,[status(thm)],[c_246]) ).
tcf(c_11899,plain,
! [X0: $i] :
( ssItem(sK57(X0))
| ~ ssItem(X0)
| ~ memberP(sK56,X0)
| ( cons(X0,nil) != iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_8995,c_8989]) ).
tcf(c_11912,plain,
! [X0: $i] :
( leq(X0,sK57(X0))
| ~ ssItem(X0)
| ~ memberP(sK56,X0)
| ( cons(X0,nil) != iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_8997,c_8989]) ).
tcf(c_11925,plain,
! [X0: $i] :
( memberP(sK56,sK57(X0))
| ~ ssItem(X0)
| ~ memberP(sK56,X0)
| ( cons(X0,nil) != iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_8998,c_8989]) ).
tcf(c_11938,plain,
! [X0: $i] :
( ~ ssItem(X0)
| ~ memberP(sK56,X0)
| ( sK57(X0) != X0 )
| ( cons(X0,nil) != iPr_def_10 ) ),
inference(light_normalisation,[status(thm)],[c_8996,c_8989]) ).
tcf(c_11951,plain,
( ~ ssItem(sK58)
| ~ memberP(sK56,sK58)
| ( sK57(sK58) != sK58 ) ),
inference(superposition,[status(thm)],[c_8987,c_11938]) ).
tcf(c_11952,plain,
( memberP(sK56,sK57(sK58))
| ~ ssItem(sK58)
| ~ memberP(sK56,sK58) ),
inference(superposition,[status(thm)],[c_8987,c_11925]) ).
tcf(c_11953,plain,
( leq(sK58,sK57(sK58))
| ~ ssItem(sK58)
| ~ memberP(sK56,sK58) ),
inference(superposition,[status(thm)],[c_8987,c_11912]) ).
tcf(c_11954,plain,
( ssItem(sK57(sK58))
| ~ ssItem(sK58)
| ~ memberP(sK56,sK58) ),
inference(superposition,[status(thm)],[c_8987,c_11899]) ).
tcf(c_11955,plain,
ssItem(sK57(sK58)),
inference(forward_subsumption_resolution,[status(thm)],[c_11954,c_8991,c_8990]) ).
tcf(c_11956,plain,
leq(sK58,sK57(sK58)),
inference(forward_subsumption_resolution,[status(thm)],[c_11953,c_8991,c_8990]) ).
tcf(c_11957,plain,
memberP(sK56,sK57(sK58)),
inference(forward_subsumption_resolution,[status(thm)],[c_11952,c_8991,c_8990]) ).
tcf(c_11958,plain,
sK57(sK58) != sK58,
inference(forward_subsumption_resolution,[status(thm)],[c_11951,c_8991,c_8990]) ).
tcf(c_11967,plain,
( ( sK57(sK58) = sK58 )
| ~ ssItem(sK57(sK58))
| ~ leq(sK58,sK57(sK58)) ),
inference(superposition,[status(thm)],[c_11957,c_8988]) ).
tcf(c_11968,plain,
sK57(sK58) = sK58,
inference(forward_subsumption_resolution,[status(thm)],[c_11967,c_11955,c_11956]) ).
tcf(c_11972,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_11968,c_11958]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC098+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.56 % Computer : n016.cluster.edu
% 0.09/0.56 % Model : x86_64 x86_64
% 0.09/0.56 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.56 % Memory : 8046.5625MB
% 0.09/0.56 % OS : Linux 6.8.0-71-generic
% 0.09/0.56 % CPULimit : 300
% 0.09/0.56 % WCLimit : 300
% 0.09/0.56 % DateTime : Thu Sep 24 16:27:15 UTC 2026
% 0.09/0.57 % CPUTime :
% 0.09/0.57 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.60 Running first-order theorem proving
% 0.09/0.60 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.62
% 0.09/0.62 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.62
% 0.09/0.62 % Detected problem language: tptp
% 0.13/0.63 % Proving...
% 3.60/1.48 % SZS status Started for theBenchmark.p
% 3.60/1.48 % SZS status Theorem for theBenchmark.p
% 3.60/1.48
% 3.60/1.48 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.60/1.48
% 3.60/1.48 % ------ iProver source info
% 3.60/1.48
% 3.60/1.48 % git: date: 2026-07-19 20:42:38 +0200
% 3.60/1.48 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.60/1.48 % git: non_committed_changes: false
% 3.60/1.48
% 3.60/1.48 % ------ Parsing...
% 3.60/1.48 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.60/1.48
% 3.60/1.48 % ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 sf_s rm: 4 0s sf_e pe_s pe_e %
% 3.60/1.48
% 3.60/1.48 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.60/1.48
% 3.60/1.48 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.60/1.48 % ------ Proving...
% 3.60/1.48 % ------ Problem Properties
% 3.60/1.48
% 3.60/1.48 %
% 3.60/1.48 % clauses 192
% 3.60/1.48 % conjectures 11
% 3.60/1.48 % EPR 56
% 3.60/1.48 % Horn 124
% 3.60/1.48 % unary 22
% 3.60/1.48 % binary 41
% 3.60/1.48 % lits 646
% 3.60/1.48 % lits eq 88
% 3.60/1.48 % fd_pure 0
% 3.60/1.48 % fd_pseudo 0
% 3.60/1.48 % fd_cond 22
% 3.60/1.48 % fd_pseudo_cond 14
% 3.60/1.48 % AC symbols 0
% 3.60/1.48
% 3.60/1.48 % ------ Schedule dynamic 5 is on
% 3.60/1.48
% 3.60/1.48 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.60/1.48
% 3.60/1.48
% 3.60/1.48 % ------
% 3.60/1.48 % Current options:
% 3.60/1.48 % ------
% 3.60/1.48
% 3.60/1.48
% 3.60/1.48 %
% 3.60/1.48
% 3.60/1.48 % ------ Proving...
% 3.60/1.48 %
% 3.60/1.48
% 3.60/1.48 % SZS status Theorem for theBenchmark.p
% 3.60/1.48
% 3.60/1.48 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.60/1.49
% 3.60/1.49
%------------------------------------------------------------------------------