%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU122+2 : TPTP v9.2.1. Released v3.3.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 : 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 : Tue May 5 05:10:40 PM UTC 2026
% Result : Theorem 0.27s 1.61s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : ERROR: Analysing output (Could not find formula named 47)
% Comments :
%------------------------------------------------------------------------------
fof(t4_xboole_0,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t4_xboole_0) ).
fof(t3_xboole_0,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] :
~ ( in(X3,X1)
& in(X3,X2) ) )
& ~ ( ? [X3] :
( in(X3,X1)
& in(X3,X2) )
& disjoint(X1,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t3_xboole_0) ).
fof(antisymmetry_r2_hidden,axiom,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',antisymmetry_r2_hidden) ).
fof(d1_xboole_0,axiom,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d1_xboole_0) ).
fof(t2_xboole_1,conjecture,
! [X1] : subset(empty_set,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_xboole_1) ).
fof(rc2_xboole_0,axiom,
? [X1] : ~ empty(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc2_xboole_0) ).
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(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_tarski) ).
fof(t1_xboole_1,lemma,
! [X1,X2,X3] :
( ( subset(X1,X2)
& subset(X2,X3) )
=> subset(X1,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_xboole_1) ).
fof(symmetry_r1_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
=> disjoint(X2,X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',symmetry_r1_xboole_0) ).
fof(d7_xboole_0,axiom,
! [X1,X2] :
( disjoint(X1,X2)
<=> set_intersection2(X1,X2) = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d7_xboole_0) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( in(X1,X2)
& empty(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
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(t8_boole,axiom,
! [X1,X2] :
~ ( empty(X1)
& X1 != X2
& empty(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t8_boole) ).
fof(idempotence_k3_xboole_0,axiom,
! [X1,X2] : set_intersection2(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_k3_xboole_0) ).
fof(reflexivity_r1_tarski,axiom,
! [X1,X2] : subset(X1,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',reflexivity_r1_tarski) ).
fof(t6_boole,axiom,
! [X1] :
( empty(X1)
=> X1 = empty_set ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t6_boole) ).
fof(rc1_xboole_0,axiom,
? [X1] : empty(X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',rc1_xboole_0) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(i_0_19,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] : ~ in(X3,set_intersection2(X1,X2)) )
& ~ ( ? [X3] : in(X3,set_intersection2(X1,X2))
& disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[t4_xboole_0]) ).
fof(i_0_20,lemma,
! [X1,X2] :
( ~ ( ~ disjoint(X1,X2)
& ! [X3] :
~ ( in(X3,X1)
& in(X3,X2) ) )
& ~ ( ? [X3] :
( in(X3,X1)
& in(X3,X2) )
& disjoint(X1,X2) ) ),
inference(fof_simplification,[status(thm)],[t3_xboole_0]) ).
fof(i_0_21,plain,
! [X1,X2] :
( in(X1,X2)
=> ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[antisymmetry_r2_hidden]) ).
fof(i_0_22,plain,
! [X1] :
( X1 = empty_set
<=> ! [X2] : ~ in(X2,X1) ),
inference(fof_simplification,[status(thm)],[d1_xboole_0]) ).
fof(i_0_23,negated_conjecture,
~ ! [X1] : subset(empty_set,X1),
inference(assume_negation,[status(cth)],[t2_xboole_1]) ).
fof(i_0_24,plain,
? [X1] : ~ empty(X1),
inference(fof_simplification,[status(thm)],[rc2_xboole_0]) ).
fof(i_0_25,plain,
! [X59,X60,X61,X62,X63,X64,X65,X66] :
( ( in(X62,X59)
| ~ in(X62,X61)
| X61 != set_intersection2(X59,X60) )
& ( in(X62,X60)
| ~ in(X62,X61)
| X61 != set_intersection2(X59,X60) )
& ( ~ in(X63,X59)
| ~ in(X63,X60)
| in(X63,X61)
| X61 != set_intersection2(X59,X60) )
& ( ~ in(esk3_3(X64,X65,X66),X66)
| ~ in(esk3_3(X64,X65,X66),X64)
| ~ in(esk3_3(X64,X65,X66),X65)
| X66 = set_intersection2(X64,X65) )
& ( in(esk3_3(X64,X65,X66),X64)
| in(esk3_3(X64,X65,X66),X66)
| X66 = set_intersection2(X64,X65) )
& ( in(esk3_3(X64,X65,X66),X65)
| in(esk3_3(X64,X65,X66),X66)
| X66 = set_intersection2(X64,X65) ) ),
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])])])])])]) ).
fof(i_0_26,lemma,
! [X86,X87,X89,X90,X91] :
( ( disjoint(X86,X87)
| in(esk8_2(X86,X87),set_intersection2(X86,X87)) )
& ( ~ in(X91,set_intersection2(X89,X90))
| ~ disjoint(X89,X90) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_19])])])])]) ).
fof(i_0_27,plain,
! [X53,X54,X55,X56,X57] :
( ( ~ subset(X53,X54)
| ~ in(X55,X53)
| in(X55,X54) )
& ( in(esk2_2(X56,X57),X56)
| subset(X56,X57) )
& ( ~ in(esk2_2(X56,X57),X57)
| subset(X56,X57) ) ),
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_tarski])])])])])]) ).
fof(i_0_28,lemma,
! [X80,X81,X83,X84,X85] :
( ( in(esk7_2(X80,X81),X80)
| disjoint(X80,X81) )
& ( in(esk7_2(X80,X81),X81)
| disjoint(X80,X81) )
& ( ~ in(X85,X83)
| ~ in(X85,X84)
| ~ disjoint(X83,X84) ) ),
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)],[i_0_20])])])])])]) ).
fof(i_0_29,lemma,
! [X76,X77,X78] :
( ~ subset(X76,X77)
| ~ subset(X77,X78)
| subset(X76,X78) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_xboole_1])]) ).
fof(i_0_30,plain,
! [X45,X46] :
( ~ in(X45,X46)
| ~ in(X46,X45) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_21])]) ).
fof(i_0_31,plain,
! [X74,X75] :
( ~ disjoint(X74,X75)
| disjoint(X75,X74) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[symmetry_r1_xboole_0])]) ).
fof(i_0_32,plain,
! [X68,X69] :
( ( ~ disjoint(X68,X69)
| set_intersection2(X68,X69) = empty_set )
& ( set_intersection2(X68,X69) != empty_set
| disjoint(X68,X69) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d7_xboole_0])]) ).
fof(i_0_33,plain,
! [X93,X94] :
( ~ in(X93,X94)
| ~ empty(X94) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])]) ).
fof(i_0_34,plain,
! [X47,X48] : set_intersection2(X47,X48) = set_intersection2(X48,X47),
inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).
fof(i_0_35,plain,
! [X49,X50,X51] :
( ( X49 != empty_set
| ~ in(X50,X49) )
& ( in(esk1_1(X51),X51)
| X51 = empty_set ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_22])])])])]) ).
fof(i_0_36,negated_conjecture,
~ subset(empty_set,esk6_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[i_0_23])])]) ).
fof(i_0_37,plain,
! [X95,X96] :
( ~ empty(X95)
| X95 = X96
| ~ empty(X96) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t8_boole])]) ).
fof(i_0_38,plain,
! [X70] : set_intersection2(X70,X70) = X70,
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[idempotence_k3_xboole_0])]) ).
fof(i_0_39,plain,
! [X73] : subset(X73,X73),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).
fof(i_0_40,plain,
! [X92] :
( ~ empty(X92)
| X92 = empty_set ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t6_boole])]) ).
fof(i_0_41,plain,
~ empty(esk5_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[i_0_24])]) ).
fof(i_0_42,plain,
empty(esk4_0),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[rc1_xboole_0])]) ).
cnf(i_0_43,plain,
( X3 = set_intersection2(X1,X2)
| ~ in(esk3_3(X1,X2,X3),X3)
| ~ in(esk3_3(X1,X2,X3),X1)
| ~ in(esk3_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[i_0_25]),
[final] ).
cnf(i_0_44,plain,
( in(esk3_3(X1,X2,X3),X1)
| in(esk3_3(X1,X2,X3),X3)
| X3 = set_intersection2(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_25]),
[final] ).
cnf(i_0_45,plain,
( in(esk3_3(X1,X2,X3),X2)
| in(esk3_3(X1,X2,X3),X3)
| X3 = set_intersection2(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_25]),
[final] ).
cnf(i_0_46,lemma,
( ~ in(X1,set_intersection2(X2,X3))
| ~ disjoint(X2,X3) ),
inference(split_conjunct,[status(thm)],[i_0_26]),
[final] ).
cnf(i_0_47,plain,
( in(X1,X4)
| ~ in(X1,X2)
| ~ in(X1,X3)
| X4 != set_intersection2(X2,X3) ),
inference(split_conjunct,[status(thm)],[i_0_25]),
[final] ).
cnf(i_0_48,lemma,
( disjoint(X1,X2)
| in(esk8_2(X1,X2),set_intersection2(X1,X2)) ),
inference(split_conjunct,[status(thm)],[i_0_26]),
[final] ).
cnf(i_0_49,plain,
( subset(X1,X2)
| ~ in(esk2_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[i_0_27]),
[final] ).
cnf(i_0_50,lemma,
( ~ in(X1,X2)
| ~ in(X1,X3)
| ~ disjoint(X2,X3) ),
inference(split_conjunct,[status(thm)],[i_0_28]),
[final] ).
cnf(i_0_51,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X2,X4) ),
inference(split_conjunct,[status(thm)],[i_0_25]),
[final] ).
cnf(i_0_52,plain,
( in(X1,X2)
| ~ in(X1,X3)
| X3 != set_intersection2(X4,X2) ),
inference(split_conjunct,[status(thm)],[i_0_25]),
[final] ).
cnf(i_0_53,lemma,
( subset(X1,X3)
| ~ subset(X1,X2)
| ~ subset(X2,X3) ),
inference(split_conjunct,[status(thm)],[i_0_29]),
[final] ).
cnf(i_0_54,plain,
( in(X3,X2)
| ~ subset(X1,X2)
| ~ in(X3,X1) ),
inference(split_conjunct,[status(thm)],[i_0_27]),
[final] ).
cnf(i_0_55,lemma,
( in(esk7_2(X1,X2),X1)
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_28]),
[final] ).
cnf(i_0_56,lemma,
( in(esk7_2(X1,X2),X2)
| disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_28]),
[final] ).
cnf(i_0_57,plain,
( in(esk2_2(X1,X2),X1)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_27]),
[final] ).
cnf(i_0_58,plain,
( ~ in(X1,X2)
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[i_0_30]),
[final] ).
cnf(i_0_59,plain,
( disjoint(X2,X1)
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_31]),
[final] ).
cnf(i_0_60,plain,
( disjoint(X1,X2)
| set_intersection2(X1,X2) != empty_set ),
inference(split_conjunct,[status(thm)],[i_0_32]),
[final] ).
cnf(i_0_61,plain,
( set_intersection2(X1,X2) = empty_set
| ~ disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[i_0_32]),
[final] ).
cnf(i_0_62,plain,
( ~ in(X1,X2)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[i_0_33]),
[final] ).
cnf(i_0_63,plain,
set_intersection2(X1,X2) = set_intersection2(X2,X1),
inference(split_conjunct,[status(thm)],[i_0_34]),
[final] ).
cnf(i_0_64,plain,
( X1 != empty_set
| ~ in(X2,X1) ),
inference(split_conjunct,[status(thm)],[i_0_35]),
[final] ).
cnf(i_0_65,plain,
( in(esk1_1(X1),X1)
| X1 = empty_set ),
inference(split_conjunct,[status(thm)],[i_0_35]),
[final] ).
cnf(i_0_66,negated_conjecture,
~ subset(empty_set,esk6_0),
inference(split_conjunct,[status(thm)],[i_0_36]),
[final] ).
cnf(i_0_67,plain,
( X1 = X2
| ~ empty(X1)
| ~ empty(X2) ),
inference(split_conjunct,[status(thm)],[i_0_37]),
[final] ).
cnf(i_0_68,plain,
set_intersection2(X1,X1) = X1,
inference(split_conjunct,[status(thm)],[i_0_38]),
[final] ).
cnf(i_0_69,plain,
subset(X1,X1),
inference(split_conjunct,[status(thm)],[i_0_39]),
[final] ).
cnf(i_0_70,plain,
( X1 = empty_set
| ~ empty(X1) ),
inference(split_conjunct,[status(thm)],[i_0_40]),
[final] ).
cnf(i_0_71,plain,
~ empty(esk5_0),
inference(split_conjunct,[status(thm)],[i_0_41]),
[final] ).
cnf(i_0_72,plain,
empty(esk4_0),
inference(split_conjunct,[status(thm)],[i_0_42]),
[final] ).
cnf(i_0_73,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]),
[final] ).
cnf(i_0_74,axiom,
X1 = X1 ).
cnf(i_0_75,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_76,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_77,axiom,
( X1 != X2
| set_intersection2(X1,X3) = set_intersection2(X2,X3) ) ).
cnf(i_0_78,axiom,
( X1 != X2
| set_intersection2(X3,X1) = set_intersection2(X3,X2) ) ).
cnf(i_0_79,axiom,
( X1 != X2
| ~ in(X1,X3)
| in(X2,X3) ) ).
cnf(i_0_80,axiom,
( X1 != X2
| ~ in(X3,X1)
| in(X3,X2) ) ).
cnf(i_0_81,axiom,
( X1 != X2
| ~ disjoint(X1,X3)
| disjoint(X2,X3) ) ).
cnf(i_0_82,axiom,
( X1 != X2
| ~ disjoint(X3,X1)
| disjoint(X3,X2) ) ).
cnf(i_0_83,axiom,
( X1 != X2
| ~ subset(X1,X3)
| subset(X2,X3) ) ).
cnf(i_0_84,axiom,
( X1 != X2
| ~ subset(X3,X1)
| subset(X3,X2) ) ).
cnf(i_0_85,axiom,
( X1 != X2
| ~ empty(X1)
| empty(X2) ) ).
cnf(i_0_74_001,axiom,
X1 = X1 ).
cnf(i_0_75_002,axiom,
( X1 = X2
| X2 != X1 ) ).
cnf(i_0_76_003,axiom,
( X1 = X2
| X1 != X3
| X3 != X2 ) ).
cnf(i_0_77_004,axiom,
( X1 != X2
| set_intersection2(X1,X3) = set_intersection2(X2,X3) ) ).
cnf(i_0_78_005,axiom,
( X1 != X2
| set_intersection2(X3,X1) = set_intersection2(X3,X2) ) ).
cnf(i_0_79_006,axiom,
( X1 != X2
| ~ in(X1,X3)
| in(X2,X3) ) ).
cnf(i_0_80_007,axiom,
( X1 != X2
| ~ in(X3,X1)
| in(X3,X2) ) ).
cnf(i_0_81_008,axiom,
( X1 != X2
| ~ disjoint(X1,X3)
| disjoint(X2,X3) ) ).
cnf(i_0_82_009,axiom,
( X1 != X2
| ~ disjoint(X3,X1)
| disjoint(X3,X2) ) ).
cnf(i_0_83_010,axiom,
( X1 != X2
| ~ subset(X1,X3)
| subset(X2,X3) ) ).
cnf(i_0_84_011,axiom,
( X1 != X2
| ~ subset(X3,X1)
| subset(X3,X2) ) ).
cnf(i_0_85_012,axiom,
( X1 != X2
| ~ empty(X1)
| empty(X2) ) ).
cnf(i_0_86,plain,
( in(X1,set_intersection2(X2,X3))
| ~ in(X1,X2)
| ~ in(X1,X3) ),
inference(equality_inference,[],[47]) ).
cnf(i_0_87,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X2,X3)) ),
inference(equality_inference,[],[51]) ).
cnf(i_0_88,plain,
( in(X1,X2)
| ~ in(X1,set_intersection2(X3,X2)) ),
inference(equality_inference,[],[52]) ).
cnf(i_0_89,plain,
~ in(X1,empty_set),
inference(equality_inference,[],[64]) ).
cnf(i_0_90,plain,
$false,
inference(scs_inference,[],[i_0_89,i_0_66,i_0_57]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU122+2 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.12 % 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.16/0.33 % Computer : n027.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Tue May 5 02:44:05 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 0.27/1.61 % Version : CSE_E---1.7
% 0.27/1.61 % Problem : theBenchmark.p
% 0.27/1.61 % SZS status Theorem for theBenchmark.p
% 0.27/1.61 % SZS output start CNFRefutation
% See solution above
% 0.27/1.63 % Total time : 1.271s
%------------------------------------------------------------------------------