TSTP Solution File: SET595+3 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : SET595+3 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n023.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 15:08:29 EDT 2023
% Result : Theorem 3.70s 1.12s
% Output : CNFRefutation 3.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 9
% Syntax : Number of formulae : 78 ( 9 unt; 0 def)
% Number of atoms : 226 ( 25 equ)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 253 ( 105 ~; 104 |; 30 &)
% ( 6 <=>; 7 =>; 0 <=; 1 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 131 ( 6 sgn; 84 !; 10 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] :
( ! [X2] :
( member(X2,X0)
<=> member(X2,X1) )
=> X0 = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',member_equal) ).
fof(f2,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X1)
| member(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',union_defn) ).
fof(f3,axiom,
! [X0,X1,X2] :
( member(X2,difference(X0,X1))
<=> ( ~ member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',difference_defn) ).
fof(f4,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',subset_defn) ).
fof(f5,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equal_defn) ).
fof(f9,conjecture,
! [X0,X1] :
( subset(X0,X1)
=> union(X0,difference(X1,X0)) = X1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_th54) ).
fof(f10,negated_conjecture,
~ ! [X0,X1] :
( subset(X0,X1)
=> union(X0,difference(X1,X0)) = X1 ),
inference(negated_conjecture,[],[f9]) ).
fof(f11,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( member(X2,X0)
<~> member(X2,X1) ) ),
inference(ennf_transformation,[],[f1]) ).
fof(f12,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f4]) ).
fof(f13,plain,
? [X0,X1] :
( union(X0,difference(X1,X0)) != X1
& subset(X0,X1) ),
inference(ennf_transformation,[],[f10]) ).
fof(f14,plain,
! [X0,X1] :
( X0 = X1
| ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) ) ),
inference(nnf_transformation,[],[f11]) ).
fof(f15,plain,
! [X0,X1] :
( ? [X2] :
( ( ~ member(X2,X1)
| ~ member(X2,X0) )
& ( member(X2,X1)
| member(X2,X0) ) )
=> ( ( ~ member(sK0(X0,X1),X1)
| ~ member(sK0(X0,X1),X0) )
& ( member(sK0(X0,X1),X1)
| member(sK0(X0,X1),X0) ) ) ),
introduced(choice_axiom,[]) ).
fof(f16,plain,
! [X0,X1] :
( X0 = X1
| ( ( ~ member(sK0(X0,X1),X1)
| ~ member(sK0(X0,X1),X0) )
& ( member(sK0(X0,X1),X1)
| member(sK0(X0,X1),X0) ) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f14,f15]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f18,plain,
! [X0,X1,X2] :
( ( member(X2,union(X0,X1))
| ( ~ member(X2,X1)
& ~ member(X2,X0) ) )
& ( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ) ),
inference(flattening,[],[f17]) ).
fof(f19,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) )
& ( ( ~ member(X2,X1)
& member(X2,X0) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(nnf_transformation,[],[f3]) ).
fof(f20,plain,
! [X0,X1,X2] :
( ( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) )
& ( ( ~ member(X2,X1)
& member(X2,X0) )
| ~ member(X2,difference(X0,X1)) ) ),
inference(flattening,[],[f19]) ).
fof(f21,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) )
| ~ subset(X0,X1) ) ),
inference(nnf_transformation,[],[f12]) ).
fof(f22,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(rectify,[],[f21]) ).
fof(f23,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK1(X0,X1),X1)
& member(sK1(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f24,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK1(X0,X1),X1)
& member(sK1(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK1])],[f22,f23]) ).
fof(f25,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f5]) ).
fof(f26,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f25]) ).
fof(f31,plain,
( ? [X0,X1] :
( union(X0,difference(X1,X0)) != X1
& subset(X0,X1) )
=> ( sK4 != union(sK3,difference(sK4,sK3))
& subset(sK3,sK4) ) ),
introduced(choice_axiom,[]) ).
fof(f32,plain,
( sK4 != union(sK3,difference(sK4,sK3))
& subset(sK3,sK4) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f13,f31]) ).
fof(f33,plain,
! [X0,X1] :
( X0 = X1
| member(sK0(X0,X1),X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f34,plain,
! [X0,X1] :
( X0 = X1
| ~ member(sK0(X0,X1),X1)
| ~ member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f16]) ).
fof(f35,plain,
! [X2,X0,X1] :
( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ),
inference(cnf_transformation,[],[f18]) ).
fof(f36,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f18]) ).
fof(f37,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f18]) ).
fof(f38,plain,
! [X2,X0,X1] :
( member(X2,X0)
| ~ member(X2,difference(X0,X1)) ),
inference(cnf_transformation,[],[f20]) ).
fof(f40,plain,
! [X2,X0,X1] :
( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f20]) ).
fof(f41,plain,
! [X3,X0,X1] :
( member(X3,X1)
| ~ member(X3,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f42,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK1(X0,X1),X0) ),
inference(cnf_transformation,[],[f24]) ).
fof(f43,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK1(X0,X1),X1) ),
inference(cnf_transformation,[],[f24]) ).
fof(f46,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f26]) ).
fof(f53,plain,
subset(sK3,sK4),
inference(cnf_transformation,[],[f32]) ).
fof(f54,plain,
sK4 != union(sK3,difference(sK4,sK3)),
inference(cnf_transformation,[],[f32]) ).
cnf(c_49,plain,
( ~ member(sK0(X0,X1),X0)
| ~ member(sK0(X0,X1),X1)
| X0 = X1 ),
inference(cnf_transformation,[],[f34]) ).
cnf(c_50,plain,
( X0 = X1
| member(sK0(X0,X1),X0)
| member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f33]) ).
cnf(c_51,plain,
( ~ member(X0,X1)
| member(X0,union(X2,X1)) ),
inference(cnf_transformation,[],[f37]) ).
cnf(c_52,plain,
( ~ member(X0,X1)
| member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f36]) ).
cnf(c_53,plain,
( ~ member(X0,union(X1,X2))
| member(X0,X1)
| member(X0,X2) ),
inference(cnf_transformation,[],[f35]) ).
cnf(c_54,plain,
( ~ member(X0,X1)
| member(X0,difference(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f40]) ).
cnf(c_56,plain,
( ~ member(X0,difference(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_57,plain,
( ~ member(sK1(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f43]) ).
cnf(c_58,plain,
( member(sK1(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f42]) ).
cnf(c_59,plain,
( ~ member(X0,X1)
| ~ subset(X1,X2)
| member(X0,X2) ),
inference(cnf_transformation,[],[f41]) ).
cnf(c_60,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f46]) ).
cnf(c_67,negated_conjecture,
union(sK3,difference(sK4,sK3)) != sK4,
inference(cnf_transformation,[],[f54]) ).
cnf(c_68,negated_conjecture,
subset(sK3,sK4),
inference(cnf_transformation,[],[f53]) ).
cnf(c_557,plain,
( union(sK3,difference(sK4,sK3)) = sK4
| member(sK0(union(sK3,difference(sK4,sK3)),sK4),union(sK3,difference(sK4,sK3)))
| member(sK0(union(sK3,difference(sK4,sK3)),sK4),sK4) ),
inference(instantiation,[status(thm)],[c_50]) ).
cnf(c_619,plain,
( ~ member(sK0(union(sK3,difference(sK4,sK3)),sK4),union(sK3,difference(sK4,sK3)))
| ~ subset(union(sK3,difference(sK4,sK3)),X0)
| member(sK0(union(sK3,difference(sK4,sK3)),sK4),X0) ),
inference(instantiation,[status(thm)],[c_59]) ).
cnf(c_721,plain,
( ~ member(sK1(sK4,union(sK3,difference(sK4,sK3))),sK4)
| member(sK1(sK4,union(sK3,difference(sK4,sK3))),difference(sK4,X0))
| member(sK1(sK4,union(sK3,difference(sK4,sK3))),X0) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_728,plain,
( ~ member(sK1(sK4,union(sK3,difference(sK4,sK3))),sK4)
| member(sK1(sK4,union(sK3,difference(sK4,sK3))),difference(sK4,sK3))
| member(sK1(sK4,union(sK3,difference(sK4,sK3))),sK3) ),
inference(instantiation,[status(thm)],[c_721]) ).
cnf(c_756,plain,
( ~ member(sK0(union(sK3,difference(sK4,sK3)),sK4),union(sK3,difference(sK4,sK3)))
| ~ member(sK0(union(sK3,difference(sK4,sK3)),sK4),sK4)
| union(sK3,difference(sK4,sK3)) = sK4 ),
inference(instantiation,[status(thm)],[c_49]) ).
cnf(c_757,plain,
( ~ member(sK0(union(sK3,difference(sK4,sK3)),sK4),sK4)
| member(sK0(union(sK3,difference(sK4,sK3)),sK4),difference(sK4,X0))
| member(sK0(union(sK3,difference(sK4,sK3)),sK4),X0) ),
inference(instantiation,[status(thm)],[c_54]) ).
cnf(c_764,plain,
( ~ member(sK0(union(sK3,difference(sK4,sK3)),sK4),sK4)
| member(sK0(union(sK3,difference(sK4,sK3)),sK4),difference(sK4,sK3))
| member(sK0(union(sK3,difference(sK4,sK3)),sK4),sK3) ),
inference(instantiation,[status(thm)],[c_757]) ).
cnf(c_828,plain,
( ~ subset(union(sK3,difference(sK4,sK3)),sK4)
| ~ subset(sK4,union(sK3,difference(sK4,sK3))) ),
inference(resolution,[status(thm)],[c_60,c_67]) ).
cnf(c_854,plain,
( ~ member(sK1(union(sK3,difference(sK4,sK3)),sK4),sK4)
| ~ subset(sK4,union(sK3,difference(sK4,sK3))) ),
inference(resolution,[status(thm)],[c_828,c_57]) ).
cnf(c_889,plain,
( ~ member(sK1(union(sK3,difference(sK4,sK3)),sK4),sK4)
| member(sK1(sK4,union(sK3,difference(sK4,sK3))),sK4) ),
inference(resolution,[status(thm)],[c_854,c_58]) ).
cnf(c_890,plain,
( ~ member(sK1(sK4,union(sK3,difference(sK4,sK3))),union(sK3,difference(sK4,sK3)))
| ~ member(sK1(union(sK3,difference(sK4,sK3)),sK4),sK4) ),
inference(resolution,[status(thm)],[c_854,c_57]) ).
cnf(c_921,plain,
( ~ member(sK1(sK4,union(sK3,difference(sK4,sK3))),difference(sK4,sK3))
| ~ member(sK1(union(sK3,difference(sK4,sK3)),sK4),sK4) ),
inference(resolution,[status(thm)],[c_890,c_51]) ).
cnf(c_922,plain,
( ~ member(sK1(union(sK3,difference(sK4,sK3)),sK4),sK4)
| ~ member(sK1(sK4,union(sK3,difference(sK4,sK3))),sK3) ),
inference(resolution,[status(thm)],[c_890,c_52]) ).
cnf(c_923,plain,
~ member(sK1(union(sK3,difference(sK4,sK3)),sK4),sK4),
inference(global_subsumption_just,[status(thm)],[c_922,c_728,c_889,c_921,c_922]) ).
cnf(c_928,plain,
~ member(sK1(union(sK3,difference(sK4,sK3)),sK4),difference(sK4,X0)),
inference(resolution,[status(thm)],[c_923,c_56]) ).
cnf(c_931,plain,
( ~ member(sK1(union(sK3,difference(sK4,sK3)),sK4),X0)
| ~ subset(X0,sK4) ),
inference(resolution,[status(thm)],[c_923,c_59]) ).
cnf(c_932,plain,
( ~ member(sK1(union(sK3,difference(sK4,sK3)),sK4),sK3)
| ~ subset(sK3,sK4) ),
inference(instantiation,[status(thm)],[c_931]) ).
cnf(c_937,plain,
( ~ member(sK1(union(sK3,difference(sK4,sK3)),sK4),union(X0,difference(sK4,X1)))
| member(sK1(union(sK3,difference(sK4,sK3)),sK4),X0) ),
inference(resolution,[status(thm)],[c_928,c_53]) ).
cnf(c_940,plain,
( ~ member(sK1(union(sK3,difference(sK4,sK3)),sK4),union(sK3,difference(sK4,sK3)))
| member(sK1(union(sK3,difference(sK4,sK3)),sK4),sK3) ),
inference(instantiation,[status(thm)],[c_937]) ).
cnf(c_964,plain,
( member(sK1(union(sK3,difference(sK4,sK3)),sK4),union(sK3,difference(sK4,sK3)))
| subset(union(sK3,difference(sK4,sK3)),sK4) ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_1575,plain,
( ~ member(sK0(union(sK3,difference(sK4,sK3)),sK4),difference(sK4,X0))
| member(sK0(union(sK3,difference(sK4,sK3)),sK4),union(X1,difference(sK4,X0))) ),
inference(instantiation,[status(thm)],[c_51]) ).
cnf(c_1576,plain,
( ~ member(sK0(union(sK3,difference(sK4,sK3)),sK4),difference(sK4,sK3))
| member(sK0(union(sK3,difference(sK4,sK3)),sK4),union(sK3,difference(sK4,sK3))) ),
inference(instantiation,[status(thm)],[c_1575]) ).
cnf(c_2337,plain,
( ~ member(sK0(union(sK3,difference(sK4,sK3)),sK4),union(sK3,difference(sK4,sK3)))
| ~ subset(union(sK3,difference(sK4,sK3)),sK4)
| member(sK0(union(sK3,difference(sK4,sK3)),sK4),sK4) ),
inference(instantiation,[status(thm)],[c_619]) ).
cnf(c_3268,plain,
( ~ member(sK0(union(sK3,difference(sK4,sK3)),sK4),union(sK3,difference(sK4,sK3)))
| ~ member(sK0(union(sK3,difference(sK4,sK3)),sK4),sK4) ),
inference(resolution,[status(thm)],[c_49,c_67]) ).
cnf(c_3269,plain,
~ member(sK0(union(sK3,difference(sK4,sK3)),sK4),union(sK3,difference(sK4,sK3))),
inference(global_subsumption_just,[status(thm)],[c_3268,c_68,c_67,c_756,c_932,c_940,c_964,c_2337]) ).
cnf(c_3297,plain,
~ member(sK0(union(sK3,difference(sK4,sK3)),sK4),sK3),
inference(resolution,[status(thm)],[c_3269,c_52]) ).
cnf(c_3298,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_3297,c_3269,c_1576,c_764,c_557,c_67]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET595+3 : TPTP v8.1.2. Released v2.2.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n023.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sat Aug 26 12:38:41 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.19/0.48 Running first-order theorem proving
% 0.19/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.70/1.12 % SZS status Started for theBenchmark.p
% 3.70/1.12 % SZS status Theorem for theBenchmark.p
% 3.70/1.12
% 3.70/1.12 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.70/1.12
% 3.70/1.12 ------ iProver source info
% 3.70/1.12
% 3.70/1.12 git: date: 2023-05-31 18:12:56 +0000
% 3.70/1.12 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.70/1.12 git: non_committed_changes: false
% 3.70/1.12 git: last_make_outside_of_git: false
% 3.70/1.12
% 3.70/1.12 ------ Parsing...
% 3.70/1.12 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.70/1.12
% 3.70/1.12 ------ Preprocessing... sup_sim: 0 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.70/1.12
% 3.70/1.12 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.70/1.12
% 3.70/1.12 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 3.70/1.12 ------ Proving...
% 3.70/1.12 ------ Problem Properties
% 3.70/1.12
% 3.70/1.12
% 3.70/1.12 clauses 18
% 3.70/1.12 conjectures 2
% 3.70/1.12 EPR 4
% 3.70/1.12 Horn 13
% 3.70/1.12 unary 4
% 3.70/1.12 binary 6
% 3.70/1.12 lits 40
% 3.70/1.12 lits eq 7
% 3.70/1.12 fd_pure 0
% 3.70/1.12 fd_pseudo 0
% 3.70/1.12 fd_cond 0
% 3.70/1.12 fd_pseudo_cond 5
% 3.70/1.12 AC symbols 0
% 3.70/1.12
% 3.70/1.12 ------ Input Options Time Limit: Unbounded
% 3.70/1.12
% 3.70/1.12
% 3.70/1.12 ------
% 3.70/1.12 Current options:
% 3.70/1.12 ------
% 3.70/1.12
% 3.70/1.12
% 3.70/1.12
% 3.70/1.12
% 3.70/1.12 ------ Proving...
% 3.70/1.12
% 3.70/1.12
% 3.70/1.12 % SZS status Theorem for theBenchmark.p
% 3.70/1.12
% 3.70/1.12 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.70/1.12
% 3.70/1.12
%------------------------------------------------------------------------------