TSTP Solution File: SWC009+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC009+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri May 3 03:10:51 EDT 2024
% Result : Theorem 3.94s 1.16s
% Output : CNFRefutation 3.94s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| ! [X7] :
( ssList(X7)
=> ( ? [X8] :
( ? [X9] :
( ? [X10] :
( ? [X11] :
( lt(X10,X8)
& app(X11,cons(X10,nil)) = X2
& ssList(X11) )
& ssItem(X10) )
& app(cons(X8,nil),X9) = X7
& ssList(X9) )
& ssItem(X8) )
| ~ strictorderedP(X2)
| app(X2,X7) != X3 ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(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 )
| ! [X7] :
( ssList(X7)
=> ( ? [X8] :
( ? [X9] :
( ? [X10] :
( ? [X11] :
( lt(X10,X8)
& app(X11,cons(X10,nil)) = X2
& ssList(X11) )
& ssItem(X10) )
& app(cons(X8,nil),X9) = X7
& ssList(X9) )
& ssItem(X8) )
| ~ strictorderedP(X2)
| app(X2,X7) != X3 ) )
| ? [X4] :
( ? [X5] :
( ? [X6] :
( app(X4,X6) = X0
& app(app(X4,X5),X6) = X1
& ssList(X6) )
& ssList(X5) )
& ssList(X4) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| ! [X4] :
( ssList(X4)
=> ( ? [X5] :
( ? [X6] :
( ? [X7] :
( ? [X8] :
( lt(X7,X5)
& app(X8,cons(X7,nil)) = X2
& ssList(X8) )
& ssItem(X7) )
& app(cons(X5,nil),X6) = X4
& ssList(X6) )
& ssItem(X5) )
| ~ strictorderedP(X2)
| app(X2,X4) != X3 ) )
| ? [X9] :
( ? [X10] :
( ? [X11] :
( app(X9,X11) = X0
& app(app(X9,X10),X11) = X1
& ssList(X11) )
& ssList(X10) )
& ssList(X9) )
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f202,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != X0
| app(app(X9,X10),X11) != X1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f223,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != X0
| app(app(X9,X10),X11) != X1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f344,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != X0
| app(app(X9,X10),X11) != X1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK53
| app(app(X9,X10),X11) != X1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK53
| app(app(X9,X10),X11) != X1
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK53
| app(app(X9,X10),X11) != sK54
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != X2
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(X2)
& app(X2,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK53
| app(app(X9,X10),X11) != sK54
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK55
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK55
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK55)
& app(sK55,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK53
| app(app(X9,X10),X11) != sK54
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X3] :
( ( nil != sK55
| nil = X3 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK55
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK55)
& app(sK55,X4) = X3
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK53
| app(app(X9,X10),X11) != sK54
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( nil != sK55
| nil = sK56 )
& ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK55
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK55)
& app(sK55,X4) = sK56
& ssList(X4) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK53
| app(app(X9,X10),X11) != sK54
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X4] :
( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK55
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != X4
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK55)
& app(sK55,X4) = sK56
& ssList(X4) )
=> ( ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK55
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK57
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK55)
& sK56 = app(sK55,sK57)
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ( nil != sK55
| nil = sK56 )
& ! [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( ~ lt(X7,X5)
| app(X8,cons(X7,nil)) != sK55
| ~ ssList(X8) )
| ~ ssItem(X7) )
| app(cons(X5,nil),X6) != sK57
| ~ ssList(X6) )
| ~ ssItem(X5) )
& strictorderedP(sK55)
& sK56 = app(sK55,sK57)
& ssList(sK57)
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(X9,X11) != sK53
| app(app(X9,X10),X11) != sK54
| ~ ssList(X11) )
| ~ ssList(X10) )
| ~ ssList(X9) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57])],[f223,f348,f347,f346,f345,f344]) ).
fof(f442,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f535,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f202]) ).
fof(f549,plain,
ssList(sK53),
inference(cnf_transformation,[],[f349]) ).
fof(f550,plain,
ssList(sK54),
inference(cnf_transformation,[],[f349]) ).
fof(f553,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f349]) ).
fof(f554,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f349]) ).
fof(f555,plain,
! [X10,X11,X9] :
( app(X9,X11) != sK53
| app(app(X9,X10),X11) != sK54
| ~ ssList(X11)
| ~ ssList(X10)
| ~ ssList(X9) ),
inference(cnf_transformation,[],[f349]) ).
fof(f556,plain,
ssList(sK57),
inference(cnf_transformation,[],[f349]) ).
fof(f557,plain,
sK56 = app(sK55,sK57),
inference(cnf_transformation,[],[f349]) ).
fof(f561,plain,
! [X10,X11,X9] :
( app(X9,X11) != sK55
| app(app(X9,X10),X11) != sK56
| ~ ssList(X11)
| ~ ssList(X10)
| ~ ssList(X9) ),
inference(definition_unfolding,[],[f555,f554,f553]) ).
fof(f562,plain,
ssList(sK56),
inference(definition_unfolding,[],[f550,f553]) ).
fof(f563,plain,
ssList(sK55),
inference(definition_unfolding,[],[f549,f554]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f442]) ).
cnf(c_232,plain,
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f535]) ).
cnf(c_249,negated_conjecture,
app(sK55,sK57) = sK56,
inference(cnf_transformation,[],[f557]) ).
cnf(c_250,negated_conjecture,
ssList(sK57),
inference(cnf_transformation,[],[f556]) ).
cnf(c_251,negated_conjecture,
( app(app(X0,X1),X2) != sK56
| app(X0,X2) != sK55
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(cnf_transformation,[],[f561]) ).
cnf(c_254,negated_conjecture,
ssList(sK56),
inference(cnf_transformation,[],[f562]) ).
cnf(c_255,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f563]) ).
cnf(c_8894,plain,
app(sK55,sK57) = sP0_iProver_def,
definition ).
cnf(c_8895,negated_conjecture,
ssList(sK55),
inference(demodulation,[status(thm)],[c_255]) ).
cnf(c_8896,negated_conjecture,
ssList(sK56),
inference(demodulation,[status(thm)],[c_254]) ).
cnf(c_8897,negated_conjecture,
( app(app(X0,X1),X2) != sK56
| app(X0,X2) != sK55
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(demodulation,[status(thm)],[c_251]) ).
cnf(c_8898,negated_conjecture,
ssList(sK57),
inference(demodulation,[status(thm)],[c_250]) ).
cnf(c_8899,negated_conjecture,
sP0_iProver_def = sK56,
inference(demodulation,[status(thm)],[c_249,c_8894]) ).
cnf(c_11754,plain,
ssList(sP0_iProver_def),
inference(light_normalisation,[status(thm)],[c_8896,c_8899]) ).
cnf(c_11758,plain,
( app(app(X0,X1),X2) != sP0_iProver_def
| app(X0,X2) != sK55
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2) ),
inference(light_normalisation,[status(thm)],[c_8897,c_8899]) ).
cnf(c_11805,plain,
( app(sK55,X0) != sK55
| app(sP0_iProver_def,X0) != sP0_iProver_def
| ~ ssList(X0)
| ~ ssList(sK55)
| ~ ssList(sK57) ),
inference(superposition,[status(thm)],[c_8894,c_11758]) ).
cnf(c_11806,plain,
( app(sK55,X0) != sK55
| app(sP0_iProver_def,X0) != sP0_iProver_def
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[status(thm)],[c_11805,c_8898,c_8895]) ).
cnf(c_11810,plain,
( app(sK55,nil) != sK55
| app(sP0_iProver_def,nil) != sP0_iProver_def
| ~ ssList(nil) ),
inference(instantiation,[status(thm)],[c_11806]) ).
cnf(c_12263,plain,
app(sK55,nil) = sK55,
inference(superposition,[status(thm)],[c_8895,c_232]) ).
cnf(c_12264,plain,
app(sP0_iProver_def,nil) = sP0_iProver_def,
inference(superposition,[status(thm)],[c_11754,c_232]) ).
cnf(c_12316,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_12263,c_12264,c_11810,c_141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SWC009+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.14 % Command : run_iprover %s %d THM
% 0.13/0.36 % Computer : n026.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Thu May 2 23:47:51 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.94/1.16 % SZS status Started for theBenchmark.p
% 3.94/1.16 % SZS status Theorem for theBenchmark.p
% 3.94/1.16
% 3.94/1.16 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 3.94/1.16
% 3.94/1.16 ------ iProver source info
% 3.94/1.16
% 3.94/1.16 git: date: 2024-05-02 19:28:25 +0000
% 3.94/1.16 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 3.94/1.16 git: non_committed_changes: false
% 3.94/1.16
% 3.94/1.16 ------ Parsing...
% 3.94/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.94/1.16
% 3.94/1.16 ------ 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.94/1.16
% 3.94/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.94/1.16
% 3.94/1.16 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.94/1.16 ------ Proving...
% 3.94/1.16 ------ Problem Properties
% 3.94/1.16
% 3.94/1.16
% 3.94/1.16 clauses 189
% 3.94/1.16 conjectures 8
% 3.94/1.16 EPR 55
% 3.94/1.16 Horn 121
% 3.94/1.16 unary 22
% 3.94/1.16 binary 41
% 3.94/1.16 lits 638
% 3.94/1.16 lits eq 86
% 3.94/1.16 fd_pure 0
% 3.94/1.16 fd_pseudo 0
% 3.94/1.16 fd_cond 21
% 3.94/1.16 fd_pseudo_cond 14
% 3.94/1.16 AC symbols 0
% 3.94/1.16
% 3.94/1.16 ------ Schedule dynamic 5 is on
% 3.94/1.16
% 3.94/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.94/1.16
% 3.94/1.16
% 3.94/1.16 ------
% 3.94/1.16 Current options:
% 3.94/1.16 ------
% 3.94/1.16
% 3.94/1.16
% 3.94/1.16
% 3.94/1.16
% 3.94/1.16 ------ Proving...
% 3.94/1.16
% 3.94/1.16
% 3.94/1.16 % SZS status Theorem for theBenchmark.p
% 3.94/1.16
% 3.94/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.94/1.16
% 3.94/1.16
%------------------------------------------------------------------------------