TSTP Solution File: SEU171+2 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SEU171+2 : TPTP v8.1.2. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n013.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 17:04:22 EDT 2023
% Result : Theorem 3.78s 1.17s
% Output : CNFRefutation 3.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 16
% Syntax : Number of formulae : 79 ( 28 unt; 0 def)
% Number of atoms : 282 ( 46 equ)
% Maximal formula atoms : 14 ( 3 avg)
% Number of connectives : 336 ( 133 ~; 104 |; 73 &)
% ( 8 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 4 con; 0-3 aty)
% Number of variables : 133 ( 2 sgn; 93 !; 22 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_xboole_0) ).
fof(f9,axiom,
! [X0,X1] :
( powerset(X0) = X1
<=> ! [X2] :
( in(X2,X1)
<=> subset(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d1_zfmisc_1) ).
fof(f10,axiom,
! [X0,X1] :
( ( empty(X0)
=> ( element(X1,X0)
<=> empty(X1) ) )
& ( ~ empty(X0)
=> ( element(X1,X0)
<=> in(X1,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_subset_1) ).
fof(f17,axiom,
! [X0,X1,X2] :
( set_difference(X0,X1) = X2
<=> ! [X3] :
( in(X3,X2)
<=> ( ~ in(X3,X1)
& in(X3,X0) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_xboole_0) ).
fof(f18,axiom,
! [X0,X1] :
( element(X1,powerset(X0))
=> set_difference(X0,X1) = subset_complement(X0,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_subset_1) ).
fof(f35,axiom,
! [X0] : ~ empty(powerset(X0)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_subset_1) ).
fof(f36,axiom,
empty(empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(f39,axiom,
! [X0,X1] :
( ~ empty(X0)
=> ~ empty(set_union2(X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc3_xboole_0) ).
fof(f65,axiom,
! [X0,X1] :
( subset(X0,X1)
=> set_union2(X0,X1) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(f95,conjecture,
! [X0] :
( empty_set != X0
=> ! [X1] :
( element(X1,powerset(X0))
=> ! [X2] :
( element(X2,X0)
=> ( ~ in(X2,X1)
=> in(X2,subset_complement(X0,X1)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t50_subset_1) ).
fof(f96,negated_conjecture,
~ ! [X0] :
( empty_set != X0
=> ! [X1] :
( element(X1,powerset(X0))
=> ! [X2] :
( element(X2,X0)
=> ( ~ in(X2,X1)
=> in(X2,subset_complement(X0,X1)) ) ) ) ),
inference(negated_conjecture,[],[f95]) ).
fof(f106,axiom,
! [X0,X1] :
~ ( empty(X1)
& X0 != X1
& empty(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t8_boole) ).
fof(f126,plain,
! [X0,X1] :
( ( ( element(X1,X0)
<=> empty(X1) )
| ~ empty(X0) )
& ( ( element(X1,X0)
<=> in(X1,X0) )
| empty(X0) ) ),
inference(ennf_transformation,[],[f10]) ).
fof(f128,plain,
! [X0,X1] :
( set_difference(X0,X1) = subset_complement(X0,X1)
| ~ element(X1,powerset(X0)) ),
inference(ennf_transformation,[],[f18]) ).
fof(f133,plain,
! [X0,X1] :
( ~ empty(set_union2(X1,X0))
| empty(X0) ),
inference(ennf_transformation,[],[f39]) ).
fof(f148,plain,
! [X0,X1] :
( set_union2(X0,X1) = X1
| ~ subset(X0,X1) ),
inference(ennf_transformation,[],[f65]) ).
fof(f166,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ~ in(X2,subset_complement(X0,X1))
& ~ in(X2,X1)
& element(X2,X0) )
& element(X1,powerset(X0)) )
& empty_set != X0 ),
inference(ennf_transformation,[],[f96]) ).
fof(f167,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ~ in(X2,subset_complement(X0,X1))
& ~ in(X2,X1)
& element(X2,X0) )
& element(X1,powerset(X0)) )
& empty_set != X0 ),
inference(flattening,[],[f166]) ).
fof(f174,plain,
! [X0,X1] :
( ~ empty(X1)
| X0 = X1
| ~ empty(X0) ),
inference(ennf_transformation,[],[f106]) ).
fof(f192,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X2] :
( ( in(X2,X1)
| ~ subset(X2,X0) )
& ( subset(X2,X0)
| ~ in(X2,X1) ) )
| powerset(X0) != X1 ) ),
inference(nnf_transformation,[],[f9]) ).
fof(f193,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(rectify,[],[f192]) ).
fof(f194,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ subset(X2,X0)
| ~ in(X2,X1) )
& ( subset(X2,X0)
| in(X2,X1) ) )
=> ( ( ~ subset(sK2(X0,X1),X0)
| ~ in(sK2(X0,X1),X1) )
& ( subset(sK2(X0,X1),X0)
| in(sK2(X0,X1),X1) ) ) ),
introduced(choice_axiom,[]) ).
fof(f195,plain,
! [X0,X1] :
( ( powerset(X0) = X1
| ( ( ~ subset(sK2(X0,X1),X0)
| ~ in(sK2(X0,X1),X1) )
& ( subset(sK2(X0,X1),X0)
| in(sK2(X0,X1),X1) ) ) )
& ( ! [X3] :
( ( in(X3,X1)
| ~ subset(X3,X0) )
& ( subset(X3,X0)
| ~ in(X3,X1) ) )
| powerset(X0) != X1 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f193,f194]) ).
fof(f196,plain,
! [X0,X1] :
( ( ( ( element(X1,X0)
| ~ empty(X1) )
& ( empty(X1)
| ~ element(X1,X0) ) )
| ~ empty(X0) )
& ( ( ( element(X1,X0)
| ~ in(X1,X0) )
& ( in(X1,X0)
| ~ element(X1,X0) ) )
| empty(X0) ) ),
inference(nnf_transformation,[],[f126]) ).
fof(f228,plain,
! [X0,X1,X2] :
( ( set_difference(X0,X1) = X2
| ? [X3] :
( ( in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( ~ in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| in(X3,X1)
| ~ in(X3,X0) )
& ( ( ~ in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(nnf_transformation,[],[f17]) ).
fof(f229,plain,
! [X0,X1,X2] :
( ( set_difference(X0,X1) = X2
| ? [X3] :
( ( in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( ~ in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X3] :
( ( in(X3,X2)
| in(X3,X1)
| ~ in(X3,X0) )
& ( ( ~ in(X3,X1)
& in(X3,X0) )
| ~ in(X3,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(flattening,[],[f228]) ).
fof(f230,plain,
! [X0,X1,X2] :
( ( set_difference(X0,X1) = X2
| ? [X3] :
( ( in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( ~ in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| in(X4,X1)
| ~ in(X4,X0) )
& ( ( ~ in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(rectify,[],[f229]) ).
fof(f231,plain,
! [X0,X1,X2] :
( ? [X3] :
( ( in(X3,X1)
| ~ in(X3,X0)
| ~ in(X3,X2) )
& ( ( ~ in(X3,X1)
& in(X3,X0) )
| in(X3,X2) ) )
=> ( ( in(sK15(X0,X1,X2),X1)
| ~ in(sK15(X0,X1,X2),X0)
| ~ in(sK15(X0,X1,X2),X2) )
& ( ( ~ in(sK15(X0,X1,X2),X1)
& in(sK15(X0,X1,X2),X0) )
| in(sK15(X0,X1,X2),X2) ) ) ),
introduced(choice_axiom,[]) ).
fof(f232,plain,
! [X0,X1,X2] :
( ( set_difference(X0,X1) = X2
| ( ( in(sK15(X0,X1,X2),X1)
| ~ in(sK15(X0,X1,X2),X0)
| ~ in(sK15(X0,X1,X2),X2) )
& ( ( ~ in(sK15(X0,X1,X2),X1)
& in(sK15(X0,X1,X2),X0) )
| in(sK15(X0,X1,X2),X2) ) ) )
& ( ! [X4] :
( ( in(X4,X2)
| in(X4,X1)
| ~ in(X4,X0) )
& ( ( ~ in(X4,X1)
& in(X4,X0) )
| ~ in(X4,X2) ) )
| set_difference(X0,X1) != X2 ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK15])],[f230,f231]) ).
fof(f269,plain,
( ? [X0] :
( ? [X1] :
( ? [X2] :
( ~ in(X2,subset_complement(X0,X1))
& ~ in(X2,X1)
& element(X2,X0) )
& element(X1,powerset(X0)) )
& empty_set != X0 )
=> ( ? [X1] :
( ? [X2] :
( ~ in(X2,subset_complement(sK25,X1))
& ~ in(X2,X1)
& element(X2,sK25) )
& element(X1,powerset(sK25)) )
& empty_set != sK25 ) ),
introduced(choice_axiom,[]) ).
fof(f270,plain,
( ? [X1] :
( ? [X2] :
( ~ in(X2,subset_complement(sK25,X1))
& ~ in(X2,X1)
& element(X2,sK25) )
& element(X1,powerset(sK25)) )
=> ( ? [X2] :
( ~ in(X2,subset_complement(sK25,sK26))
& ~ in(X2,sK26)
& element(X2,sK25) )
& element(sK26,powerset(sK25)) ) ),
introduced(choice_axiom,[]) ).
fof(f271,plain,
( ? [X2] :
( ~ in(X2,subset_complement(sK25,sK26))
& ~ in(X2,sK26)
& element(X2,sK25) )
=> ( ~ in(sK27,subset_complement(sK25,sK26))
& ~ in(sK27,sK26)
& element(sK27,sK25) ) ),
introduced(choice_axiom,[]) ).
fof(f272,plain,
( ~ in(sK27,subset_complement(sK25,sK26))
& ~ in(sK27,sK26)
& element(sK27,sK25)
& element(sK26,powerset(sK25))
& empty_set != sK25 ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK25,sK26,sK27])],[f167,f271,f270,f269]) ).
fof(f282,plain,
! [X0,X1] : set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f4]) ).
fof(f293,plain,
! [X3,X0,X1] :
( subset(X3,X0)
| ~ in(X3,X1)
| powerset(X0) != X1 ),
inference(cnf_transformation,[],[f195]) ).
fof(f297,plain,
! [X0,X1] :
( in(X1,X0)
| ~ element(X1,X0)
| empty(X0) ),
inference(cnf_transformation,[],[f196]) ).
fof(f338,plain,
! [X2,X0,X1,X4] :
( in(X4,X2)
| in(X4,X1)
| ~ in(X4,X0)
| set_difference(X0,X1) != X2 ),
inference(cnf_transformation,[],[f232]) ).
fof(f342,plain,
! [X0,X1] :
( set_difference(X0,X1) = subset_complement(X0,X1)
| ~ element(X1,powerset(X0)) ),
inference(cnf_transformation,[],[f128]) ).
fof(f349,plain,
! [X0] : ~ empty(powerset(X0)),
inference(cnf_transformation,[],[f35]) ).
fof(f350,plain,
empty(empty_set),
inference(cnf_transformation,[],[f36]) ).
fof(f353,plain,
! [X0,X1] :
( ~ empty(set_union2(X1,X0))
| empty(X0) ),
inference(cnf_transformation,[],[f133]) ).
fof(f390,plain,
! [X0,X1] :
( set_union2(X0,X1) = X1
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f148]) ).
fof(f434,plain,
empty_set != sK25,
inference(cnf_transformation,[],[f272]) ).
fof(f435,plain,
element(sK26,powerset(sK25)),
inference(cnf_transformation,[],[f272]) ).
fof(f436,plain,
element(sK27,sK25),
inference(cnf_transformation,[],[f272]) ).
fof(f437,plain,
~ in(sK27,sK26),
inference(cnf_transformation,[],[f272]) ).
fof(f438,plain,
~ in(sK27,subset_complement(sK25,sK26)),
inference(cnf_transformation,[],[f272]) ).
fof(f450,plain,
! [X0,X1] :
( ~ empty(X1)
| X0 = X1
| ~ empty(X0) ),
inference(cnf_transformation,[],[f174]) ).
fof(f524,plain,
! [X3,X0] :
( subset(X3,X0)
| ~ in(X3,powerset(X0)) ),
inference(equality_resolution,[],[f293]) ).
fof(f544,plain,
! [X0,X1,X4] :
( in(X4,set_difference(X0,X1))
| in(X4,X1)
| ~ in(X4,X0) ),
inference(equality_resolution,[],[f338]) ).
cnf(c_52,plain,
set_union2(X0,X1) = set_union2(X1,X0),
inference(cnf_transformation,[],[f282]) ).
cnf(c_66,plain,
( ~ in(X0,powerset(X1))
| subset(X0,X1) ),
inference(cnf_transformation,[],[f524]) ).
cnf(c_70,plain,
( ~ element(X0,X1)
| in(X0,X1)
| empty(X1) ),
inference(cnf_transformation,[],[f297]) ).
cnf(c_109,plain,
( ~ in(X0,X1)
| in(X0,set_difference(X1,X2))
| in(X0,X2) ),
inference(cnf_transformation,[],[f544]) ).
cnf(c_112,plain,
( ~ element(X0,powerset(X1))
| set_difference(X1,X0) = subset_complement(X1,X0) ),
inference(cnf_transformation,[],[f342]) ).
cnf(c_118,plain,
~ empty(powerset(X0)),
inference(cnf_transformation,[],[f349]) ).
cnf(c_119,plain,
empty(empty_set),
inference(cnf_transformation,[],[f350]) ).
cnf(c_122,plain,
( ~ empty(set_union2(X0,X1))
| empty(X1) ),
inference(cnf_transformation,[],[f353]) ).
cnf(c_159,plain,
( ~ subset(X0,X1)
| set_union2(X0,X1) = X1 ),
inference(cnf_transformation,[],[f390]) ).
cnf(c_202,negated_conjecture,
~ in(sK27,subset_complement(sK25,sK26)),
inference(cnf_transformation,[],[f438]) ).
cnf(c_203,negated_conjecture,
~ in(sK27,sK26),
inference(cnf_transformation,[],[f437]) ).
cnf(c_204,negated_conjecture,
element(sK27,sK25),
inference(cnf_transformation,[],[f436]) ).
cnf(c_205,negated_conjecture,
element(sK26,powerset(sK25)),
inference(cnf_transformation,[],[f435]) ).
cnf(c_206,negated_conjecture,
empty_set != sK25,
inference(cnf_transformation,[],[f434]) ).
cnf(c_217,plain,
( ~ empty(X0)
| ~ empty(X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f450]) ).
cnf(c_6869,plain,
( in(sK27,sK25)
| empty(sK25) ),
inference(superposition,[status(thm)],[c_204,c_70]) ).
cnf(c_6870,plain,
( in(sK26,powerset(sK25))
| empty(powerset(sK25)) ),
inference(superposition,[status(thm)],[c_205,c_70]) ).
cnf(c_6885,plain,
in(sK26,powerset(sK25)),
inference(forward_subsumption_resolution,[status(thm)],[c_6870,c_118]) ).
cnf(c_6926,plain,
subset(sK26,sK25),
inference(superposition,[status(thm)],[c_6885,c_66]) ).
cnf(c_7273,plain,
( ~ empty(empty_set)
| ~ empty(sK25)
| empty_set = sK25 ),
inference(instantiation,[status(thm)],[c_217]) ).
cnf(c_7867,plain,
set_union2(sK26,sK25) = sK25,
inference(superposition,[status(thm)],[c_6926,c_159]) ).
cnf(c_7966,plain,
set_union2(sK25,sK26) = sK25,
inference(demodulation,[status(thm)],[c_7867,c_52]) ).
cnf(c_7974,plain,
( ~ empty(sK25)
| empty(sK26) ),
inference(superposition,[status(thm)],[c_7966,c_122]) ).
cnf(c_7987,plain,
~ empty(sK25),
inference(global_subsumption_just,[status(thm)],[c_7974,c_119,c_206,c_7273]) ).
cnf(c_7990,plain,
in(sK27,sK25),
inference(backward_subsumption_resolution,[status(thm)],[c_6869,c_7987]) ).
cnf(c_13468,plain,
set_difference(sK25,sK26) = subset_complement(sK25,sK26),
inference(superposition,[status(thm)],[c_205,c_112]) ).
cnf(c_13497,plain,
~ in(sK27,set_difference(sK25,sK26)),
inference(demodulation,[status(thm)],[c_202,c_13468]) ).
cnf(c_13798,plain,
( ~ in(sK27,sK25)
| in(sK27,sK26) ),
inference(superposition,[status(thm)],[c_109,c_13497]) ).
cnf(c_13799,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_13798,c_203,c_7990]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SEU171+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.15 % Command : run_iprover %s %d THM
% 0.18/0.36 % Computer : n013.cluster.edu
% 0.18/0.36 % Model : x86_64 x86_64
% 0.18/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.36 % Memory : 8042.1875MB
% 0.18/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.36 % CPULimit : 300
% 0.18/0.36 % WCLimit : 300
% 0.18/0.36 % DateTime : Wed Aug 23 13:46:47 EDT 2023
% 0.18/0.37 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.78/1.17 % SZS status Started for theBenchmark.p
% 3.78/1.17 % SZS status Theorem for theBenchmark.p
% 3.78/1.17
% 3.78/1.17 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.78/1.17
% 3.78/1.17 ------ iProver source info
% 3.78/1.17
% 3.78/1.17 git: date: 2023-05-31 18:12:56 +0000
% 3.78/1.17 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.78/1.17 git: non_committed_changes: false
% 3.78/1.17 git: last_make_outside_of_git: false
% 3.78/1.17
% 3.78/1.17 ------ Parsing...
% 3.78/1.17 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.78/1.17
% 3.78/1.17 ------ Preprocessing... sup_sim: 5 sf_s rm: 1 0s sf_e pe_s pe_e sup_sim: 0 sf_s rm: 1 0s sf_e pe_s pe_e
% 3.78/1.17
% 3.78/1.17 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.78/1.17
% 3.78/1.17 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.78/1.17 ------ Proving...
% 3.78/1.17 ------ Problem Properties
% 3.78/1.17
% 3.78/1.17
% 3.78/1.17 clauses 155
% 3.78/1.17 conjectures 5
% 3.78/1.17 EPR 28
% 3.78/1.17 Horn 124
% 3.78/1.17 unary 36
% 3.78/1.17 binary 65
% 3.78/1.17 lits 337
% 3.78/1.17 lits eq 84
% 3.78/1.17 fd_pure 0
% 3.78/1.17 fd_pseudo 0
% 3.78/1.17 fd_cond 3
% 3.78/1.17 fd_pseudo_cond 35
% 3.78/1.17 AC symbols 0
% 3.78/1.17
% 3.78/1.17 ------ Schedule dynamic 5 is on
% 3.78/1.17
% 3.78/1.17 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.78/1.17
% 3.78/1.17
% 3.78/1.17 ------
% 3.78/1.17 Current options:
% 3.78/1.17 ------
% 3.78/1.17
% 3.78/1.17
% 3.78/1.17
% 3.78/1.17
% 3.78/1.17 ------ Proving...
% 3.78/1.17
% 3.78/1.17
% 3.78/1.17 % SZS status Theorem for theBenchmark.p
% 3.78/1.17
% 3.78/1.17 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.78/1.18
% 3.78/1.18
%------------------------------------------------------------------------------