%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : SEU240+1 : TPTP v9.2.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/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:11:13 PM UTC 2026
% Result : Theorem 1.30s 1.73s
% Output : CNFRefutation 1.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 67 ( 15 unt; 0 def)
% Number of atoms : 230 ( 6 equ)
% Maximal formula atoms : 26 ( 3 avg)
% Number of connectives : 280 ( 117 ~; 131 |; 19 &)
% ( 4 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 115 ( 5 sgn 38 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l2_wellord1,conjecture,
! [X1] :
( relation(X1)
=> ( transitive(X1)
<=> ! [X2,X3,X4] :
( ( in(ordered_pair(X2,X3),X1)
& in(ordered_pair(X3,X4),X1) )
=> in(ordered_pair(X2,X4),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l2_wellord1) ).
fof(d8_relat_2,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( is_transitive_in(X1,X2)
<=> ! [X3,X4,X5] :
( ( in(X3,X2)
& in(X4,X2)
& in(X5,X2)
& in(ordered_pair(X3,X4),X1)
& in(ordered_pair(X4,X5),X1) )
=> in(ordered_pair(X3,X5),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_relat_2) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(t30_relat_1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(ordered_pair(X1,X2),X3)
=> ( in(X1,relation_field(X3))
& in(X2,relation_field(X3)) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t30_relat_1) ).
fof(d16_relat_2,axiom,
! [X1] :
( relation(X1)
=> ( transitive(X1)
<=> is_transitive_in(X1,relation_field(X1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d16_relat_2) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ( transitive(X1)
<=> ! [X2,X3,X4] :
( ( in(ordered_pair(X2,X3),X1)
& in(ordered_pair(X3,X4),X1) )
=> in(ordered_pair(X2,X4),X1) ) ) ),
inference(assume_negation,[status(cth)],[l2_wellord1]) ).
fof(c_0_7,plain,
! [X67,X68,X69,X70,X71,X72] :
( ( ~ is_transitive_in(X67,X68)
| ~ in(X69,X68)
| ~ in(X70,X68)
| ~ in(X71,X68)
| ~ in(ordered_pair(X69,X70),X67)
| ~ in(ordered_pair(X70,X71),X67)
| in(ordered_pair(X69,X71),X67)
| ~ relation(X67) )
& ( in(esk1_2(X67,X72),X72)
| is_transitive_in(X67,X72)
| ~ relation(X67) )
& ( in(esk2_2(X67,X72),X72)
| is_transitive_in(X67,X72)
| ~ relation(X67) )
& ( in(esk3_2(X67,X72),X72)
| is_transitive_in(X67,X72)
| ~ relation(X67) )
& ( in(ordered_pair(esk1_2(X67,X72),esk2_2(X67,X72)),X67)
| is_transitive_in(X67,X72)
| ~ relation(X67) )
& ( in(ordered_pair(esk2_2(X67,X72),esk3_2(X67,X72)),X67)
| is_transitive_in(X67,X72)
| ~ relation(X67) )
& ( ~ in(ordered_pair(esk1_2(X67,X72),esk3_2(X67,X72)),X67)
| is_transitive_in(X67,X72)
| ~ relation(X67) ) ),
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)],[d8_relat_2])])])])])]) ).
fof(c_0_8,plain,
! [X64,X65] : ordered_pair(X64,X65) = unordered_pair(unordered_pair(X64,X65),singleton(X64)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
fof(c_0_9,negated_conjecture,
! [X89,X90,X91] :
( relation(esk5_0)
& ( in(ordered_pair(esk6_0,esk7_0),esk5_0)
| ~ transitive(esk5_0) )
& ( in(ordered_pair(esk7_0,esk8_0),esk5_0)
| ~ transitive(esk5_0) )
& ( ~ in(ordered_pair(esk6_0,esk8_0),esk5_0)
| ~ transitive(esk5_0) )
& ( transitive(esk5_0)
| ~ in(ordered_pair(X89,X90),esk5_0)
| ~ in(ordered_pair(X90,X91),esk5_0)
| in(ordered_pair(X89,X91),esk5_0) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
cnf(c_0_10,plain,
( in(ordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),X1)
| is_transitive_in(X1,X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_12,plain,
! [X59,X60] : unordered_pair(X59,X60) = unordered_pair(X60,X59),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
cnf(c_0_13,negated_conjecture,
( transitive(esk5_0)
| in(ordered_pair(X1,X3),esk5_0)
| ~ in(ordered_pair(X1,X2),esk5_0)
| ~ in(ordered_pair(X2,X3),esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,plain,
( is_transitive_in(X1,X2)
| in(unordered_pair(unordered_pair(esk2_2(X1,X2),esk3_2(X1,X2)),singleton(esk2_2(X1,X2))),X1)
| ~ relation(X1) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_16,plain,
( in(ordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),X1)
| is_transitive_in(X1,X2)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_17,negated_conjecture,
( transitive(esk5_0)
| in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),esk5_0)
| ~ in(unordered_pair(unordered_pair(X2,X3),singleton(X2)),esk5_0)
| ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),esk5_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_11]),c_0_11]),c_0_11]) ).
cnf(c_0_18,plain,
( is_transitive_in(X1,X2)
| in(unordered_pair(singleton(esk2_2(X1,X2)),unordered_pair(esk2_2(X1,X2),esk3_2(X1,X2))),X1)
| ~ relation(X1) ),
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
relation(esk5_0),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_20,plain,
( is_transitive_in(X1,X2)
| in(unordered_pair(unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2)),singleton(esk1_2(X1,X2))),X1)
| ~ relation(X1) ),
inference(rw,[status(thm)],[c_0_16,c_0_11]) ).
cnf(c_0_21,plain,
( is_transitive_in(X1,X2)
| ~ in(ordered_pair(esk1_2(X1,X2),esk3_2(X1,X2)),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,negated_conjecture,
( transitive(esk5_0)
| in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk5_0)
| ~ in(unordered_pair(singleton(X3),unordered_pair(X3,X2)),esk5_0)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),esk5_0) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_15]),c_0_15]),c_0_15]) ).
cnf(c_0_23,negated_conjecture,
( is_transitive_in(esk5_0,X1)
| in(unordered_pair(singleton(esk2_2(esk5_0,X1)),unordered_pair(esk2_2(esk5_0,X1),esk3_2(esk5_0,X1))),esk5_0) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,plain,
( is_transitive_in(X1,X2)
| in(unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk2_2(X1,X2))),X1)
| ~ relation(X1) ),
inference(rw,[status(thm)],[c_0_20,c_0_15]) ).
cnf(c_0_25,plain,
( in(ordered_pair(X3,X5),X1)
| ~ is_transitive_in(X1,X2)
| ~ in(X3,X2)
| ~ in(X4,X2)
| ~ in(X5,X2)
| ~ in(ordered_pair(X3,X4),X1)
| ~ in(ordered_pair(X4,X5),X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_26,negated_conjecture,
( in(ordered_pair(esk7_0,esk8_0),esk5_0)
| ~ transitive(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_27,plain,
( is_transitive_in(X1,X2)
| ~ relation(X1)
| ~ in(unordered_pair(unordered_pair(esk1_2(X1,X2),esk3_2(X1,X2)),singleton(esk1_2(X1,X2))),X1) ),
inference(rw,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_28,negated_conjecture,
( is_transitive_in(esk5_0,X1)
| transitive(esk5_0)
| in(unordered_pair(singleton(X2),unordered_pair(X2,esk3_2(esk5_0,X1))),esk5_0)
| ~ in(unordered_pair(singleton(X2),unordered_pair(X2,esk2_2(esk5_0,X1))),esk5_0) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,negated_conjecture,
( is_transitive_in(esk5_0,X1)
| in(unordered_pair(singleton(esk1_2(esk5_0,X1)),unordered_pair(esk1_2(esk5_0,X1),esk2_2(esk5_0,X1))),esk5_0) ),
inference(spm,[status(thm)],[c_0_24,c_0_19]) ).
fof(c_0_30,plain,
! [X102,X103,X104] :
( ( in(X102,relation_field(X104))
| ~ in(ordered_pair(X102,X103),X104)
| ~ relation(X104) )
& ( in(X103,relation_field(X104))
| ~ in(ordered_pair(X102,X103),X104)
| ~ relation(X104) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t30_relat_1])])]) ).
cnf(c_0_31,plain,
( in(unordered_pair(unordered_pair(X3,X5),singleton(X3)),X1)
| ~ relation(X1)
| ~ in(X5,X2)
| ~ in(X4,X2)
| ~ in(X3,X2)
| ~ is_transitive_in(X1,X2)
| ~ in(unordered_pair(unordered_pair(X4,X5),singleton(X4)),X1)
| ~ in(unordered_pair(unordered_pair(X3,X4),singleton(X3)),X1) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_11]),c_0_11]),c_0_11]) ).
cnf(c_0_32,negated_conjecture,
( in(unordered_pair(unordered_pair(esk7_0,esk8_0),singleton(esk7_0)),esk5_0)
| ~ transitive(esk5_0) ),
inference(rw,[status(thm)],[c_0_26,c_0_11]) ).
fof(c_0_33,plain,
! [X63] :
( ( ~ transitive(X63)
| is_transitive_in(X63,relation_field(X63))
| ~ relation(X63) )
& ( ~ is_transitive_in(X63,relation_field(X63))
| transitive(X63)
| ~ relation(X63) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d16_relat_2])])]) ).
cnf(c_0_34,plain,
( is_transitive_in(X1,X2)
| ~ relation(X1)
| ~ in(unordered_pair(singleton(esk1_2(X1,X2)),unordered_pair(esk1_2(X1,X2),esk3_2(X1,X2))),X1) ),
inference(rw,[status(thm)],[c_0_27,c_0_15]) ).
cnf(c_0_35,negated_conjecture,
( is_transitive_in(esk5_0,X1)
| transitive(esk5_0)
| in(unordered_pair(singleton(esk1_2(esk5_0,X1)),unordered_pair(esk1_2(esk5_0,X1),esk3_2(esk5_0,X1))),esk5_0) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,negated_conjecture,
( in(ordered_pair(esk6_0,esk7_0),esk5_0)
| ~ transitive(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_37,negated_conjecture,
( ~ in(ordered_pair(esk6_0,esk8_0),esk5_0)
| ~ transitive(esk5_0) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_38,plain,
( in(X1,relation_field(X2))
| ~ in(ordered_pair(X3,X1),X2)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_39,plain,
( in(X1,relation_field(X2))
| ~ in(ordered_pair(X1,X3),X2)
| ~ relation(X2) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_40,plain,
( in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),X3)
| ~ is_transitive_in(X3,X4)
| ~ relation(X3)
| ~ in(unordered_pair(singleton(X5),unordered_pair(X5,X2)),X3)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X5)),X3)
| ~ in(X2,X4)
| ~ in(X5,X4)
| ~ in(X1,X4) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_15]),c_0_15]),c_0_15]) ).
cnf(c_0_41,negated_conjecture,
( in(unordered_pair(singleton(esk7_0),unordered_pair(esk7_0,esk8_0)),esk5_0)
| ~ transitive(esk5_0) ),
inference(rw,[status(thm)],[c_0_32,c_0_15]) ).
cnf(c_0_42,plain,
( transitive(X1)
| ~ is_transitive_in(X1,relation_field(X1))
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_43,negated_conjecture,
( is_transitive_in(esk5_0,X1)
| transitive(esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_19])]) ).
cnf(c_0_44,negated_conjecture,
( in(unordered_pair(unordered_pair(esk6_0,esk7_0),singleton(esk6_0)),esk5_0)
| ~ transitive(esk5_0) ),
inference(rw,[status(thm)],[c_0_36,c_0_11]) ).
cnf(c_0_45,negated_conjecture,
( ~ transitive(esk5_0)
| ~ in(unordered_pair(unordered_pair(esk6_0,esk8_0),singleton(esk6_0)),esk5_0) ),
inference(rw,[status(thm)],[c_0_37,c_0_11]) ).
cnf(c_0_46,plain,
( in(X1,relation_field(X2))
| ~ relation(X2)
| ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X2) ),
inference(rw,[status(thm)],[c_0_38,c_0_11]) ).
cnf(c_0_47,plain,
( in(X1,relation_field(X2))
| ~ relation(X2)
| ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),X2) ),
inference(rw,[status(thm)],[c_0_39,c_0_11]) ).
cnf(c_0_48,negated_conjecture,
( in(unordered_pair(singleton(X1),unordered_pair(X1,esk8_0)),esk5_0)
| ~ is_transitive_in(esk5_0,X2)
| ~ transitive(esk5_0)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,esk7_0)),esk5_0)
| ~ in(esk8_0,X2)
| ~ in(esk7_0,X2)
| ~ in(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_19])]) ).
cnf(c_0_49,negated_conjecture,
transitive(esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_19])]) ).
cnf(c_0_50,negated_conjecture,
( in(unordered_pair(singleton(esk6_0),unordered_pair(esk6_0,esk7_0)),esk5_0)
| ~ transitive(esk5_0) ),
inference(rw,[status(thm)],[c_0_44,c_0_15]) ).
cnf(c_0_51,negated_conjecture,
( ~ transitive(esk5_0)
| ~ in(unordered_pair(singleton(esk6_0),unordered_pair(esk6_0,esk8_0)),esk5_0) ),
inference(rw,[status(thm)],[c_0_45,c_0_15]) ).
cnf(c_0_52,plain,
( in(X1,relation_field(X2))
| ~ relation(X2)
| ~ in(unordered_pair(singleton(X3),unordered_pair(X3,X1)),X2) ),
inference(rw,[status(thm)],[c_0_46,c_0_15]) ).
cnf(c_0_53,plain,
( in(X1,relation_field(X2))
| ~ relation(X2)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),X2) ),
inference(rw,[status(thm)],[c_0_47,c_0_15]) ).
cnf(c_0_54,negated_conjecture,
( in(unordered_pair(singleton(X1),unordered_pair(X1,esk8_0)),esk5_0)
| ~ is_transitive_in(esk5_0,X2)
| ~ in(unordered_pair(singleton(X1),unordered_pair(X1,esk7_0)),esk5_0)
| ~ in(esk8_0,X2)
| ~ in(esk7_0,X2)
| ~ in(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).
cnf(c_0_55,negated_conjecture,
in(unordered_pair(singleton(esk6_0),unordered_pair(esk6_0,esk7_0)),esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_49])]) ).
cnf(c_0_56,negated_conjecture,
~ in(unordered_pair(singleton(esk6_0),unordered_pair(esk6_0,esk8_0)),esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_49])]) ).
cnf(c_0_57,negated_conjecture,
( in(esk8_0,relation_field(esk5_0))
| ~ transitive(esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_41]),c_0_19])]) ).
cnf(c_0_58,negated_conjecture,
( in(esk7_0,relation_field(esk5_0))
| ~ transitive(esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_50]),c_0_19])]) ).
cnf(c_0_59,negated_conjecture,
( in(esk6_0,relation_field(esk5_0))
| ~ transitive(esk5_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_50]),c_0_19])]) ).
cnf(c_0_60,negated_conjecture,
( ~ is_transitive_in(esk5_0,X1)
| ~ in(esk8_0,X1)
| ~ in(esk7_0,X1)
| ~ in(esk6_0,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56]) ).
cnf(c_0_61,negated_conjecture,
in(esk8_0,relation_field(esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_49])]) ).
cnf(c_0_62,negated_conjecture,
in(esk7_0,relation_field(esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_49])]) ).
cnf(c_0_63,negated_conjecture,
in(esk6_0,relation_field(esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_49])]) ).
cnf(c_0_64,negated_conjecture,
~ is_transitive_in(esk5_0,relation_field(esk5_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]),c_0_63])]) ).
cnf(c_0_65,plain,
( is_transitive_in(X1,relation_field(X1))
| ~ transitive(X1)
| ~ relation(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_66,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_49]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SEU240+1 : TPTP v9.2.1. Released v3.3.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.15/0.33 % Computer : n027.cluster.edu
% 0.15/0.33 % Model : x86_64 x86_64
% 0.15/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33 % Memory : 8042.1875MB
% 0.15/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33 % CPULimit : 300
% 0.15/0.33 % WCLimit : 300
% 0.15/0.33 % DateTime : Tue May 5 02:51:20 EDT 2026
% 0.15/0.33 % CPUTime :
% 0.15/0.34 % start to proof: theBenchmark
% 1.30/1.73 % Version : CSE_E---1.7
% 1.30/1.73 % Problem : theBenchmark.p
% 1.30/1.73 % SZS status Theorem for theBenchmark.p
% 1.30/1.73 % SZS output start CNFRefutation
% See solution above
% 1.30/1.73 % Total time : 1.369s
%------------------------------------------------------------------------------