TSTP Solution File: SET608+3 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SET608+3 : TPTP v8.2.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n018.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 : Mon Jun 24 14:35:02 EDT 2024
% Result : Theorem 7.75s 1.67s
% Output : CNFRefutation 7.75s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named definition)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2] :
( member(X2,union(X0,X1))
<=> ( member(X2,X1)
| member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',union_defn) ).
fof(f2,axiom,
! [X0,X1,X2] :
( member(X2,intersection(X0,X1))
<=> ( member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',intersection_defn) ).
fof(f3,axiom,
! [X0,X1,X2] :
( member(X2,difference(X0,X1))
<=> ( ~ member(X2,X1)
& member(X2,X0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',difference_defn) ).
fof(f4,axiom,
! [X0,X1] :
( X0 = X1
<=> ( subset(X1,X0)
& subset(X0,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equal_defn) ).
fof(f5,axiom,
! [X0,X1] : union(X0,X1) = union(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_union) ).
fof(f6,axiom,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_intersection) ).
fof(f7,axiom,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X0)
=> member(X2,X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',subset_defn) ).
fof(f10,conjecture,
! [X0,X1] : union(intersection(X0,X1),difference(X0,X1)) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_union_intersection_difference) ).
fof(f11,negated_conjecture,
~ ! [X0,X1] : union(intersection(X0,X1),difference(X0,X1)) = X0,
inference(negated_conjecture,[],[f10]) ).
fof(f12,plain,
! [X0,X1] :
( subset(X0,X1)
<=> ! [X2] :
( member(X2,X1)
| ~ member(X2,X0) ) ),
inference(ennf_transformation,[],[f7]) ).
fof(f13,plain,
? [X0,X1] : union(intersection(X0,X1),difference(X0,X1)) != X0,
inference(ennf_transformation,[],[f11]) ).
fof(f14,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,[],[f1]) ).
fof(f15,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,[],[f14]) ).
fof(f16,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(nnf_transformation,[],[f2]) ).
fof(f17,plain,
! [X0,X1,X2] :
( ( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) )
& ( ( member(X2,X1)
& member(X2,X0) )
| ~ member(X2,intersection(X0,X1)) ) ),
inference(flattening,[],[f16]) ).
fof(f18,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(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(flattening,[],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(nnf_transformation,[],[f4]) ).
fof(f21,plain,
! [X0,X1] :
( ( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) )
& ( ( subset(X1,X0)
& subset(X0,X1) )
| X0 != X1 ) ),
inference(flattening,[],[f20]) ).
fof(f22,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(f23,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,[],[f22]) ).
fof(f24,plain,
! [X0,X1] :
( ? [X2] :
( ~ member(X2,X1)
& member(X2,X0) )
=> ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f25,plain,
! [X0,X1] :
( ( subset(X0,X1)
| ( ~ member(sK0(X0,X1),X1)
& member(sK0(X0,X1),X0) ) )
& ( ! [X3] :
( member(X3,X1)
| ~ member(X3,X0) )
| ~ subset(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f23,f24]) ).
fof(f30,plain,
( ? [X0,X1] : union(intersection(X0,X1),difference(X0,X1)) != X0
=> sK2 != union(intersection(sK2,sK3),difference(sK2,sK3)) ),
introduced(choice_axiom,[]) ).
fof(f31,plain,
sK2 != union(intersection(sK2,sK3),difference(sK2,sK3)),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2,sK3])],[f13,f30]) ).
fof(f32,plain,
! [X2,X0,X1] :
( member(X2,X1)
| member(X2,X0)
| ~ member(X2,union(X0,X1)) ),
inference(cnf_transformation,[],[f15]) ).
fof(f33,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f15]) ).
fof(f34,plain,
! [X2,X0,X1] :
( member(X2,union(X0,X1))
| ~ member(X2,X1) ),
inference(cnf_transformation,[],[f15]) ).
fof(f35,plain,
! [X2,X0,X1] :
( member(X2,X0)
| ~ member(X2,intersection(X0,X1)) ),
inference(cnf_transformation,[],[f17]) ).
fof(f37,plain,
! [X2,X0,X1] :
( member(X2,intersection(X0,X1))
| ~ member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f17]) ).
fof(f38,plain,
! [X2,X0,X1] :
( member(X2,X0)
| ~ member(X2,difference(X0,X1)) ),
inference(cnf_transformation,[],[f19]) ).
fof(f40,plain,
! [X2,X0,X1] :
( member(X2,difference(X0,X1))
| member(X2,X1)
| ~ member(X2,X0) ),
inference(cnf_transformation,[],[f19]) ).
fof(f43,plain,
! [X0,X1] :
( X0 = X1
| ~ subset(X1,X0)
| ~ subset(X0,X1) ),
inference(cnf_transformation,[],[f21]) ).
fof(f44,plain,
! [X0,X1] : union(X0,X1) = union(X1,X0),
inference(cnf_transformation,[],[f5]) ).
fof(f45,plain,
! [X0,X1] : intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f6]) ).
fof(f47,plain,
! [X0,X1] :
( subset(X0,X1)
| member(sK0(X0,X1),X0) ),
inference(cnf_transformation,[],[f25]) ).
fof(f48,plain,
! [X0,X1] :
( subset(X0,X1)
| ~ member(sK0(X0,X1),X1) ),
inference(cnf_transformation,[],[f25]) ).
fof(f54,plain,
sK2 != union(intersection(sK2,sK3),difference(sK2,sK3)),
inference(cnf_transformation,[],[f31]) ).
cnf(c_49,plain,
( ~ member(X0,X1)
| member(X0,union(X2,X1)) ),
inference(cnf_transformation,[],[f34]) ).
cnf(c_50,plain,
( ~ member(X0,X1)
| member(X0,union(X1,X2)) ),
inference(cnf_transformation,[],[f33]) ).
cnf(c_51,plain,
( ~ member(X0,union(X1,X2))
| member(X0,X1)
| member(X0,X2) ),
inference(cnf_transformation,[],[f32]) ).
cnf(c_52,plain,
( ~ member(X0,X1)
| ~ member(X0,X2)
| member(X0,intersection(X1,X2)) ),
inference(cnf_transformation,[],[f37]) ).
cnf(c_54,plain,
( ~ member(X0,intersection(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f35]) ).
cnf(c_55,plain,
( ~ member(X0,X1)
| member(X0,difference(X1,X2))
| member(X0,X2) ),
inference(cnf_transformation,[],[f40]) ).
cnf(c_57,plain,
( ~ member(X0,difference(X1,X2))
| member(X0,X1) ),
inference(cnf_transformation,[],[f38]) ).
cnf(c_58,plain,
( ~ subset(X0,X1)
| ~ subset(X1,X0)
| X0 = X1 ),
inference(cnf_transformation,[],[f43]) ).
cnf(c_61,plain,
union(X0,X1) = union(X1,X0),
inference(cnf_transformation,[],[f44]) ).
cnf(c_62,plain,
intersection(X0,X1) = intersection(X1,X0),
inference(cnf_transformation,[],[f45]) ).
cnf(c_63,plain,
( ~ member(sK0(X0,X1),X1)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f48]) ).
cnf(c_64,plain,
( member(sK0(X0,X1),X0)
| subset(X0,X1) ),
inference(cnf_transformation,[],[f47]) ).
cnf(c_69,negated_conjecture,
union(intersection(sK2,sK3),difference(sK2,sK3)) != sK2,
inference(cnf_transformation,[],[f54]) ).
cnf(c_404,plain,
intersection(sK2,sK3) = sP0_iProver_def,
definition ).
cnf(c_405,plain,
difference(sK2,sK3) = sP1_iProver_def,
definition ).
cnf(c_406,plain,
union(sP0_iProver_def,sP1_iProver_def) = sP2_iProver_def,
definition ).
cnf(c_407,negated_conjecture,
sP2_iProver_def != sK2,
inference(demodulation,[status(thm)],[c_69,c_405,c_404,c_406]) ).
cnf(c_707,plain,
( ~ member(X0,sP0_iProver_def)
| member(X0,sK2) ),
inference(superposition,[status(thm)],[c_404,c_54]) ).
cnf(c_718,plain,
( ~ member(X0,sP1_iProver_def)
| member(X0,sK2) ),
inference(superposition,[status(thm)],[c_405,c_57]) ).
cnf(c_789,plain,
( ~ member(sK0(X0,union(X1,X2)),X1)
| subset(X0,union(X1,X2)) ),
inference(superposition,[status(thm)],[c_50,c_63]) ).
cnf(c_790,plain,
( ~ member(sK0(X0,union(X1,X2)),X2)
| subset(X0,union(X1,X2)) ),
inference(superposition,[status(thm)],[c_49,c_63]) ).
cnf(c_810,plain,
( member(sK0(union(X0,X1),X2),X0)
| member(sK0(union(X0,X1),X2),X1)
| subset(union(X0,X1),X2) ),
inference(superposition,[status(thm)],[c_64,c_51]) ).
cnf(c_813,plain,
( ~ member(X0,sP2_iProver_def)
| member(X0,sP0_iProver_def)
| member(X0,sP1_iProver_def) ),
inference(superposition,[status(thm)],[c_406,c_51]) ).
cnf(c_872,plain,
( ~ subset(sK2,sP2_iProver_def)
| ~ subset(sP2_iProver_def,sK2)
| sP2_iProver_def = sK2 ),
inference(instantiation,[status(thm)],[c_58]) ).
cnf(c_876,plain,
( ~ member(sK0(sP2_iProver_def,sK2),sK2)
| subset(sP2_iProver_def,sK2) ),
inference(instantiation,[status(thm)],[c_63]) ).
cnf(c_884,plain,
( ~ member(X0,sK2)
| member(X0,sK3)
| member(X0,sP1_iProver_def) ),
inference(superposition,[status(thm)],[c_405,c_55]) ).
cnf(c_970,plain,
( member(sK0(sP2_iProver_def,X0),sP0_iProver_def)
| member(sK0(sP2_iProver_def,X0),sP1_iProver_def)
| subset(sP2_iProver_def,X0) ),
inference(superposition,[status(thm)],[c_64,c_813]) ).
cnf(c_989,plain,
( ~ member(X0,X1)
| ~ member(X0,X2)
| member(X0,intersection(X2,X1)) ),
inference(superposition,[status(thm)],[c_62,c_52]) ).
cnf(c_1148,plain,
( member(sK0(sK2,sP2_iProver_def),sK2)
| subset(sK2,sP2_iProver_def) ),
inference(instantiation,[status(thm)],[c_64]) ).
cnf(c_1892,plain,
subset(X0,union(X0,X1)),
inference(superposition,[status(thm)],[c_64,c_789]) ).
cnf(c_1906,plain,
( ~ member(sK0(X0,sP2_iProver_def),sP0_iProver_def)
| subset(X0,union(sP0_iProver_def,sP1_iProver_def)) ),
inference(superposition,[status(thm)],[c_406,c_789]) ).
cnf(c_1913,plain,
( ~ member(sK0(X0,sP2_iProver_def),sP0_iProver_def)
| subset(X0,sP2_iProver_def) ),
inference(light_normalisation,[status(thm)],[c_1906,c_406]) ).
cnf(c_1933,plain,
( ~ member(sK0(sK2,sP2_iProver_def),sP0_iProver_def)
| subset(sK2,sP2_iProver_def) ),
inference(instantiation,[status(thm)],[c_1913]) ).
cnf(c_2038,plain,
subset(X0,union(X1,X0)),
inference(superposition,[status(thm)],[c_61,c_1892]) ).
cnf(c_2050,plain,
( ~ subset(union(X0,X1),X1)
| union(X0,X1) = X1 ),
inference(superposition,[status(thm)],[c_2038,c_58]) ).
cnf(c_2305,plain,
( ~ member(sK0(X0,sP2_iProver_def),sP1_iProver_def)
| subset(X0,union(sP0_iProver_def,sP1_iProver_def)) ),
inference(superposition,[status(thm)],[c_406,c_790]) ).
cnf(c_2314,plain,
( ~ member(sK0(X0,sP2_iProver_def),sP1_iProver_def)
| subset(X0,sP2_iProver_def) ),
inference(light_normalisation,[status(thm)],[c_2305,c_406]) ).
cnf(c_2326,plain,
( ~ member(sK0(sK2,sP2_iProver_def),sP1_iProver_def)
| subset(sK2,sP2_iProver_def) ),
inference(instantiation,[status(thm)],[c_2314]) ).
cnf(c_2783,plain,
( member(sK0(union(X0,X1),X1),X0)
| subset(union(X0,X1),X1) ),
inference(superposition,[status(thm)],[c_810,c_63]) ).
cnf(c_2795,plain,
( member(sK0(union(X0,sP1_iProver_def),sP2_iProver_def),X0)
| subset(union(X0,sP1_iProver_def),sP2_iProver_def) ),
inference(superposition,[status(thm)],[c_810,c_2314]) ).
cnf(c_7080,plain,
( member(sK0(union(sP1_iProver_def,X0),X0),sK2)
| subset(union(sP1_iProver_def,X0),X0) ),
inference(superposition,[status(thm)],[c_2783,c_718]) ).
cnf(c_15026,plain,
( member(sK0(union(sP1_iProver_def,X0),sP2_iProver_def),X0)
| subset(union(X0,sP1_iProver_def),sP2_iProver_def) ),
inference(superposition,[status(thm)],[c_61,c_2795]) ).
cnf(c_17095,plain,
( ~ member(X0,sK2)
| ~ member(X0,sK3)
| member(X0,sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_404,c_989]) ).
cnf(c_18123,plain,
subset(union(sP1_iProver_def,sK2),sK2),
inference(superposition,[status(thm)],[c_7080,c_63]) ).
cnf(c_18153,plain,
union(sP1_iProver_def,sK2) = sK2,
inference(superposition,[status(thm)],[c_18123,c_2050]) ).
cnf(c_18160,plain,
( ~ member(sK0(X0,sK2),sP1_iProver_def)
| subset(X0,union(sP1_iProver_def,sK2)) ),
inference(superposition,[status(thm)],[c_18153,c_789]) ).
cnf(c_18220,plain,
( member(sK0(sK2,sP2_iProver_def),sK2)
| subset(union(sK2,sP1_iProver_def),sP2_iProver_def) ),
inference(superposition,[status(thm)],[c_18153,c_15026]) ).
cnf(c_18254,plain,
( ~ member(sK0(X0,sK2),sP1_iProver_def)
| subset(X0,sK2) ),
inference(light_normalisation,[status(thm)],[c_18160,c_18153]) ).
cnf(c_18770,plain,
( member(sK0(sP2_iProver_def,sK2),sP0_iProver_def)
| subset(sP2_iProver_def,sK2) ),
inference(superposition,[status(thm)],[c_970,c_18254]) ).
cnf(c_18788,plain,
( member(sK0(sP2_iProver_def,sK2),sK2)
| subset(sP2_iProver_def,sK2) ),
inference(superposition,[status(thm)],[c_18770,c_707]) ).
cnf(c_18815,plain,
subset(sP2_iProver_def,sK2),
inference(global_subsumption_just,[status(thm)],[c_18788,c_876,c_18788]) ).
cnf(c_19430,plain,
member(sK0(sK2,sP2_iProver_def),sK2),
inference(global_subsumption_just,[status(thm)],[c_18220,c_407,c_872,c_1148,c_18815]) ).
cnf(c_19433,plain,
( member(sK0(sK2,sP2_iProver_def),sK3)
| member(sK0(sK2,sP2_iProver_def),sP1_iProver_def) ),
inference(superposition,[status(thm)],[c_19430,c_884]) ).
cnf(c_20179,plain,
member(sK0(sK2,sP2_iProver_def),sK3),
inference(global_subsumption_just,[status(thm)],[c_19433,c_407,c_872,c_2326,c_18815,c_19433]) ).
cnf(c_20182,plain,
( ~ member(sK0(sK2,sP2_iProver_def),sK2)
| member(sK0(sK2,sP2_iProver_def),sP0_iProver_def) ),
inference(superposition,[status(thm)],[c_20179,c_17095]) ).
cnf(c_20185,plain,
member(sK0(sK2,sP2_iProver_def),sP0_iProver_def),
inference(forward_subsumption_resolution,[status(thm)],[c_20182,c_19430]) ).
cnf(c_20186,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_20185,c_18815,c_1933,c_872,c_407]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SET608+3 : TPTP v8.2.0. Released v2.2.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n018.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 : Sun Jun 23 13:39:24 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 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
% 7.75/1.67 % SZS status Started for theBenchmark.p
% 7.75/1.67 % SZS status Theorem for theBenchmark.p
% 7.75/1.67
% 7.75/1.67 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.75/1.67
% 7.75/1.67 ------ iProver source info
% 7.75/1.67
% 7.75/1.67 git: date: 2024-06-12 09:56:46 +0000
% 7.75/1.67 git: sha1: 4869ab62f0a3398f9d3a35e6db7918ebd3847e49
% 7.75/1.67 git: non_committed_changes: false
% 7.75/1.67
% 7.75/1.67 ------ Parsing...
% 7.75/1.67 ------ Clausification by vclausify_rel & Parsing by iProver...
% 7.75/1.67
% 7.75/1.67 ------ 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
% 7.75/1.67
% 7.75/1.67 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 7.75/1.67
% 7.75/1.67 ------ Preprocessing... sf_s rm: 1 0s sf_e sf_s rm: 0 0s sf_e
% 7.75/1.67 ------ Proving...
% 7.75/1.67 ------ Problem Properties
% 7.75/1.67
% 7.75/1.67
% 7.75/1.67 clauses 22
% 7.75/1.67 conjectures 1
% 7.75/1.67 EPR 4
% 7.75/1.67 Horn 18
% 7.75/1.67 unary 7
% 7.75/1.67 binary 8
% 7.75/1.67 lits 44
% 7.75/1.67 lits eq 9
% 7.75/1.67 fd_pure 0
% 7.75/1.67 fd_pseudo 0
% 7.75/1.67 fd_cond 0
% 7.75/1.67 fd_pseudo_cond 3
% 7.75/1.67 AC symbols 0
% 7.75/1.67
% 7.75/1.67 ------ Schedule dynamic 5 is on
% 7.75/1.67
% 7.75/1.67 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 7.75/1.67
% 7.75/1.67
% 7.75/1.67 ------
% 7.75/1.67 Current options:
% 7.75/1.67 ------
% 7.75/1.67
% 7.75/1.67
% 7.75/1.67
% 7.75/1.67
% 7.75/1.67 ------ Proving...
% 7.75/1.67
% 7.75/1.67
% 7.75/1.67 % SZS status Theorem for theBenchmark.p
% 7.75/1.67
% 7.75/1.67 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.75/1.67
% 7.75/1.68
%------------------------------------------------------------------------------