TSTP Solution File: SWC378+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SWC378+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n027.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 : Thu Aug 31 20:42:58 EDT 2023
% Result : Theorem 4.02s 1.16s
% Output : CNFRefutation 4.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of formulae : 58 ( 15 unt; 0 def)
% Number of atoms : 376 ( 68 equ)
% Maximal formula atoms : 30 ( 6 avg)
% Number of connectives : 476 ( 158 ~; 162 |; 132 &)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 6 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 118 ( 0 sgn; 42 !; 52 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f36,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax36) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X6] :
( ( memberP(X0,X6)
& memberP(X1,X6) )
| ( ~ memberP(X0,X6)
& ~ memberP(X1,X6) )
| ~ ssItem(X6) )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( app(X5,X4) != X2
| app(X4,X5) != X3
| ~ ssList(X5) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X6] :
( ( memberP(X0,X6)
& memberP(X1,X6) )
| ( ~ memberP(X0,X6)
& ~ memberP(X1,X6) )
| ~ ssItem(X6) )
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( app(X5,X4) != X2
| app(X4,X5) != X3
| ~ ssList(X5) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(negated_conjecture,[],[f96]) ).
fof(f98,plain,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ! [X4] :
( ( memberP(X0,X4)
& memberP(X1,X4) )
| ( ~ memberP(X0,X4)
& ~ memberP(X1,X4) )
| ~ ssItem(X4) )
| ! [X5] :
( ssList(X5)
=> ! [X6] :
( app(X6,X5) != X2
| app(X5,X6) != X3
| ~ ssList(X6) ) )
| X0 != X2
| X1 != X3
| ~ ssList(X3) ) ) ) ),
inference(rectify,[],[f97]) ).
fof(f147,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(app(X1,X2),X0)
<=> ( memberP(X2,X0)
| memberP(X1,X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ( ~ memberP(X0,X4)
| ~ memberP(X1,X4) )
& ( memberP(X0,X4)
| memberP(X1,X4) )
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( app(X6,X5) = X2
& app(X5,X6) = X3
& ssList(X6) )
& ssList(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f98]) ).
fof(f322,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) ) )
& ( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(nnf_transformation,[],[f147]) ).
fof(f323,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( ( memberP(app(X1,X2),X0)
| ( ~ memberP(X2,X0)
& ~ memberP(X1,X0) ) )
& ( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(flattening,[],[f322]) ).
fof(f343,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ( ~ memberP(X0,X4)
| ~ memberP(X1,X4) )
& ( memberP(X0,X4)
| memberP(X1,X4) )
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( app(X6,X5) = X2
& app(X5,X6) = X3
& ssList(X6) )
& ssList(X5) )
& X0 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) )
=> ( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ( ~ memberP(sK53,X4)
| ~ memberP(X1,X4) )
& ( memberP(sK53,X4)
| memberP(X1,X4) )
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( app(X6,X5) = X2
& app(X5,X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(sK53) ) ),
introduced(choice_axiom,[]) ).
fof(f344,plain,
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ( ~ memberP(sK53,X4)
| ~ memberP(X1,X4) )
& ( memberP(sK53,X4)
| memberP(X1,X4) )
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( app(X6,X5) = X2
& app(X5,X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK53 = X2
& X1 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
=> ( ? [X2] :
( ? [X3] :
( ? [X4] :
( ( ~ memberP(sK53,X4)
| ~ memberP(sK54,X4) )
& ( memberP(sK53,X4)
| memberP(sK54,X4) )
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( app(X6,X5) = X2
& app(X5,X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
& ssList(sK54) ) ),
introduced(choice_axiom,[]) ).
fof(f345,plain,
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ( ~ memberP(sK53,X4)
| ~ memberP(sK54,X4) )
& ( memberP(sK53,X4)
| memberP(sK54,X4) )
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( app(X6,X5) = X2
& app(X5,X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK53 = X2
& sK54 = X3
& ssList(X3) )
& ssList(X2) )
=> ( ? [X3] :
( ? [X4] :
( ( ~ memberP(sK53,X4)
| ~ memberP(sK54,X4) )
& ( memberP(sK53,X4)
| memberP(sK54,X4) )
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( app(X6,X5) = sK55
& app(X5,X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
& ssList(sK55) ) ),
introduced(choice_axiom,[]) ).
fof(f346,plain,
( ? [X3] :
( ? [X4] :
( ( ~ memberP(sK53,X4)
| ~ memberP(sK54,X4) )
& ( memberP(sK53,X4)
| memberP(sK54,X4) )
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( app(X6,X5) = sK55
& app(X5,X6) = X3
& ssList(X6) )
& ssList(X5) )
& sK53 = sK55
& sK54 = X3
& ssList(X3) )
=> ( ? [X4] :
( ( ~ memberP(sK53,X4)
| ~ memberP(sK54,X4) )
& ( memberP(sK53,X4)
| memberP(sK54,X4) )
& ssItem(X4) )
& ? [X5] :
( ? [X6] :
( app(X6,X5) = sK55
& app(X5,X6) = sK56
& ssList(X6) )
& ssList(X5) )
& sK53 = sK55
& sK54 = sK56
& ssList(sK56) ) ),
introduced(choice_axiom,[]) ).
fof(f347,plain,
( ? [X4] :
( ( ~ memberP(sK53,X4)
| ~ memberP(sK54,X4) )
& ( memberP(sK53,X4)
| memberP(sK54,X4) )
& ssItem(X4) )
=> ( ( ~ memberP(sK53,sK57)
| ~ memberP(sK54,sK57) )
& ( memberP(sK53,sK57)
| memberP(sK54,sK57) )
& ssItem(sK57) ) ),
introduced(choice_axiom,[]) ).
fof(f348,plain,
( ? [X5] :
( ? [X6] :
( app(X6,X5) = sK55
& app(X5,X6) = sK56
& ssList(X6) )
& ssList(X5) )
=> ( ? [X6] :
( sK55 = app(X6,sK58)
& sK56 = app(sK58,X6)
& ssList(X6) )
& ssList(sK58) ) ),
introduced(choice_axiom,[]) ).
fof(f349,plain,
( ? [X6] :
( sK55 = app(X6,sK58)
& sK56 = app(sK58,X6)
& ssList(X6) )
=> ( sK55 = app(sK59,sK58)
& sK56 = app(sK58,sK59)
& ssList(sK59) ) ),
introduced(choice_axiom,[]) ).
fof(f350,plain,
( ( ~ memberP(sK53,sK57)
| ~ memberP(sK54,sK57) )
& ( memberP(sK53,sK57)
| memberP(sK54,sK57) )
& ssItem(sK57)
& sK55 = app(sK59,sK58)
& sK56 = app(sK58,sK59)
& ssList(sK59)
& ssList(sK58)
& 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,sK59])],[f222,f349,f348,f347,f346,f345,f344,f343]) ).
fof(f467,plain,
! [X2,X0,X1] :
( memberP(X2,X0)
| memberP(X1,X0)
| ~ memberP(app(X1,X2),X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f323]) ).
fof(f468,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X1,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f323]) ).
fof(f469,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ memberP(X2,X0)
| ~ ssList(X2)
| ~ ssList(X1)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f323]) ).
fof(f554,plain,
sK54 = sK56,
inference(cnf_transformation,[],[f350]) ).
fof(f555,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f350]) ).
fof(f556,plain,
ssList(sK58),
inference(cnf_transformation,[],[f350]) ).
fof(f557,plain,
ssList(sK59),
inference(cnf_transformation,[],[f350]) ).
fof(f558,plain,
sK56 = app(sK58,sK59),
inference(cnf_transformation,[],[f350]) ).
fof(f559,plain,
sK55 = app(sK59,sK58),
inference(cnf_transformation,[],[f350]) ).
fof(f560,plain,
ssItem(sK57),
inference(cnf_transformation,[],[f350]) ).
fof(f561,plain,
( memberP(sK53,sK57)
| memberP(sK54,sK57) ),
inference(cnf_transformation,[],[f350]) ).
fof(f562,plain,
( ~ memberP(sK53,sK57)
| ~ memberP(sK54,sK57) ),
inference(cnf_transformation,[],[f350]) ).
fof(f563,plain,
( ~ memberP(sK55,sK57)
| ~ memberP(sK56,sK57) ),
inference(definition_unfolding,[],[f562,f555,f554]) ).
fof(f564,plain,
( memberP(sK55,sK57)
| memberP(sK56,sK57) ),
inference(definition_unfolding,[],[f561,f555,f554]) ).
cnf(c_165,plain,
( ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| memberP(app(X2,X0),X1) ),
inference(cnf_transformation,[],[f469]) ).
cnf(c_166,plain,
( ~ memberP(X0,X1)
| ~ ssItem(X1)
| ~ ssList(X0)
| ~ ssList(X2)
| memberP(app(X0,X2),X1) ),
inference(cnf_transformation,[],[f468]) ).
cnf(c_167,plain,
( ~ memberP(app(X0,X1),X2)
| ~ ssItem(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| memberP(X0,X2)
| memberP(X1,X2) ),
inference(cnf_transformation,[],[f467]) ).
cnf(c_246,negated_conjecture,
( ~ memberP(sK55,sK57)
| ~ memberP(sK56,sK57) ),
inference(cnf_transformation,[],[f563]) ).
cnf(c_247,negated_conjecture,
( memberP(sK55,sK57)
| memberP(sK56,sK57) ),
inference(cnf_transformation,[],[f564]) ).
cnf(c_248,negated_conjecture,
ssItem(sK57),
inference(cnf_transformation,[],[f560]) ).
cnf(c_249,negated_conjecture,
app(sK59,sK58) = sK55,
inference(cnf_transformation,[],[f559]) ).
cnf(c_250,negated_conjecture,
app(sK58,sK59) = sK56,
inference(cnf_transformation,[],[f558]) ).
cnf(c_251,negated_conjecture,
ssList(sK59),
inference(cnf_transformation,[],[f557]) ).
cnf(c_252,negated_conjecture,
ssList(sK58),
inference(cnf_transformation,[],[f556]) ).
cnf(c_4085,negated_conjecture,
app(sK58,sK59) = sK56,
inference(subtyping,[status(esa)],[c_250]) ).
cnf(c_4086,negated_conjecture,
app(sK59,sK58) = sK55,
inference(subtyping,[status(esa)],[c_249]) ).
cnf(c_4154,plain,
( ~ memberP(app(X0_13,X1_13),X0_14)
| ~ ssItem(X0_14)
| ~ ssList(X0_13)
| ~ ssList(X1_13)
| memberP(X0_13,X0_14)
| memberP(X1_13,X0_14) ),
inference(subtyping,[status(esa)],[c_167]) ).
cnf(c_4155,plain,
( ~ memberP(X0_13,X0_14)
| ~ ssItem(X0_14)
| ~ ssList(X0_13)
| ~ ssList(X1_13)
| memberP(app(X0_13,X1_13),X0_14) ),
inference(subtyping,[status(esa)],[c_166]) ).
cnf(c_4156,plain,
( ~ memberP(X0_13,X0_14)
| ~ ssItem(X0_14)
| ~ ssList(X0_13)
| ~ ssList(X1_13)
| memberP(app(X1_13,X0_13),X0_14) ),
inference(subtyping,[status(esa)],[c_165]) ).
cnf(c_8719,plain,
( ~ memberP(sK58,X0_14)
| ~ ssItem(X0_14)
| ~ ssList(sK59)
| ~ ssList(sK58)
| memberP(sK55,X0_14) ),
inference(superposition,[status(thm)],[c_4086,c_4156]) ).
cnf(c_8720,plain,
( ~ memberP(sK59,X0_14)
| ~ ssItem(X0_14)
| ~ ssList(sK59)
| ~ ssList(sK58)
| memberP(sK56,X0_14) ),
inference(superposition,[status(thm)],[c_4085,c_4156]) ).
cnf(c_8741,plain,
( ~ memberP(sK59,sK57)
| ~ ssItem(sK57)
| ~ ssList(sK59)
| ~ ssList(sK58)
| memberP(sK56,sK57) ),
inference(instantiation,[status(thm)],[c_8720]) ).
cnf(c_8742,plain,
( ~ memberP(sK58,sK57)
| ~ ssItem(sK57)
| ~ ssList(sK59)
| ~ ssList(sK58)
| memberP(sK55,sK57) ),
inference(instantiation,[status(thm)],[c_8719]) ).
cnf(c_8749,plain,
( ~ memberP(sK59,X0_14)
| ~ ssItem(X0_14)
| ~ ssList(sK59)
| ~ ssList(sK58)
| memberP(sK55,X0_14) ),
inference(superposition,[status(thm)],[c_4086,c_4155]) ).
cnf(c_8750,plain,
( ~ memberP(sK58,X0_14)
| ~ ssItem(X0_14)
| ~ ssList(sK59)
| ~ ssList(sK58)
| memberP(sK56,X0_14) ),
inference(superposition,[status(thm)],[c_4085,c_4155]) ).
cnf(c_8771,plain,
( ~ memberP(sK58,sK57)
| ~ ssItem(sK57)
| ~ ssList(sK59)
| ~ ssList(sK58)
| memberP(sK56,sK57) ),
inference(instantiation,[status(thm)],[c_8750]) ).
cnf(c_8772,plain,
( ~ memberP(sK59,sK57)
| ~ ssItem(sK57)
| ~ ssList(sK59)
| ~ ssList(sK58)
| memberP(sK55,sK57) ),
inference(instantiation,[status(thm)],[c_8749]) ).
cnf(c_11164,plain,
( ~ memberP(sK55,X0_14)
| ~ ssItem(X0_14)
| ~ ssList(sK59)
| ~ ssList(sK58)
| memberP(sK59,X0_14)
| memberP(sK58,X0_14) ),
inference(superposition,[status(thm)],[c_4086,c_4154]) ).
cnf(c_11165,plain,
( ~ memberP(sK56,X0_14)
| ~ ssItem(X0_14)
| ~ ssList(sK59)
| ~ ssList(sK58)
| memberP(sK59,X0_14)
| memberP(sK58,X0_14) ),
inference(superposition,[status(thm)],[c_4085,c_4154]) ).
cnf(c_11190,plain,
( ~ memberP(sK56,sK57)
| ~ ssItem(sK57)
| ~ ssList(sK59)
| ~ ssList(sK58)
| memberP(sK59,sK57)
| memberP(sK58,sK57) ),
inference(instantiation,[status(thm)],[c_11165]) ).
cnf(c_11191,plain,
( ~ memberP(sK55,sK57)
| ~ ssItem(sK57)
| ~ ssList(sK59)
| ~ ssList(sK58)
| memberP(sK59,sK57)
| memberP(sK58,sK57) ),
inference(instantiation,[status(thm)],[c_11164]) ).
cnf(c_11576,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_11191,c_11190,c_8772,c_8771,c_8742,c_8741,c_246,c_247,c_248,c_251,c_252]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWC378+1 : TPTP v8.1.2. Released v2.4.0.
% 0.11/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n027.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon Aug 28 16:32:37 EDT 2023
% 0.14/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.02/1.16 % SZS status Started for theBenchmark.p
% 4.02/1.16 % SZS status Theorem for theBenchmark.p
% 4.02/1.16
% 4.02/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 4.02/1.16
% 4.02/1.16 ------ iProver source info
% 4.02/1.16
% 4.02/1.16 git: date: 2023-05-31 18:12:56 +0000
% 4.02/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 4.02/1.16 git: non_committed_changes: false
% 4.02/1.16 git: last_make_outside_of_git: false
% 4.02/1.16
% 4.02/1.16 ------ Parsing...
% 4.02/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 4.02/1.16
% 4.02/1.16 ------ Preprocessing... sup_sim: 0 pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sup_sim: 0 pe_s pe_e
% 4.02/1.16
% 4.02/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e scvd_s sp: 0 0s scvd_e snvd_s sp: 0 0s snvd_e
% 4.02/1.16
% 4.02/1.16 ------ Preprocessing...
% 4.02/1.16 ------ Proving...
% 4.02/1.16 ------ Problem Properties
% 4.02/1.16
% 4.02/1.16
% 4.02/1.16 clauses 189
% 4.02/1.16 conjectures 9
% 4.02/1.16 EPR 56
% 4.02/1.16 Horn 120
% 4.02/1.16 unary 23
% 4.02/1.16 binary 42
% 4.02/1.16 lits 629
% 4.02/1.16 lits eq 80
% 4.02/1.16 fd_pure 0
% 4.02/1.16 fd_pseudo 0
% 4.02/1.16 fd_cond 21
% 4.02/1.16 fd_pseudo_cond 14
% 4.02/1.16 AC symbols 0
% 4.02/1.16
% 4.02/1.16 ------ Input Options Time Limit: Unbounded
% 4.02/1.16
% 4.02/1.16
% 4.02/1.16 ------
% 4.02/1.16 Current options:
% 4.02/1.16 ------
% 4.02/1.16
% 4.02/1.16
% 4.02/1.16
% 4.02/1.16
% 4.02/1.16 ------ Proving...
% 4.02/1.16
% 4.02/1.16
% 4.02/1.16 % SZS status Theorem for theBenchmark.p
% 4.02/1.16
% 4.02/1.16 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 4.02/1.16
% 4.02/1.16
%------------------------------------------------------------------------------