%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : SWC279+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 : n001.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:08 PM UTC 2026
% Result : Theorem 0.99s 6.29s
% Output : CNFRefutation 0.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 4
% Syntax : Number of formulae : 64 ( 25 unt; 3 def)
% Number of atoms : 316 ( 44 equ)
% Maximal formula atoms : 24 ( 4 avg)
% Number of connectives : 380 ( 152 ~; 151 |; 61 &)
% ( 0 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 25 ( 6 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; 4 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 9 con; 0-2 aty)
% Number of variables : 108 ( 0 sgn 84 !; 24 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ! [X11] :
( ssItem(X11)
=> ( ( leq(X8,X11)
| ~ memberP(X10,X11) )
& ( leq(X11,X8)
| ~ memberP(X9,X11) ) ) )
| app(app(X9,cons(X8,nil)),X10) != X0 ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( memberP(X5,X7)
& ~ leq(X7,X4) )
| ( memberP(X6,X7)
& ~ leq(X4,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6) )
& ssList(X5) )
& 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)
=> ( ! [X8] :
( ssItem(X8)
=> ! [X9] :
( ssList(X9)
=> ! [X10] :
( ssList(X10)
=> ( ! [X11] :
( ssItem(X11)
=> ( ( leq(X8,X11)
| ~ memberP(X10,X11) )
& ( leq(X11,X8)
| ~ memberP(X9,X11) ) ) )
| app(app(X9,cons(X8,nil)),X10) != X0 ) ) ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( ? [X7] :
( ( ( memberP(X5,X7)
& ~ leq(X7,X4) )
| ( memberP(X6,X7)
& ~ leq(X4,X7) ) )
& ssItem(X7) )
& app(app(X5,cons(X4,nil)),X6) = X2
& ssList(X6) )
& ssList(X5) )
& 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)
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ssItem(X11)
& ( ( ~ leq(X8,X11)
& memberP(X10,X11) )
| ( ~ leq(X11,X8)
& memberP(X9,X11) ) ) )
& app(app(X9,cons(X8,nil)),X10) = X0 ) ) )
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| leq(X7,X4) )
& ( ~ memberP(X6,X7)
| leq(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ 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)
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& ? [X10] :
( ssList(X10)
& ? [X11] :
( ssItem(X11)
& ( ( ~ leq(X8,X11)
& memberP(X10,X11) )
| ( ~ leq(X11,X8)
& memberP(X9,X11) ) ) )
& app(app(X9,cons(X8,nil)),X10) = X0 ) ) )
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| leq(X7,X4) )
& ( ~ memberP(X6,X7)
| leq(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != X2
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& X0 = X2
& X1 = X3 ) ) ) ),
inference(flattening,[],[f221]) ).
fof(f296,plain,
( ssList(sK53)
& ssList(sK54)
& ssList(sK55)
& ssList(sK56)
& ssItem(sK57)
& ssList(sK58)
& ssList(sK59)
& ssItem(sK60)
& ( ( ~ leq(sK57,sK60)
& memberP(sK59,sK60) )
| ( ~ leq(sK60,sK57)
& memberP(sK58,sK60) ) )
& sK53 = app(app(sK58,cons(sK57,nil)),sK59)
& ! [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ( ( ~ memberP(X5,X7)
| leq(X7,X4) )
& ( ~ memberP(X6,X7)
| leq(X4,X7) ) )
| ~ ssItem(X7) )
| app(app(X5,cons(X4,nil)),X6) != sK55
| ~ ssList(X6) )
| ~ ssList(X5) )
| ~ ssItem(X4) )
& sK53 = sK55
& sK54 = sK56 ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58,sK59,sK60]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X8,sK57),skolemize(X9,sK58),skolemize(X10,sK59),skolemize(X11,sK60)],[f222]) ).
fof(f500,plain,
ssItem(sK57),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
ssList(sK58),
inference(cnf_transformation,[],[f296]) ).
fof(f502,plain,
ssList(sK59),
inference(cnf_transformation,[],[f296]) ).
fof(f503,plain,
ssItem(sK60),
inference(cnf_transformation,[],[f296]) ).
fof(f504,plain,
( ~ leq(sK57,sK60)
| ~ leq(sK60,sK57) ),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
( memberP(sK59,sK60)
| ~ leq(sK60,sK57) ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
( ~ leq(sK57,sK60)
| memberP(sK58,sK60) ),
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
( memberP(sK59,sK60)
| memberP(sK58,sK60) ),
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
sK53 = app(app(sK58,cons(sK57,nil)),sK59),
inference(cnf_transformation,[],[f296]) ).
fof(f509,plain,
! [X6,X7,X4,X5] :
( ~ memberP(X5,X7)
| leq(X7,X4)
| ~ ssItem(X7)
| app(app(X5,cons(X4,nil)),X6) != sK55
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f510,plain,
! [X6,X7,X4,X5] :
( ~ memberP(X6,X7)
| leq(X4,X7)
| ~ ssItem(X7)
| app(app(X5,cons(X4,nil)),X6) != sK55
| ~ ssList(X6)
| ~ ssList(X5)
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f296]) ).
fof(f511,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f513,plain,
sK55 = app(app(sK58,cons(sK57,nil)),sK59),
inference(definition_unfolding,[],[f508,f511]) ).
tcf(c_246,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( leq(X1,X3)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ memberP(X2,X3)
| ( app(app(X0,cons(X1,nil)),X2) != sK55 ) ),
inference(cnf_transformation,[],[f510]) ).
tcf(c_247,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( leq(X3,X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ memberP(X0,X3)
| ( app(app(X0,cons(X1,nil)),X2) != sK55 ) ),
inference(cnf_transformation,[],[f509]) ).
tcf(c_248,negated_conjecture,
app(app(sK58,cons(sK57,nil)),sK59) = sK55,
inference(cnf_transformation,[],[f513]) ).
tcf(c_249,negated_conjecture,
( memberP(sK59,sK60)
| memberP(sK58,sK60) ),
inference(cnf_transformation,[],[f507]) ).
tcf(c_250,negated_conjecture,
( memberP(sK58,sK60)
| ~ leq(sK57,sK60) ),
inference(cnf_transformation,[],[f506]) ).
tcf(c_251,negated_conjecture,
( memberP(sK59,sK60)
| ~ leq(sK60,sK57) ),
inference(cnf_transformation,[],[f505]) ).
tcf(c_252,negated_conjecture,
( ~ leq(sK60,sK57)
| ~ leq(sK57,sK60) ),
inference(cnf_transformation,[],[f504]) ).
tcf(c_253,negated_conjecture,
ssItem(sK60),
inference(cnf_transformation,[],[f503]) ).
tcf(c_254,negated_conjecture,
ssList(sK59),
inference(cnf_transformation,[],[f502]) ).
tcf(c_255,negated_conjecture,
ssList(sK58),
inference(cnf_transformation,[],[f501]) ).
tcf(c_256,negated_conjecture,
ssItem(sK57),
inference(cnf_transformation,[],[f500]) ).
tcf(c_8970,definition,
iPr_def_10 = cons(sK57,nil),
introduced(definition,[new_symbols(definition,[iPr_def_10])],[]) ).
tcf(c_8971,definition,
iPr_def_11 = app(sK58,iPr_def_10),
introduced(definition,[new_symbols(definition,[iPr_def_11])],[]) ).
tcf(c_8972,definition,
iPr_def_12 = app(iPr_def_11,sK59),
introduced(definition,[new_symbols(definition,[iPr_def_12])],[]) ).
tcf(c_8975,negated_conjecture,
ssItem(sK57),
inference(demodulation,[status(thm)],[c_256]) ).
tcf(c_8976,negated_conjecture,
ssList(sK58),
inference(demodulation,[status(thm)],[c_255]) ).
tcf(c_8977,negated_conjecture,
ssList(sK59),
inference(demodulation,[status(thm)],[c_254]) ).
tcf(c_8978,negated_conjecture,
ssItem(sK60),
inference(demodulation,[status(thm)],[c_253]) ).
tcf(c_8980,negated_conjecture,
( memberP(sK59,sK60)
| ~ leq(sK60,sK57) ),
inference(demodulation,[status(thm)],[c_251]) ).
tcf(c_8982,negated_conjecture,
( memberP(sK59,sK60)
| memberP(sK58,sK60) ),
inference(demodulation,[status(thm)],[c_249]) ).
tcf(c_8983,negated_conjecture,
iPr_def_12 = sK55,
inference(demodulation,[status(thm)],[c_248,c_8970,c_8971,c_8972]) ).
tcf(c_8984,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( leq(X3,X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ memberP(X0,X3)
| ( app(app(X0,cons(X1,nil)),X2) != sK55 ) ),
inference(demodulation,[status(thm)],[c_247]) ).
tcf(c_8985,negated_conjecture,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( leq(X1,X3)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ memberP(X2,X3)
| ( app(app(X0,cons(X1,nil)),X2) != sK55 ) ),
inference(demodulation,[status(thm)],[c_246]) ).
tcf(c_11904,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( leq(X3,X1)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ memberP(X0,X3)
| ( app(app(X0,cons(X1,nil)),X2) != iPr_def_12 ) ),
inference(light_normalisation,[status(thm)],[c_8984,c_8983]) ).
tcf(c_11926,plain,
! [X0: $i,X1: $i,X2: $i,X3: $i] :
( leq(X1,X3)
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssItem(X3)
| ~ ssItem(X1)
| ~ memberP(X2,X3)
| ( app(app(X0,cons(X1,nil)),X2) != iPr_def_12 ) ),
inference(light_normalisation,[status(thm)],[c_8985,c_8983]) ).
tcf(c_11948,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(sK57,X2)
| ~ ssItem(sK57)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| ( app(app(X0,iPr_def_10),X1) != iPr_def_12 ) ),
inference(superposition,[status(thm)],[c_8970,c_11926]) ).
tcf(c_11949,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X2,sK57)
| ~ ssItem(sK57)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssItem(X2)
| ~ memberP(X0,X2)
| ( app(app(X0,iPr_def_10),X1) != iPr_def_12 ) ),
inference(superposition,[status(thm)],[c_8970,c_11904]) ).
tcf(c_11950,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(X2,sK57)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssItem(X2)
| ~ memberP(X0,X2)
| ( app(app(X0,iPr_def_10),X1) != iPr_def_12 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11949,c_8975]) ).
tcf(c_11957,plain,
! [X0: $i,X1: $i,X2: $i] :
( leq(sK57,X2)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ ssItem(X2)
| ~ memberP(X1,X2)
| ( app(app(X0,iPr_def_10),X1) != iPr_def_12 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11948,c_8975]) ).
tcf(c_12028,plain,
! [X0: $i,X1: $i] :
( leq(sK57,X1)
| ~ ssList(sK58)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ memberP(X0,X1)
| ( app(iPr_def_11,X0) != iPr_def_12 ) ),
inference(superposition,[status(thm)],[c_8971,c_11957]) ).
tcf(c_12029,plain,
! [X0: $i,X1: $i] :
( leq(X1,sK57)
| ~ ssList(sK58)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ memberP(sK58,X1)
| ( app(iPr_def_11,X0) != iPr_def_12 ) ),
inference(superposition,[status(thm)],[c_8971,c_11950]) ).
tcf(c_12030,plain,
! [X0: $i,X1: $i] :
( leq(X1,sK57)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ memberP(sK58,X1)
| ( app(iPr_def_11,X0) != iPr_def_12 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_12029,c_8976]) ).
tcf(c_12036,plain,
! [X0: $i,X1: $i] :
( leq(sK57,X1)
| ~ ssList(X0)
| ~ ssItem(X1)
| ~ memberP(X0,X1)
| ( app(iPr_def_11,X0) != iPr_def_12 ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_12028,c_8976]) ).
tcf(c_12115,plain,
! [X0: $i] :
( leq(sK57,X0)
| ~ ssList(sK59)
| ~ ssItem(X0)
| ~ memberP(sK59,X0) ),
inference(superposition,[status(thm)],[c_8972,c_12036]) ).
tcf(c_12116,plain,
! [X0: $i] :
( leq(X0,sK57)
| ~ ssList(sK59)
| ~ ssItem(X0)
| ~ memberP(sK58,X0) ),
inference(superposition,[status(thm)],[c_8972,c_12030]) ).
tcf(c_12117,plain,
! [X0: $i] :
( leq(X0,sK57)
| ~ ssItem(X0)
| ~ memberP(sK58,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_12116,c_8977]) ).
tcf(c_12121,plain,
! [X0: $i] :
( leq(sK57,X0)
| ~ ssItem(X0)
| ~ memberP(sK59,X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_12115,c_8977]) ).
tcf(c_12169,plain,
( leq(sK57,sK60)
| memberP(sK58,sK60)
| ~ ssItem(sK60) ),
inference(superposition,[status(thm)],[c_8982,c_12121]) ).
tcf(c_12170,plain,
( leq(sK57,sK60)
| memberP(sK58,sK60) ),
inference(forward_subsumption_resolution,[status(thm)],[c_12169,c_8978]) ).
tcf(c_12173,plain,
memberP(sK58,sK60),
inference(global_subsumption_just,[status(thm)],[c_12170,c_250,c_12170]) ).
tcf(c_12175,plain,
( leq(sK60,sK57)
| ~ ssItem(sK60) ),
inference(superposition,[status(thm)],[c_12173,c_12117]) ).
tcf(c_12176,plain,
leq(sK60,sK57),
inference(forward_subsumption_resolution,[status(thm)],[c_12175,c_8978]) ).
tcf(c_12178,plain,
memberP(sK59,sK60),
inference(backward_subsumption_resolution,[status(thm)],[c_8980,c_12176]) ).
tcf(c_12179,plain,
( leq(sK57,sK60)
| ~ ssItem(sK60) ),
inference(superposition,[status(thm)],[c_12178,c_12121]) ).
tcf(c_12180,plain,
leq(sK57,sK60),
inference(forward_subsumption_resolution,[status(thm)],[c_12179,c_8978]) ).
tcf(c_12181,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_12180,c_12176,c_252]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC279+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/5.38 % Computer : n001.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Thu Sep 24 17:28:28 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.42 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.15/5.43
% 0.15/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.43
% 0.15/5.43 % Detected problem language: tptp
% 0.15/5.44 % Proving...
% 0.99/6.29 % SZS status Started for theBenchmark.p
% 0.99/6.29 % SZS status Theorem for theBenchmark.p
% 0.99/6.29
% 0.99/6.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.99/6.29
% 0.99/6.29 % ------ iProver source info
% 0.99/6.29
% 0.99/6.29 % git: date: 2026-07-19 20:42:38 +0200
% 0.99/6.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.99/6.29 % git: non_committed_changes: false
% 0.99/6.29
% 0.99/6.29 % ------ Parsing...
% 0.99/6.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.99/6.29
% 0.99/6.29 % ------ 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 %
% 0.99/6.29
% 0.99/6.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.99/6.29
% 0.99/6.29 % ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 0.99/6.29 % ------ Proving...
% 0.99/6.29 % ------ Problem Properties
% 0.99/6.29
% 0.99/6.29 %
% 0.99/6.29 % clauses 196
% 0.99/6.29 % conjectures 13
% 0.99/6.29 % EPR 60
% 0.99/6.29 % Horn 127
% 0.99/6.29 % unary 26
% 0.99/6.29 % binary 44
% 0.99/6.29 % lits 650
% 0.99/6.29 % lits eq 84
% 0.99/6.29 % fd_pure 0
% 0.99/6.29 % fd_pseudo 0
% 0.99/6.29 % fd_cond 21
% 0.99/6.29 % fd_pseudo_cond 14
% 0.99/6.29 % AC symbols 0
% 0.99/6.29
% 0.99/6.29 % ------ Schedule dynamic 5 is on
% 0.99/6.29
% 0.99/6.29 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 0.99/6.29
% 0.99/6.29
% 0.99/6.29 % ------
% 0.99/6.29 % Current options:
% 0.99/6.29 % ------
% 0.99/6.29
% 0.99/6.29
% 0.99/6.29 %
% 0.99/6.29
% 0.99/6.29 % ------ Proving...
% 0.99/6.29 %
% 0.99/6.29
% 0.99/6.29 % SZS status Theorem for theBenchmark.p
% 0.99/6.29
% 0.99/6.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.99/6.29
% 0.99/6.29
%------------------------------------------------------------------------------