%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU355+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n013.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 02:24:49 PM UTC 2026
% Result : Theorem 0.14s 0.49s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 21 ( 6 unt; 0 def)
% Number of atoms : 90 ( 0 equ)
% Maximal formula atoms : 18 ( 4 avg)
% Number of connectives : 114 ( 45 ~; 44 |; 11 &)
% ( 2 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 38 ( 1 sgn 24 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t6_yellow_0,conjecture,
! [X1] :
( rel_str(X1)
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ( relstr_element_smaller(X1,empty_set,X2)
& relstr_set_smaller(X1,empty_set,X2) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t6_yellow_0) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( empty(X2)
& in(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t7_boole) ).
fof(d9_lattice3,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2,X3] :
( element(X3,the_carrier(X1))
=> ( relstr_set_smaller(X1,X2,X3)
<=> ! [X4] :
( element(X4,the_carrier(X1))
=> ( in(X4,X2)
=> related(X1,X4,X3) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d9_lattice3) ).
fof(d8_lattice3,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2,X3] :
( element(X3,the_carrier(X1))
=> ( relstr_element_smaller(X1,X2,X3)
<=> ! [X4] :
( element(X4,the_carrier(X1))
=> ( in(X4,X2)
=> related(X1,X3,X4) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d8_lattice3) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(c_0_5,negated_conjecture,
~ ! [X1] :
( rel_str(X1)
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ( relstr_element_smaller(X1,empty_set,X2)
& relstr_set_smaller(X1,empty_set,X2) ) ) ),
inference(assume_negation,[status(cth)],[t6_yellow_0]) ).
fof(c_0_6,plain,
! [X27,X28] :
( ~ empty(X28)
| ~ in(X27,X28) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).
fof(c_0_7,plain,
! [X13,X14,X15,X16] :
( ( ~ rel_str(X13)
| ~ element(X15,the_carrier(X13))
| relstr_set_smaller(X13,X14,X15)
| ~ related(X13,esk4_3(X13,X14,X15),X15) )
& ( ~ rel_str(X13)
| ~ element(X15,the_carrier(X13))
| relstr_set_smaller(X13,X14,X15)
| in(esk4_3(X13,X14,X15),X14) )
& ( ~ rel_str(X13)
| ~ element(X15,the_carrier(X13))
| relstr_set_smaller(X13,X14,X15)
| element(esk4_3(X13,X14,X15),the_carrier(X13)) )
& ( ~ rel_str(X13)
| ~ element(X15,the_carrier(X13))
| related(X13,X16,X15)
| ~ in(X16,X14)
| ~ element(X16,the_carrier(X13))
| ~ relstr_set_smaller(X13,X14,X15) ) ),
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)],[d9_lattice3])])])])])]) ).
fof(c_0_8,negated_conjecture,
( ( ~ relstr_element_smaller(esk1_0,empty_set,esk2_0)
| ~ relstr_set_smaller(esk1_0,empty_set,esk2_0) )
& element(esk2_0,the_carrier(esk1_0))
& rel_str(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).
cnf(c_0_9,plain,
( ~ empty(X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,plain,
( ~ rel_str(X1)
| ~ element(X3,the_carrier(X1))
| relstr_set_smaller(X1,X2,X3)
| in(esk4_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_11,plain,
! [X7,X8,X9,X10] :
( ( ~ rel_str(X7)
| ~ element(X9,the_carrier(X7))
| relstr_element_smaller(X7,X8,X9)
| ~ related(X7,X9,esk3_3(X7,X8,X9)) )
& ( ~ rel_str(X7)
| ~ element(X9,the_carrier(X7))
| relstr_element_smaller(X7,X8,X9)
| in(esk3_3(X7,X8,X9),X8) )
& ( ~ rel_str(X7)
| ~ element(X9,the_carrier(X7))
| relstr_element_smaller(X7,X8,X9)
| element(esk3_3(X7,X8,X9),the_carrier(X7)) )
& ( ~ rel_str(X7)
| ~ element(X9,the_carrier(X7))
| related(X7,X9,X10)
| ~ in(X10,X8)
| ~ element(X10,the_carrier(X7))
| ~ relstr_element_smaller(X7,X8,X9) ) ),
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)],[d8_lattice3])])])])])]) ).
cnf(c_0_12,negated_conjecture,
( ~ relstr_element_smaller(esk1_0,empty_set,esk2_0)
| ~ relstr_set_smaller(esk1_0,empty_set,esk2_0) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( ~ empty(X2)
| ~ rel_str(X1)
| ~ element(X3,the_carrier(X1))
| relstr_set_smaller(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,negated_conjecture,
element(esk2_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_15,negated_conjecture,
rel_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
cnf(c_0_17,plain,
( ~ rel_str(X1)
| ~ element(X3,the_carrier(X1))
| relstr_element_smaller(X1,X2,X3)
| in(esk3_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_18,negated_conjecture,
~ relstr_element_smaller(esk1_0,empty_set,esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]),c_0_15]),c_0_16])]) ).
cnf(c_0_19,plain,
( ~ empty(X2)
| ~ rel_str(X1)
| ~ element(X3,the_carrier(X1))
| relstr_element_smaller(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_9,c_0_17]) ).
cnf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_14]),c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU355+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n013.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Mon Sep 21 06:14:36 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.44 Running first-order theorem proving
% 0.14/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
% 0.14/0.49 % Version: 3.5.1
% 0.14/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.49 % Starting sh5l with 300s (1) cores
% 0.14/0.49 % new_bool_3 with pid 105651 completed with status 0
% 0.14/0.49 % Result found by new_bool_3
% 0.14/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.49 % Search class: FGHSF-FFMS32-SFFFFFNN
% 0.14/0.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.49 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.49 % SubtermCWHack with pid 105654 completed with status 0
% 0.14/0.49 % Result found by SubtermCWHack
% 0.14/0.49 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.14/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.49 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.14/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.49 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.49 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.49 % Search class: FGHSF-FFMS32-SFFFFFNN
% 0.14/0.49 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.49 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.49 % Preprocessing time : 0.002 s
% 0.14/0.49
% 0.14/0.49 % Proof found!
% 0.14/0.49 % SZS status Theorem
% 0.14/0.49 % SZS output start CNFRefutation
% See solution above
% 0.14/0.49 % Parsed axioms : 22
% 0.14/0.49 % Removed by relevancy pruning/SinE : 8
% 0.14/0.49 % Initial clauses : 22
% 0.14/0.49 % Removed in clause preprocessing : 0
% 0.14/0.49 % Initial clauses in saturation : 22
% 0.14/0.49 % Processed clauses : 29
% 0.14/0.49 % ...of these trivial : 0
% 0.14/0.49 % ...subsumed : 3
% 0.14/0.49 % ...remaining for further processing : 26
% 0.14/0.49 % Other redundant clauses eliminated : 0
% 0.14/0.49 % Clauses deleted for lack of memory : 0
% 0.14/0.49 % Backward-subsumed : 1
% 0.14/0.49 % Backward-rewritten : 1
% 0.14/0.49 % Generated clauses : 21
% 0.14/0.49 % ...of the previous two non-redundant : 17
% 0.14/0.49 % ...aggressively subsumed : 0
% 0.14/0.49 % Contextual simplify-reflections : 0
% 0.14/0.49 % Paramodulations : 21
% 0.14/0.49 % Factorizations : 0
% 0.14/0.49 % NegExts : 0
% 0.14/0.49 % Equation resolutions : 0
% 0.14/0.49 % Disequality decompositions : 0
% 0.14/0.49 % Total rewrite steps : 10
% 0.14/0.49 % ...of those cached : 5
% 0.14/0.49 % Propositional unsat checks : 0
% 0.14/0.49 % Propositional check models : 0
% 0.14/0.49 % Propositional check unsatisfiable : 0
% 0.14/0.49 % Propositional clauses : 0
% 0.14/0.49 % Propositional clauses after purity: 0
% 0.14/0.49 % Propositional unsat core size : 0
% 0.14/0.49 % Propositional preprocessing time : 0.000
% 0.14/0.49 % Propositional encoding time : 0.000
% 0.14/0.49 % Propositional solver time : 0.000
% 0.14/0.49 % Success case prop preproc time : 0.000
% 0.14/0.49 % Success case prop encoding time : 0.000
% 0.14/0.49 % Success case prop solver time : 0.000
% 0.14/0.49 % Current number of processed clauses : 24
% 0.14/0.49 % Positive orientable unit clauses : 6
% 0.14/0.49 % Positive unorientable unit clauses: 0
% 0.14/0.49 % Negative unit clauses : 2
% 0.14/0.49 % Non-unit-clauses : 16
% 0.14/0.49 % Current number of unprocessed clauses: 10
% 0.14/0.49 % ...number of literals in the above : 44
% 0.14/0.49 % Current number of archived formulas : 0
% 0.14/0.49 % Current number of archived clauses : 2
% 0.14/0.49 % Clause-clause subsumption calls (NU) : 32
% 0.14/0.49 % Rec. Clause-clause subsumption calls : 27
% 0.14/0.49 % Non-unit clause-clause subsumptions : 3
% 0.14/0.49 % Unit Clause-clause subsumption calls : 1
% 0.14/0.49 % Rewrite failures with RHS unbound : 0
% 0.14/0.49 % BW rewrite match attempts : 1
% 0.14/0.49 % BW rewrite match successes : 1
% 0.14/0.49 % Condensation attempts : 0
% 0.14/0.49 % Condensation successes : 0
% 0.14/0.49 % Termbank termtop insertions : 1748
% 0.14/0.49 % Search garbage collected termcells : 397
% 0.14/0.49
% 0.14/0.49 % -------------------------------------------------
% 0.14/0.49 % User time : 0.011 s
% 0.14/0.49 % System time : 0.003 s
% 0.14/0.49 % Total time : 0.014 s
% 0.14/0.49 % Maximum resident set size: 3644 pages
% 0.14/0.49
% 0.14/0.49 % -------------------------------------------------
% 0.14/0.49 % User time : 0.012 s
% 0.14/0.49 % System time : 0.010 s
% 0.14/0.49 % Total time : 0.022 s
% 0.14/0.49 % Maximum resident set size: 4608 pages
% 0.14/0.49 % E exiting
%------------------------------------------------------------------------------