TSTP Solution File: SWC213+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC213+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n025.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:11:37 EDT 2024
% Result : Theorem 0.64s 1.09s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f598)
% Comments :
%------------------------------------------------------------------------------
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax17) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ( nil = X2
& nil != X3 )
| neq(X0,nil)
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X9] :
( ? [X10] :
( ? [X11] :
( app(X11,cons(X9,nil)) = X2
& ssList(X11) )
& app(cons(X9,nil),X10) = X5
& ssList(X10) )
& ssItem(X9) )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( app(cons(X6,nil),X8) = X2
& ssList(X8) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) )
& ssItem(X6) )
| ~ equalelemsP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| ~ neq(X1,nil)
| 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 )
| neq(X0,nil)
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X9] :
( ? [X10] :
( ? [X11] :
( app(X11,cons(X9,nil)) = X2
& ssList(X11) )
& app(cons(X9,nil),X10) = X5
& ssList(X10) )
& ssItem(X9) )
| ? [X6] :
( ? [X7] :
( ? [X8] :
( app(cons(X6,nil),X8) = X2
& ssList(X8) )
& app(X7,cons(X6,nil)) = X4
& ssList(X7) )
& ssItem(X6) )
| ~ equalelemsP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| ~ neq(X1,nil)
| 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 )
| neq(X0,nil)
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( ? [X6] :
( ? [X7] :
( ? [X8] :
( app(X8,cons(X6,nil)) = X2
& ssList(X8) )
& app(cons(X6,nil),X7) = X5
& ssList(X7) )
& ssItem(X6) )
| ? [X9] :
( ? [X10] :
( ? [X11] :
( app(cons(X9,nil),X11) = X2
& ssList(X11) )
& app(X10,cons(X9,nil)) = X4
& ssList(X10) )
& ssItem(X9) )
| ~ equalelemsP(X2)
| app(app(X4,X2),X5) != X3 ) ) )
| ~ neq(X1,nil)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ neq(X0,nil)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& neq(X1,nil)
& 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 )
& ~ neq(X0,nil)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f222]) ).
fof(f317,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f119]) ).
fof(f344,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ neq(X0,nil)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& neq(X1,nil)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ neq(sK53,nil)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& neq(X1,nil)
& 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 )
& ~ neq(sK53,nil)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& neq(X1,nil)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ neq(sK53,nil)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X2] :
( ? [X3] :
( ( nil != X2
| nil = X3 )
& ~ neq(sK53,nil)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != X2
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != X2
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(X2)
& app(app(X4,X2),X5) = X3
& ssList(X5) )
& ssList(X4) )
& neq(sK54,nil)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ( nil != sK55
| nil = X3 )
& ~ neq(sK53,nil)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK55
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK55
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK55)
& app(app(X4,sK55),X5) = X3
& ssList(X5) )
& ssList(X4) )
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X3] :
( ( nil != sK55
| nil = X3 )
& ~ neq(sK53,nil)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK55
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK55
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK55)
& app(app(X4,sK55),X5) = X3
& ssList(X5) )
& ssList(X4) )
& neq(sK54,nil)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ( nil != sK55
| nil = sK56 )
& ~ neq(sK53,nil)
& ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK55
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK55
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK55)
& app(app(X4,sK55),X5) = sK56
& ssList(X5) )
& ssList(X4) )
& neq(sK54,nil)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X4] :
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK55
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK55
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != X4
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK55)
& app(app(X4,sK55),X5) = sK56
& ssList(X5) )
& ssList(X4) )
=> ( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK55
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK55
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != sK57
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK55)
& sK56 = app(app(sK57,sK55),X5)
& ssList(X5) )
& ssList(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ? [X5] :
( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK55
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != X5
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK55
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != sK57
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK55)
& sK56 = app(app(sK57,sK55),X5)
& ssList(X5) )
=> ( ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK55
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != sK58
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK55
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != sK57
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK55)
& sK56 = app(app(sK57,sK55),sK58)
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
( ( nil != sK55
| nil = sK56 )
& ~ neq(sK53,nil)
& ! [X6] :
( ! [X7] :
( ! [X8] :
( app(X8,cons(X6,nil)) != sK55
| ~ ssList(X8) )
| app(cons(X6,nil),X7) != sK58
| ~ ssList(X7) )
| ~ ssItem(X6) )
& ! [X9] :
( ! [X10] :
( ! [X11] :
( app(cons(X9,nil),X11) != sK55
| ~ ssList(X11) )
| app(X10,cons(X9,nil)) != sK57
| ~ ssList(X10) )
| ~ ssItem(X9) )
& equalelemsP(sK55)
& sK56 = app(app(sK57,sK55),sK58)
& ssList(sK58)
& ssList(sK57)
& neq(sK54,nil)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57,sK58])],[f223,f349,f348,f347,f346,f345,f344]) ).
fof(f441,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f317]) ).
fof(f443,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f550,plain,
ssList(sK53),
inference(cnf_transformation,[],[f350]) ).
fof(f554,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f350]) ).
fof(f555,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f350]) ).
fof(f556,plain,
neq(sK54,nil),
inference(cnf_transformation,[],[f350]) ).
fof(f563,plain,
~ neq(sK53,nil),
inference(cnf_transformation,[],[f350]) ).
fof(f564,plain,
( nil != sK55
| nil = sK56 ),
inference(cnf_transformation,[],[f350]) ).
fof(f565,plain,
~ neq(sK55,nil),
inference(definition_unfolding,[],[f563,f555]) ).
fof(f566,plain,
neq(sK56,nil),
inference(definition_unfolding,[],[f556,f554]) ).
fof(f568,plain,
ssList(sK55),
inference(definition_unfolding,[],[f550,f555]) ).
cnf(c_138,plain,
( ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f441]) ).
cnf(c_139,plain,
( ~ neq(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f598]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f443]) ).
cnf(c_246,negated_conjecture,
( nil != sK55
| nil = sK56 ),
inference(cnf_transformation,[],[f564]) ).
cnf(c_247,negated_conjecture,
~ neq(sK55,nil),
inference(cnf_transformation,[],[f565]) ).
cnf(c_254,negated_conjecture,
neq(sK56,nil),
inference(cnf_transformation,[],[f566]) ).
cnf(c_258,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f568]) ).
cnf(c_3260,plain,
( X0 != sK55
| X1 != nil
| ~ ssList(X0)
| ~ ssList(X1)
| X0 = X1 ),
inference(resolution_lifted,[status(thm)],[c_138,c_247]) ).
cnf(c_3261,plain,
( ~ ssList(nil)
| ~ ssList(sK55)
| sK55 = nil ),
inference(unflattening,[status(thm)],[c_3260]) ).
cnf(c_3262,plain,
sK55 = nil,
inference(global_subsumption_just,[status(thm)],[c_3261,c_258,c_141,c_3261]) ).
cnf(c_3269,plain,
( X0 != nil
| X0 != sK56
| ~ ssList(X0) ),
inference(resolution_lifted,[status(thm)],[c_139,c_254]) ).
cnf(c_3270,plain,
( nil != sK56
| ~ ssList(nil) ),
inference(unflattening,[status(thm)],[c_3269]) ).
cnf(c_3271,plain,
nil != sK56,
inference(global_subsumption_just,[status(thm)],[c_3270,c_141,c_3270]) ).
cnf(c_3286,plain,
nil != sK55,
inference(backward_subsumption_resolution,[status(thm)],[c_246,c_3271]) ).
cnf(c_6149,plain,
nil != nil,
inference(demodulation,[status(thm)],[c_3286,c_3262]) ).
cnf(c_6150,plain,
$false,
inference(equality_resolution_simp,[status(thm)],[c_6149]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : SWC213+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.10 % Command : run_iprover %s %d THM
% 0.10/0.30 % Computer : n025.cluster.edu
% 0.10/0.30 % Model : x86_64 x86_64
% 0.10/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30 % Memory : 8042.1875MB
% 0.10/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30 % CPULimit : 300
% 0.10/0.30 % WCLimit : 300
% 0.10/0.30 % DateTime : Thu May 2 23:44:28 EDT 2024
% 0.10/0.30 % CPUTime :
% 0.15/0.40 Running first-order theorem proving
% 0.15/0.40 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
% 0.64/1.09 % SZS status Started for theBenchmark.p
% 0.64/1.09 % SZS status Theorem for theBenchmark.p
% 0.64/1.09
% 0.64/1.09 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.64/1.09
% 0.64/1.09 ------ iProver source info
% 0.64/1.09
% 0.64/1.09 git: date: 2024-05-02 19:28:25 +0000
% 0.64/1.09 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.64/1.09 git: non_committed_changes: false
% 0.64/1.09
% 0.64/1.09 ------ Parsing...
% 0.64/1.09 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.64/1.09
% 0.64/1.09 ------ Preprocessing... sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e
% 0.64/1.09
% 0.64/1.09 % SZS status Theorem for theBenchmark.p
% 0.64/1.09
% 0.64/1.09 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.64/1.09
% 0.64/1.09
%------------------------------------------------------------------------------