%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : NUM380+1 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Sep 24 01:48:57 PM UTC 2026
% Result : Theorem 89.51s 12.42s
% Output : CNFRefutation 89.51s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 3
% Syntax : Number of formulae : 36 ( 10 unt; 0 def)
% Number of atoms : 142 ( 78 equ)
% Maximal formula atoms : 36 ( 3 avg)
% Number of connectives : 170 ( 64 ~; 74 |; 28 &)
% ( 4 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 27 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-5 aty)
% Number of variables : 122 ( 24 sgn 39 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d2_enumset1,axiom,
! [X1,X2,X3,X4,X5] :
( X5 = unordered_quadruple(X1,X2,X3,X4)
<=> ! [X6] :
( in(X6,X5)
<=> ~ ( X6 != X4
& X6 != X3
& X6 != X2
& X6 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d2_enumset1) ).
fof(t7_tarski,axiom,
! [X1,X2] :
~ ( ! [X3] :
~ ( ! [X4] :
~ ( in(X4,X3)
& in(X4,X2) )
& in(X3,X2) )
& in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_tarski) ).
fof(t4_ordinal1,conjecture,
! [X1,X2,X3,X4] :
~ ( in(X4,X1)
& in(X3,X4)
& in(X2,X3)
& in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t4_ordinal1) ).
fof(c_0_3,plain,
! [X1,X2,X3,X4,X5] :
( X5 = unordered_quadruple(X1,X2,X3,X4)
<=> ! [X6] :
( in(X6,X5)
<=> ~ ( X6 != X4
& X6 != X3
& X6 != X2
& X6 != X1 ) ) ),
inference(fof_simplification,[status(thm)],[d2_enumset1]) ).
fof(c_0_4,plain,
! [X12,X13,X14,X15,X16,X17,X18,X19,X20,X21,X22,X23] :
( ( X23 = unordered_quadruple(X19,X20,X21,X22)
| esk1_5(X19,X20,X21,X22,X23) = X22
| esk1_5(X19,X20,X21,X22,X23) = X21
| esk1_5(X19,X20,X21,X22,X23) = X20
| esk1_5(X19,X20,X21,X22,X23) = X19
| in(esk1_5(X19,X20,X21,X22,X23),X23) )
& ( X23 = unordered_quadruple(X19,X20,X21,X22)
| ~ in(esk1_5(X19,X20,X21,X22,X23),X23)
| esk1_5(X19,X20,X21,X22,X23) != X22 )
& ( X23 = unordered_quadruple(X19,X20,X21,X22)
| ~ in(esk1_5(X19,X20,X21,X22,X23),X23)
| esk1_5(X19,X20,X21,X22,X23) != X21 )
& ( X23 = unordered_quadruple(X19,X20,X21,X22)
| ~ in(esk1_5(X19,X20,X21,X22,X23),X23)
| esk1_5(X19,X20,X21,X22,X23) != X20 )
& ( X23 = unordered_quadruple(X19,X20,X21,X22)
| ~ in(esk1_5(X19,X20,X21,X22,X23),X23)
| esk1_5(X19,X20,X21,X22,X23) != X19 )
& ( X16 != unordered_quadruple(X12,X13,X14,X15)
| in(X18,X16)
| X18 != X15 )
& ( X16 != unordered_quadruple(X12,X13,X14,X15)
| in(X18,X16)
| X18 != X14 )
& ( X16 != unordered_quadruple(X12,X13,X14,X15)
| in(X18,X16)
| X18 != X13 )
& ( X16 != unordered_quadruple(X12,X13,X14,X15)
| in(X18,X16)
| X18 != X12 )
& ( X16 != unordered_quadruple(X12,X13,X14,X15)
| X17 = X15
| X17 = X14
| X17 = X13
| X17 = X12
| ~ in(X17,X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[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)],[c_0_3])])])])])])]) ).
cnf(c_0_5,plain,
( X2 != unordered_quadruple(X3,X4,X5,X6)
| ~ in(X1,X2)
| X1 = X6
| X1 = X5
| X1 = X4
| X1 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
fof(c_0_6,plain,
! [X48,X49,X51] :
( ( ~ in(X48,X49)
| ~ in(X51,esk17_2(X48,X49))
| ~ in(X51,X49) )
& ( ~ in(X48,X49)
| in(esk17_2(X48,X49),X49) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_tarski])])])])])]) ).
cnf(c_0_7,plain,
( ~ in(X1,unordered_quadruple(X5,X4,X3,X2))
| X1 = X5
| X1 = X4
| X1 = X3
| X1 = X2 ),
inference(er,[status(thm)],[c_0_5]) ).
cnf(c_0_8,plain,
( ~ in(X1,X2)
| in(esk17_2(X1,X2),X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
( X3 != unordered_quadruple(X2,X4,X5,X6)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_10,plain,
( ~ in(X1,unordered_quadruple(X2,X3,X4,X5))
| esk17_2(X1,unordered_quadruple(X2,X3,X4,X5)) = X2
| esk17_2(X1,unordered_quadruple(X2,X3,X4,X5)) = X3
| esk17_2(X1,unordered_quadruple(X2,X3,X4,X5)) = X4
| esk17_2(X1,unordered_quadruple(X2,X3,X4,X5)) = X5 ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
in(X1,unordered_quadruple(X1,X2,X3,X4)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_9])]) ).
cnf(c_0_12,plain,
( ~ in(X3,X2)
| ~ in(X1,esk17_2(X3,X2))
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_13,plain,
( esk17_2(X1,unordered_quadruple(X1,X2,X3,X4)) = X4
| esk17_2(X1,unordered_quadruple(X1,X2,X3,X4)) = X3
| esk17_2(X1,unordered_quadruple(X1,X2,X3,X4)) = X2
| esk17_2(X1,unordered_quadruple(X1,X2,X3,X4)) = X1 ),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_14,negated_conjecture,
~ ! [X1,X2,X3,X4] :
~ ( in(X4,X1)
& in(X3,X4)
& in(X2,X3)
& in(X1,X2) ),
inference(assume_negation,[status(cth)],[t4_ordinal1]) ).
cnf(c_0_15,plain,
( ~ in(X5,X4)
| ~ in(X5,unordered_quadruple(X1,X2,X3,X4))
| esk17_2(X1,unordered_quadruple(X1,X2,X3,X4)) = X1
| esk17_2(X1,unordered_quadruple(X1,X2,X3,X4)) = X2
| esk17_2(X1,unordered_quadruple(X1,X2,X3,X4)) = X3 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_11])]) ).
fof(c_0_16,negated_conjecture,
( in(esk16_0,esk13_0)
& in(esk15_0,esk16_0)
& in(esk14_0,esk15_0)
& in(esk13_0,esk14_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_17,plain,
( ~ in(X1,X4)
| esk17_2(X1,unordered_quadruple(X1,X2,X3,X4)) = X3
| esk17_2(X1,unordered_quadruple(X1,X2,X3,X4)) = X2
| esk17_2(X1,unordered_quadruple(X1,X2,X3,X4)) = X1 ),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_18,negated_conjecture,
in(esk16_0,esk13_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( esk17_2(esk16_0,unordered_quadruple(esk16_0,X1,X2,esk13_0)) = X1
| esk17_2(esk16_0,unordered_quadruple(esk16_0,X1,X2,esk13_0)) = X2
| esk17_2(esk16_0,unordered_quadruple(esk16_0,X1,X2,esk13_0)) = esk16_0 ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_20,plain,
( X3 != unordered_quadruple(X4,X5,X2,X6)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_21,negated_conjecture,
( ~ in(X3,X1)
| ~ in(X3,unordered_quadruple(esk16_0,X1,X2,esk13_0))
| esk17_2(esk16_0,unordered_quadruple(esk16_0,X1,X2,esk13_0)) = X2
| esk17_2(esk16_0,unordered_quadruple(esk16_0,X1,X2,esk13_0)) = esk16_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_19]),c_0_11])]) ).
cnf(c_0_22,plain,
in(X1,unordered_quadruple(X2,X3,X1,X4)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_20])]) ).
cnf(c_0_23,negated_conjecture,
( ~ in(X2,X1)
| esk17_2(esk16_0,unordered_quadruple(esk16_0,X1,X2,esk13_0)) = X2
| esk17_2(esk16_0,unordered_quadruple(esk16_0,X1,X2,esk13_0)) = esk16_0 ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,negated_conjecture,
in(esk14_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,negated_conjecture,
( esk17_2(esk16_0,unordered_quadruple(esk16_0,esk15_0,esk14_0,esk13_0)) = esk16_0
| esk17_2(esk16_0,unordered_quadruple(esk16_0,esk15_0,esk14_0,esk13_0)) = esk14_0 ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
( X3 != unordered_quadruple(X4,X2,X5,X6)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_27,negated_conjecture,
( ~ in(X1,esk16_0)
| ~ in(X1,unordered_quadruple(esk16_0,esk15_0,esk14_0,esk13_0))
| esk17_2(esk16_0,unordered_quadruple(esk16_0,esk15_0,esk14_0,esk13_0)) = esk14_0 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_25]),c_0_11])]) ).
cnf(c_0_28,plain,
in(X1,unordered_quadruple(X2,X1,X3,X4)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_26])]) ).
cnf(c_0_29,negated_conjecture,
in(esk15_0,esk16_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_30,negated_conjecture,
esk17_2(esk16_0,unordered_quadruple(esk16_0,esk15_0,esk14_0,esk13_0)) = esk14_0,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]) ).
cnf(c_0_31,plain,
( X3 != unordered_quadruple(X4,X5,X6,X2)
| X1 != X2
| in(X1,X3) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_32,negated_conjecture,
( ~ in(X1,esk14_0)
| ~ in(X1,unordered_quadruple(esk16_0,esk15_0,esk14_0,esk13_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_30]),c_0_11])]) ).
cnf(c_0_33,plain,
in(X1,unordered_quadruple(X2,X3,X4,X1)),
inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_31])]) ).
cnf(c_0_34,negated_conjecture,
in(esk13_0,esk14_0),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_35,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : NUM380+1 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n026.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 02:28:52 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.45 Running first-order theorem proving
% 0.16/0.45 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 89.51/12.42 % Version: 3.5.1
% 89.51/12.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 89.51/12.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 89.51/12.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 89.51/12.42 % Starting new_bool_3 with 300s (1) cores
% 89.51/12.42 % Starting new_bool_1 with 300s (1) cores
% 89.51/12.42 % Starting sh5l with 300s (1) cores
% 89.51/12.42 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1166199 completed with status 0
% 89.51/12.42 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 89.51/12.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 89.51/12.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 89.51/12.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 89.51/12.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 89.51/12.42 % No SInE strategy applied
% 89.51/12.42 % Search class: FGHSF-FFMM33-SFFFFFNN
% 89.51/12.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 89.51/12.42 % Starting SubtermCWHack with 136s (1) cores
% 89.51/12.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 89.51/12.42 % Starting U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 89.51/12.42 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S0Y with 136s (1) cores
% 89.51/12.42 % Starting new_bool_3 with 136s (1) cores
% 89.51/12.42 % U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 1166209 completed with status 0
% 89.51/12.42 % Result found by U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 89.51/12.42 % Preprocessing class: FSMSSMSSSSSNFFN.
% 89.51/12.42 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 89.51/12.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 89.51/12.42 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 89.51/12.42 % No SInE strategy applied
% 89.51/12.42 % Search class: FGHSF-FFMM33-SFFFFFNN
% 89.51/12.42 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 89.51/12.42 % Starting SubtermCWHack with 136s (1) cores
% 89.51/12.42 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 89.51/12.42 % Starting U----_206c_10_B11_00_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 89.51/12.42 % Preprocessing time : 0.002 s
% 89.51/12.42 % Presaturation interreduction done
% 89.51/12.42
% 89.51/12.42 % Proof found!
% 89.51/12.42 % SZS status Theorem
% 89.51/12.42 % SZS output start CNFRefutation
% See solution above
% 89.51/12.42 % Parsed axioms : 26
% 89.51/12.42 % Removed by relevancy pruning/SinE : 0
% 89.51/12.42 % Initial clauses : 56
% 89.51/12.42 % Removed in clause preprocessing : 2
% 89.51/12.42 % Initial clauses in saturation : 54
% 89.51/12.42 % Processed clauses : 1773
% 89.51/12.42 % ...of these trivial : 10
% 89.51/12.42 % ...subsumed : 1222
% 89.51/12.42 % ...remaining for further processing : 541
% 89.51/12.42 % Other redundant clauses eliminated : 4227
% 89.51/12.42 % Clauses deleted for lack of memory : 0
% 89.51/12.42 % Backward-subsumed : 9
% 89.51/12.42 % Backward-rewritten : 13
% 89.51/12.42 % Generated clauses : 152166
% 89.51/12.42 % ...of the previous two non-redundant : 141999
% 89.51/12.42 % ...aggressively subsumed : 0
% 89.51/12.42 % Contextual simplify-reflections : 3
% 89.51/12.42 % Paramodulations : 144228
% 89.51/12.42 % Factorizations : 3715
% 89.51/12.42 % NegExts : 0
% 89.51/12.42 % Equation resolutions : 4227
% 89.51/12.42 % Disequality decompositions : 0
% 89.51/12.42 % Total rewrite steps : 8591
% 89.51/12.42 % ...of those cached : 8393
% 89.51/12.42 % Propositional unsat checks : 0
% 89.51/12.42 % Propositional check models : 0
% 89.51/12.42 % Propositional check unsatisfiable : 0
% 89.51/12.42 % Propositional clauses : 0
% 89.51/12.42 % Propositional clauses after purity: 0
% 89.51/12.42 % Propositional unsat core size : 0
% 89.51/12.42 % Propositional preprocessing time : 0.000
% 89.51/12.42 % Propositional encoding time : 0.000
% 89.51/12.42 % Propositional solver time : 0.000
% 89.51/12.42 % Success case prop preproc time : 0.000
% 89.51/12.42 % Success case prop encoding time : 0.000
% 89.51/12.42 % Success case prop solver time : 0.000
% 89.51/12.42 % Current number of processed clauses : 463
% 89.51/12.42 % Positive orientable unit clauses : 35
% 89.51/12.42 % Positive unorientable unit clauses: 0
% 89.51/12.42 % Negative unit clauses : 26
% 89.51/12.42 % Non-unit-clauses : 402
% 89.51/12.42 % Current number of unprocessed clauses: 140194
% 89.51/12.42 % ...number of literals in the above : 2248211
% 89.51/12.42 % Current number of archived formulas : 0
% 89.51/12.42 % Current number of archived clauses : 73
% 89.51/12.42 % Clause-clause subsumption calls (NU) : 90494
% 89.51/12.42 % Rec. Clause-clause subsumption calls : 10292
% 89.51/12.42 % Non-unit clause-clause subsumptions : 648
% 89.51/12.42 % Unit Clause-clause subsumption calls : 1015
% 89.51/12.42 % Rewrite failures with RHS unbound : 0
% 89.51/12.42 % BW rewrite match attempts : 39
% 89.51/12.42 % BW rewrite match successes : 4
% 89.51/12.42 % Condensation attempts : 0
% 89.51/12.42 % Condensation successes : 0
% 89.51/12.42 % Termbank termtop insertions : 5499307
% 89.51/12.42 % Search garbage collected termcells : 532
% 89.51/12.42
% 89.51/12.42 % -------------------------------------------------
% 89.51/12.42 % User time : 11.269 s
% 89.51/12.42 % System time : 0.251 s
% 89.51/12.42 % Total time : 11.519 s
% 89.51/12.42 % Maximum resident set size: 3392 pages
% 89.51/12.42
% 89.51/12.42 % -------------------------------------------------
% 89.51/12.42 % User time : 53.034 s
% 89.51/12.42 % System time : 1.007 s
% 89.51/12.42 % Total time : 54.041 s
% 89.51/12.42 % Maximum resident set size: 4608 pages
% 89.51/12.42 % E exiting
%------------------------------------------------------------------------------