%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SET951+1 : TPTP v9.2.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n024.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 : Tue May 5 05:09:02 PM UTC 2026
% Result : Theorem 21.70s 13.39s
% Output : CNFRefutation 21.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 7
% Syntax : Number of formulae : 62 ( 14 unt; 0 def)
% Number of atoms : 190 ( 73 equ)
% Maximal formula atoms : 28 ( 3 avg)
% Number of connectives : 232 ( 104 ~; 99 |; 24 &)
% ( 4 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 16 ( 16 usr; 5 con; 0-4 aty)
% Number of variables : 202 ( 22 sgn 64 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t104_zfmisc_1,conjecture,
! [X1,X2,X3,X4,X5] :
~ ( in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5)))
& ! [X6,X7] :
~ ( X1 = ordered_pair(X6,X7)
& in(X6,set_intersection2(X2,X4))
& in(X7,set_intersection2(X3,X5)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t104_zfmisc_1) ).
fof(t33_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( ordered_pair(X1,X2) = ordered_pair(X3,X4)
=> ( X1 = X3
& X2 = X4 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t33_zfmisc_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d5_tarski) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(d2_zfmisc_1,axiom,
! [X1,X2,X3] :
( X3 = cartesian_product2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ? [X5,X6] :
( in(X5,X1)
& in(X6,X2)
& X4 = ordered_pair(X5,X6) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d2_zfmisc_1) ).
fof(d3_xboole_0,axiom,
! [X1,X2,X3] :
( X3 = set_intersection2(X1,X2)
<=> ! [X4] :
( in(X4,X3)
<=> ( in(X4,X1)
& in(X4,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_xboole_0) ).
fof(commutativity_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X2) = set_intersection2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_k3_xboole_0) ).
fof(c_0_7,negated_conjecture,
~ ! [X1,X2,X3,X4,X5] :
~ ( in(X1,set_intersection2(cartesian_product2(X2,X3),cartesian_product2(X4,X5)))
& ! [X6,X7] :
~ ( X1 = ordered_pair(X6,X7)
& in(X6,set_intersection2(X2,X4))
& in(X7,set_intersection2(X3,X5)) ) ),
inference(assume_negation,[status(cth)],[t104_zfmisc_1]) ).
fof(c_0_8,plain,
! [X89,X90,X91,X92] :
( ( X89 = X91
| ordered_pair(X89,X90) != ordered_pair(X91,X92) )
& ( X90 = X92
| ordered_pair(X89,X90) != ordered_pair(X91,X92) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t33_zfmisc_1])])]) ).
fof(c_0_9,plain,
! [X75,X76] : ordered_pair(X75,X76) = unordered_pair(unordered_pair(X75,X76),singleton(X75)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_10,negated_conjecture,
! [X87,X88] :
( in(esk9_0,set_intersection2(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk12_0,esk13_0)))
& ( esk9_0 != ordered_pair(X87,X88)
| ~ in(X87,set_intersection2(esk10_0,esk12_0))
| ~ in(X88,set_intersection2(esk11_0,esk13_0)) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])]) ).
cnf(c_0_11,plain,
( X1 = X2
| ordered_pair(X1,X3) != ordered_pair(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X45,X46] : unordered_pair(X45,X46) = unordered_pair(X46,X45),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_14,plain,
( X1 = X2
| ordered_pair(X3,X1) != ordered_pair(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_15,plain,
! [X49,X50,X51,X52,X55,X56,X57,X58,X59,X60,X62,X63] :
( ( in(esk1_4(X49,X50,X51,X52),X49)
| ~ in(X52,X51)
| X51 != cartesian_product2(X49,X50) )
& ( in(esk2_4(X49,X50,X51,X52),X50)
| ~ in(X52,X51)
| X51 != cartesian_product2(X49,X50) )
& ( X52 = ordered_pair(esk1_4(X49,X50,X51,X52),esk2_4(X49,X50,X51,X52))
| ~ in(X52,X51)
| X51 != cartesian_product2(X49,X50) )
& ( ~ in(X56,X49)
| ~ in(X57,X50)
| X55 != ordered_pair(X56,X57)
| in(X55,X51)
| X51 != cartesian_product2(X49,X50) )
& ( ~ in(esk3_3(X58,X59,X60),X60)
| ~ in(X62,X58)
| ~ in(X63,X59)
| esk3_3(X58,X59,X60) != ordered_pair(X62,X63)
| X60 = cartesian_product2(X58,X59) )
& ( in(esk4_3(X58,X59,X60),X58)
| in(esk3_3(X58,X59,X60),X60)
| X60 = cartesian_product2(X58,X59) )
& ( in(esk5_3(X58,X59,X60),X59)
| in(esk3_3(X58,X59,X60),X60)
| X60 = cartesian_product2(X58,X59) )
& ( esk3_3(X58,X59,X60) = ordered_pair(esk4_3(X58,X59,X60),esk5_3(X58,X59,X60))
| in(esk3_3(X58,X59,X60),X60)
| X60 = cartesian_product2(X58,X59) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d2_zfmisc_1])])])])])]) ).
cnf(c_0_16,negated_conjecture,
( esk9_0 != ordered_pair(X1,X2)
| ~ in(X1,set_intersection2(esk10_0,esk12_0))
| ~ in(X2,set_intersection2(esk11_0,esk13_0)) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,plain,
( X1 = X2
| unordered_pair(unordered_pair(X1,X3),singleton(X1)) != unordered_pair(unordered_pair(X2,X4),singleton(X2)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_12]) ).
cnf(c_0_18,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( X1 = X2
| unordered_pair(unordered_pair(X3,X1),singleton(X3)) != unordered_pair(unordered_pair(X4,X2),singleton(X4)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_12]),c_0_12]) ).
cnf(c_0_20,plain,
( X1 = ordered_pair(esk1_4(X2,X3,X4,X1),esk2_4(X2,X3,X4,X1))
| ~ in(X1,X4)
| X4 != cartesian_product2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,negated_conjecture,
( esk9_0 != unordered_pair(unordered_pair(X1,X2),singleton(X1))
| ~ in(X2,set_intersection2(esk11_0,esk13_0))
| ~ in(X1,set_intersection2(esk10_0,esk12_0)) ),
inference(rw,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_22,plain,
( X1 = X2
| unordered_pair(singleton(X1),unordered_pair(X1,X3)) != unordered_pair(singleton(X2),unordered_pair(X2,X4)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_18]) ).
cnf(c_0_23,plain,
( X1 = X2
| unordered_pair(singleton(X3),unordered_pair(X3,X1)) != unordered_pair(singleton(X4),unordered_pair(X4,X2)) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_18]),c_0_18]) ).
cnf(c_0_24,plain,
( X1 = unordered_pair(unordered_pair(esk1_4(X2,X3,X4,X1),esk2_4(X2,X3,X4,X1)),singleton(esk1_4(X2,X3,X4,X1)))
| X4 != cartesian_product2(X2,X3)
| ~ in(X1,X4) ),
inference(rw,[status(thm)],[c_0_20,c_0_12]) ).
cnf(c_0_25,negated_conjecture,
( unordered_pair(singleton(X1),unordered_pair(X1,X2)) != esk9_0
| ~ in(X2,set_intersection2(esk11_0,esk13_0))
| ~ in(X1,set_intersection2(esk10_0,esk12_0)) ),
inference(rw,[status(thm)],[c_0_21,c_0_18]) ).
fof(c_0_26,plain,
! [X66,X67,X68,X69,X70,X71,X72,X73] :
( ( in(X69,X66)
| ~ in(X69,X68)
| X68 != set_intersection2(X66,X67) )
& ( in(X69,X67)
| ~ in(X69,X68)
| X68 != set_intersection2(X66,X67) )
& ( ~ in(X70,X66)
| ~ in(X70,X67)
| in(X70,X68)
| X68 != set_intersection2(X66,X67) )
& ( ~ in(esk6_3(X71,X72,X73),X73)
| ~ in(esk6_3(X71,X72,X73),X71)
| ~ in(esk6_3(X71,X72,X73),X72)
| X73 = set_intersection2(X71,X72) )
& ( in(esk6_3(X71,X72,X73),X71)
| in(esk6_3(X71,X72,X73),X73)
| X73 = set_intersection2(X71,X72) )
& ( in(esk6_3(X71,X72,X73),X72)
| in(esk6_3(X71,X72,X73),X73)
| X73 = set_intersection2(X71,X72) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_xboole_0])])])])])]) ).
cnf(c_0_27,plain,
( X1 = X2
| unordered_pair(singleton(X1),unordered_pair(X1,X3)) != unordered_pair(singleton(X2),unordered_pair(X4,X2)) ),
inference(spm,[status(thm)],[c_0_22,c_0_18]) ).
cnf(c_0_28,plain,
( in(esk2_4(X1,X2,X3,X4),X2)
| ~ in(X4,X3)
| X3 != cartesian_product2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_29,plain,
( X1 = X2
| unordered_pair(singleton(X3),unordered_pair(X3,X1)) != unordered_pair(singleton(X4),unordered_pair(X2,X4)) ),
inference(spm,[status(thm)],[c_0_23,c_0_18]) ).
cnf(c_0_30,plain,
( unordered_pair(singleton(esk1_4(X1,X2,cartesian_product2(X1,X2),X3)),unordered_pair(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),esk1_4(X1,X2,cartesian_product2(X1,X2),X3))) = X3
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_18]),c_0_18])]) ).
cnf(c_0_31,negated_conjecture,
( unordered_pair(singleton(X1),unordered_pair(X2,X1)) != esk9_0
| ~ in(X2,set_intersection2(esk11_0,esk13_0))
| ~ in(X1,set_intersection2(esk10_0,esk12_0)) ),
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_32,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X1,X3)
| X4 != set_intersection2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,plain,
( in(esk1_4(X1,X2,X3,X4),X1)
| ~ in(X4,X3)
| X3 != cartesian_product2(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_34,plain,
( X1 = X2
| unordered_pair(singleton(X1),unordered_pair(X3,X1)) != unordered_pair(singleton(X2),unordered_pair(X4,X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_18]) ).
cnf(c_0_35,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X4,X2) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
fof(c_0_36,plain,
! [X47,X48] : set_intersection2(X47,X48) = set_intersection2(X48,X47),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
cnf(c_0_37,plain,
( in(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),X2)
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_28]) ).
cnf(c_0_38,plain,
( esk2_4(X1,X2,cartesian_product2(X1,X2),unordered_pair(singleton(X3),unordered_pair(X3,X4))) = X4
| ~ in(unordered_pair(singleton(X3),unordered_pair(X3,X4)),cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_39,negated_conjecture,
( ~ in(esk2_4(X1,X2,cartesian_product2(X1,X2),esk9_0),set_intersection2(esk11_0,esk13_0))
| ~ in(esk1_4(X1,X2,cartesian_product2(X1,X2),esk9_0),set_intersection2(esk10_0,esk12_0))
| ~ in(esk9_0,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_30])]) ).
cnf(c_0_40,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X3)
| ~ in(X1,X2) ),
inference(er,[status(thm)],[c_0_32]) ).
cnf(c_0_41,plain,
( in(esk1_4(X1,X2,cartesian_product2(X1,X2),X3),X1)
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[c_0_33]) ).
cnf(c_0_42,plain,
( esk1_4(X1,X2,cartesian_product2(X1,X2),unordered_pair(singleton(X3),unordered_pair(X4,X3))) = X3
| ~ in(unordered_pair(singleton(X3),unordered_pair(X4,X3)),cartesian_product2(X1,X2)) ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_30])]) ).
cnf(c_0_43,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(er,[status(thm)],[c_0_35]) ).
cnf(c_0_44,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
cnf(c_0_45,plain,
( in(X1,X2)
| ~ in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),cartesian_product2(X4,X2)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_46,negated_conjecture,
( ~ in(esk2_4(X1,X2,cartesian_product2(X1,X2),esk9_0),set_intersection2(esk11_0,esk13_0))
| ~ in(esk1_4(X1,X2,cartesian_product2(X1,X2),esk9_0),esk12_0)
| ~ in(esk1_4(X1,X2,cartesian_product2(X1,X2),esk9_0),esk10_0)
| ~ in(esk9_0,cartesian_product2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_47,plain,
( in(X1,X2)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X3,X1)),cartesian_product2(X2,X4)) ),
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_48,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_49,negated_conjecture,
in(esk9_0,set_intersection2(cartesian_product2(esk10_0,esk11_0),cartesian_product2(esk12_0,esk13_0))),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_50,plain,
( in(X1,X2)
| ~ in(unordered_pair(singleton(X3),unordered_pair(X1,X3)),cartesian_product2(X4,X2)) ),
inference(spm,[status(thm)],[c_0_45,c_0_18]) ).
cnf(c_0_51,negated_conjecture,
( ~ in(esk1_4(X1,X2,cartesian_product2(X1,X2),esk9_0),esk12_0)
| ~ in(esk1_4(X1,X2,cartesian_product2(X1,X2),esk9_0),esk10_0)
| ~ in(esk2_4(X1,X2,cartesian_product2(X1,X2),esk9_0),esk13_0)
| ~ in(esk2_4(X1,X2,cartesian_product2(X1,X2),esk9_0),esk11_0)
| ~ in(esk9_0,cartesian_product2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_46,c_0_40]) ).
cnf(c_0_52,plain,
( in(esk1_4(X1,X2,cartesian_product2(X1,X2),X3),X4)
| ~ in(X3,cartesian_product2(X4,X5))
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_47,c_0_30]) ).
cnf(c_0_53,negated_conjecture,
in(esk9_0,cartesian_product2(esk10_0,esk11_0)),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,plain,
( in(esk2_4(X1,X2,cartesian_product2(X1,X2),X3),X4)
| ~ in(X3,cartesian_product2(X5,X4))
| ~ in(X3,cartesian_product2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_50,c_0_30]) ).
cnf(c_0_55,negated_conjecture,
in(esk9_0,cartesian_product2(esk12_0,esk13_0)),
inference(spm,[status(thm)],[c_0_43,c_0_49]) ).
cnf(c_0_56,negated_conjecture,
( ~ in(esk1_4(esk12_0,X1,cartesian_product2(esk12_0,X1),esk9_0),esk10_0)
| ~ in(esk2_4(esk12_0,X1,cartesian_product2(esk12_0,X1),esk9_0),esk13_0)
| ~ in(esk2_4(esk12_0,X1,cartesian_product2(esk12_0,X1),esk9_0),esk11_0)
| ~ in(esk9_0,cartesian_product2(esk12_0,X1)) ),
inference(spm,[status(thm)],[c_0_51,c_0_41]) ).
cnf(c_0_57,negated_conjecture,
( in(esk1_4(X1,X2,cartesian_product2(X1,X2),esk9_0),esk10_0)
| ~ in(esk9_0,cartesian_product2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,negated_conjecture,
( in(esk2_4(X1,X2,cartesian_product2(X1,X2),esk9_0),esk11_0)
| ~ in(esk9_0,cartesian_product2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_54,c_0_53]) ).
cnf(c_0_59,negated_conjecture,
( in(esk2_4(X1,X2,cartesian_product2(X1,X2),esk9_0),esk13_0)
| ~ in(esk9_0,cartesian_product2(X1,X2)) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_60,negated_conjecture,
~ in(esk9_0,cartesian_product2(esk12_0,X1)),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_59]) ).
cnf(c_0_61,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_55,c_0_60]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : SET951+1 : TPTP v9.2.1. Released v3.2.0.
% 0.00/0.11 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.06/0.30 % Computer : n024.cluster.edu
% 0.06/0.30 % Model : x86_64 x86_64
% 0.06/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.30 % Memory : 8042.1875MB
% 0.06/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.30 % CPULimit : 300
% 0.06/0.30 % WCLimit : 300
% 0.06/0.30 % DateTime : Mon May 4 21:39:42 EDT 2026
% 0.06/0.30 % CPUTime :
% 0.06/0.30 % start to proof: theBenchmark
% 21.70/13.39 % Version : CSE_E---1.7
% 21.70/13.39 % Problem : theBenchmark.p
% 21.70/13.39 % SZS status Theorem for theBenchmark.p
% 21.70/13.39 % SZS output start CNFRefutation
% See solution above
% 21.80/13.48 % Total time : 9.367s
%------------------------------------------------------------------------------