TSTP Solution File: SWC200+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SWC200+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:34 EDT 2024
% Result : Theorem 91.34s 13.20s
% Output : CNFRefutation 91.34s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named f588)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f37,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(cons(X1,X2),X0)
<=> ( memberP(X2,X0)
| X0 = X1 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax37) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax38) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ! [X5] :
( ssItem(X5)
=> ( X4 = X5
| ~ memberP(X0,X5) ) )
& ssItem(X4) )
| ~ singletonP(X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( ? [X4] :
( ! [X5] :
( ssItem(X5)
=> ( X4 = X5
| ~ memberP(X0,X5) ) )
& ssItem(X4) )
| ~ singletonP(X2)
| X0 != X2
| X1 != X3 ) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f1]) ).
fof(f100,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f147,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(cons(X1,X2),X0)
<=> ( memberP(X2,X0)
| X0 = X1 ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f37]) ).
fof(f148,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ? [X5] :
( X4 != X5
& memberP(X0,X5)
& ssItem(X5) )
| ~ ssItem(X4) )
& singletonP(X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ? [X5] :
( X4 != X5
& memberP(X0,X5)
& ssItem(X5) )
| ~ ssItem(X4) )
& singletonP(X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f232,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f98]) ).
fof(f241,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X1] :
( cons(X1,nil) = X0
& ssItem(X1) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f100]) ).
fof(f242,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f241]) ).
fof(f243,plain,
! [X0] :
( ? [X2] :
( cons(X2,nil) = X0
& ssItem(X2) )
=> ( cons(sK10(X0),nil) = X0
& ssItem(sK10(X0)) ) ),
introduced(choice_axiom,[]) ).
fof(f244,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( cons(X1,nil) != X0
| ~ ssItem(X1) ) )
& ( ( cons(sK10(X0),nil) = X0
& ssItem(sK10(X0)) )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10])],[f242,f243]) ).
fof(f324,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( ~ memberP(X2,X0)
& X0 != X1 ) )
& ( memberP(X2,X0)
| X0 = X1
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f147]) ).
fof(f325,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(cons(X1,X2),X0)
| ( ~ memberP(X2,X0)
& X0 != X1 ) )
& ( memberP(X2,X0)
| X0 = X1
| ~ memberP(cons(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f324]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ? [X5] :
( X4 != X5
& memberP(X0,X5)
& ssItem(X5) )
| ~ ssItem(X4) )
& singletonP(X2)
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ? [X5] :
( X4 != X5
& memberP(sK53,X5)
& ssItem(X5) )
| ~ ssItem(X4) )
& singletonP(X2)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ? [X5] :
( X4 != X5
& memberP(sK53,X5)
& ssItem(X5) )
| ~ ssItem(X4) )
& singletonP(X2)
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ! [X4] :
( ? [X5] :
( X4 != X5
& memberP(sK53,X5)
& ssItem(X5) )
| ~ ssItem(X4) )
& singletonP(X2)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ! [X4] :
( ? [X5] :
( X4 != X5
& memberP(sK53,X5)
& ssItem(X5) )
| ~ ssItem(X4) )
& singletonP(X2)
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ! [X4] :
( ? [X5] :
( X4 != X5
& memberP(sK53,X5)
& ssItem(X5) )
| ~ ssItem(X4) )
& singletonP(sK55)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ! [X4] :
( ? [X5] :
( X4 != X5
& memberP(sK53,X5)
& ssItem(X5) )
| ~ ssItem(X4) )
& singletonP(sK55)
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ! [X4] :
( ? [X5] :
( X4 != X5
& memberP(sK53,X5)
& ssItem(X5) )
| ~ ssItem(X4) )
& singletonP(sK55)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
! [X4] :
( ? [X5] :
( X4 != X5
& memberP(sK53,X5)
& ssItem(X5) )
=> ( sK57(X4) != X4
& memberP(sK53,sK57(X4))
& ssItem(sK57(X4)) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ! [X4] :
( ( sK57(X4) != X4
& memberP(sK53,sK57(X4))
& ssItem(sK57(X4)) )
| ~ ssItem(X4) )
& singletonP(sK55)
& sK53 = sK55
& sK54 = sK56
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57])],[f222,f347,f346,f345,f344,f343]) ).
fof(f350,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f232]) ).
fof(f358,plain,
! [X0] :
( ssItem(sK10(X0))
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f244]) ).
fof(f359,plain,
! [X0] :
( cons(sK10(X0),nil) = X0
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f244]) ).
fof(f441,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f468,plain,
! [X2,X0,X1] :
( memberP(X2,X0)
| X0 = X1
| ~ memberP(cons(X1,X2),X0)
| ~ ssList(X2)
| ~ ssItem(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f325]) ).
fof(f471,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f548,plain,
ssList(sK53),
inference(cnf_transformation,[],[f348]) ).
fof(f553,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f348]) ).
fof(f554,plain,
singletonP(sK55),
inference(cnf_transformation,[],[f348]) ).
fof(f555,plain,
! [X4] :
( ssItem(sK57(X4))
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f348]) ).
fof(f556,plain,
! [X4] :
( memberP(sK53,sK57(X4))
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f348]) ).
fof(f557,plain,
! [X4] :
( sK57(X4) != X4
| ~ ssItem(X4) ),
inference(cnf_transformation,[],[f348]) ).
fof(f558,plain,
! [X4] :
( memberP(sK55,sK57(X4))
| ~ ssItem(X4) ),
inference(definition_unfolding,[],[f556,f553]) ).
fof(f560,plain,
ssList(sK55),
inference(definition_unfolding,[],[f548,f553]) ).
cnf(c_49,plain,
( ~ ssItem(X0)
| ~ ssItem(X1)
| X0 = X1
| neq(X0,X1) ),
inference(cnf_transformation,[],[f350]) ).
cnf(c_50,plain,
( ~ neq(X0,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f588]) ).
cnf(c_59,plain,
( ~ ssList(X0)
| ~ singletonP(X0)
| cons(sK10(X0),nil) = X0 ),
inference(cnf_transformation,[],[f359]) ).
cnf(c_60,plain,
( ~ ssList(X0)
| ~ singletonP(X0)
| ssItem(sK10(X0)) ),
inference(cnf_transformation,[],[f358]) ).
cnf(c_141,plain,
ssList(nil),
inference(cnf_transformation,[],[f441]) ).
cnf(c_170,plain,
( ~ memberP(cons(X0,X1),X2)
| ~ ssItem(X0)
| ~ ssItem(X2)
| ~ ssList(X1)
| X0 = X2
| memberP(X1,X2) ),
inference(cnf_transformation,[],[f468]) ).
cnf(c_171,plain,
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f471]) ).
cnf(c_246,negated_conjecture,
( sK57(X0) != X0
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f557]) ).
cnf(c_247,negated_conjecture,
( ~ ssItem(X0)
| memberP(sK55,sK57(X0)) ),
inference(cnf_transformation,[],[f558]) ).
cnf(c_248,negated_conjecture,
( ~ ssItem(X0)
| ssItem(sK57(X0)) ),
inference(cnf_transformation,[],[f555]) ).
cnf(c_249,negated_conjecture,
singletonP(sK55),
inference(cnf_transformation,[],[f554]) ).
cnf(c_253,negated_conjecture,
ssList(sK55),
inference(cnf_transformation,[],[f560]) ).
cnf(c_435,plain,
( X0 != X1
| X2 != X1
| X2 = X0 ),
theory(equality) ).
cnf(c_439,plain,
( X0 != X1
| X2 != X3
| ~ memberP(X1,X3)
| memberP(X0,X2) ),
theory(equality) ).
cnf(c_487,plain,
( ~ ssList(sK55)
| ~ singletonP(sK55)
| ssItem(sK10(sK55)) ),
inference(instantiation,[status(thm)],[c_60]) ).
cnf(c_492,plain,
( ~ ssList(sK55)
| ~ singletonP(sK55)
| cons(sK10(sK55),nil) = sK55 ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_804,plain,
( sK57(sK10(sK55)) != sK10(sK55)
| ~ ssItem(sK10(sK55)) ),
inference(instantiation,[status(thm)],[c_246]) ).
cnf(c_805,plain,
( ~ ssItem(sK10(sK55))
| ssItem(sK57(sK10(sK55))) ),
inference(instantiation,[status(thm)],[c_248]) ).
cnf(c_806,plain,
( ~ ssItem(sK10(sK55))
| memberP(sK55,sK57(sK10(sK55))) ),
inference(instantiation,[status(thm)],[c_247]) ).
cnf(c_2057,plain,
( sK57(sK10(sK55)) != X0
| sK10(sK55) != X0
| sK57(sK10(sK55)) = sK10(sK55) ),
inference(instantiation,[status(thm)],[c_435]) ).
cnf(c_2075,plain,
( ~ ssItem(sK57(sK10(sK55)))
| ~ ssItem(X0)
| X0 = sK57(sK10(sK55))
| neq(X0,sK57(sK10(sK55))) ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_6775,plain,
( ~ ssItem(sK57(sK10(sK55)))
| sK57(sK10(sK55)) = sK57(sK10(sK55))
| neq(sK57(sK10(sK55)),sK57(sK10(sK55))) ),
inference(instantiation,[status(thm)],[c_2075]) ).
cnf(c_6777,plain,
( ~ neq(sK57(sK10(sK55)),sK57(sK10(sK55)))
| ~ ssItem(sK57(sK10(sK55))) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_9504,plain,
( sK57(sK10(sK55)) != sK57(sK10(sK55))
| sK10(sK55) != sK57(sK10(sK55))
| sK57(sK10(sK55)) = sK10(sK55) ),
inference(instantiation,[status(thm)],[c_2057]) ).
cnf(c_48153,plain,
( X0 != sK55
| X1 != sK57(X2)
| ~ memberP(sK55,sK57(X2))
| memberP(X0,X1) ),
inference(instantiation,[status(thm)],[c_439]) ).
cnf(c_51051,plain,
( ~ memberP(cons(X0,X1),sK57(X2))
| ~ ssItem(sK57(X2))
| ~ ssItem(X0)
| ~ ssList(X1)
| X0 = sK57(X2)
| memberP(X1,sK57(X2)) ),
inference(instantiation,[status(thm)],[c_170]) ).
cnf(c_51342,plain,
( sK57(X0) != sK57(X0)
| X1 != sK55
| ~ memberP(sK55,sK57(X0))
| memberP(X1,sK57(X0)) ),
inference(instantiation,[status(thm)],[c_48153]) ).
cnf(c_54812,plain,
( ~ memberP(cons(X0,X1),sK57(sK10(sK55)))
| ~ ssItem(sK57(sK10(sK55)))
| ~ ssItem(X0)
| ~ ssList(X1)
| X0 = sK57(sK10(sK55))
| memberP(X1,sK57(sK10(sK55))) ),
inference(instantiation,[status(thm)],[c_51051]) ).
cnf(c_56613,plain,
( cons(sK10(sK55),nil) != sK55
| sK57(X0) != sK57(X0)
| ~ memberP(sK55,sK57(X0))
| memberP(cons(sK10(sK55),nil),sK57(X0)) ),
inference(instantiation,[status(thm)],[c_51342]) ).
cnf(c_63517,plain,
( cons(sK10(sK55),nil) != sK55
| sK57(sK10(sK55)) != sK57(sK10(sK55))
| ~ memberP(sK55,sK57(sK10(sK55)))
| memberP(cons(sK10(sK55),nil),sK57(sK10(sK55))) ),
inference(instantiation,[status(thm)],[c_56613]) ).
cnf(c_66336,plain,
( ~ memberP(nil,sK57(X0))
| ~ ssItem(sK57(X0)) ),
inference(instantiation,[status(thm)],[c_171]) ).
cnf(c_124553,plain,
( ~ memberP(cons(sK10(sK55),nil),sK57(sK10(sK55)))
| ~ ssItem(sK57(sK10(sK55)))
| ~ ssItem(sK10(sK55))
| ~ ssList(nil)
| sK10(sK55) = sK57(sK10(sK55))
| memberP(nil,sK57(sK10(sK55))) ),
inference(instantiation,[status(thm)],[c_54812]) ).
cnf(c_148427,plain,
( ~ memberP(nil,sK57(sK10(sK55)))
| ~ ssItem(sK57(sK10(sK55))) ),
inference(instantiation,[status(thm)],[c_66336]) ).
cnf(c_148428,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_148427,c_124553,c_63517,c_9504,c_6777,c_6775,c_804,c_805,c_806,c_492,c_487,c_141,c_249,c_253]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SWC200+1 : TPTP v8.1.2. Released v2.4.0.
% 0.03/0.11 % Command : run_iprover %s %d THM
% 0.10/0.32 % Computer : n022.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Thu May 2 23:28:42 EDT 2024
% 0.10/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/0.43 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 91.34/13.20 % SZS status Started for theBenchmark.p
% 91.34/13.20 % SZS status Theorem for theBenchmark.p
% 91.34/13.20
% 91.34/13.20 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 91.34/13.20
% 91.34/13.20 ------ iProver source info
% 91.34/13.20
% 91.34/13.20 git: date: 2024-05-02 19:28:25 +0000
% 91.34/13.20 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 91.34/13.20 git: non_committed_changes: false
% 91.34/13.20
% 91.34/13.20 ------ Parsing...
% 91.34/13.20 ------ Clausification by vclausify_rel & Parsing by iProver...
% 91.34/13.20
% 91.34/13.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 1 0s sf_e
% 91.34/13.20
% 91.34/13.20 ------ Preprocessing...
% 91.34/13.20
% 91.34/13.20 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 91.34/13.20 ------ Proving...
% 91.34/13.20 ------ Problem Properties
% 91.34/13.20
% 91.34/13.20
% 91.34/13.20 clauses 199
% 91.34/13.20 conjectures 6
% 91.34/13.20 EPR 65
% 91.34/13.20 Horn 129
% 91.34/13.20 unary 19
% 91.34/13.20 binary 51
% 91.34/13.20 lits 660
% 91.34/13.20 lits eq 81
% 91.34/13.20 fd_pure 0
% 91.34/13.20 fd_pseudo 0
% 91.34/13.20 fd_cond 21
% 91.34/13.20 fd_pseudo_cond 16
% 91.34/13.20 AC symbols 0
% 91.34/13.20
% 91.34/13.20 ------ Input Options Time Limit: Unbounded
% 91.34/13.20
% 91.34/13.20
% 91.34/13.20 ------
% 91.34/13.20 Current options:
% 91.34/13.20 ------
% 91.34/13.20
% 91.34/13.20
% 91.34/13.20
% 91.34/13.20
% 91.34/13.20 ------ Proving...
% 91.34/13.20
% 91.34/13.20
% 91.34/13.20 % SZS status Theorem for theBenchmark.p
% 91.34/13.20
% 91.34/13.20 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 91.34/13.20
% 91.34/13.20
%------------------------------------------------------------------------------