%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU344+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n007.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:47 PM UTC 2026
% Result : Theorem 0.23s 5.62s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 13 unt; 0 def)
% Number of atoms : 107 ( 17 equ)
% Maximal formula atoms : 12 ( 2 avg)
% Number of connectives : 109 ( 40 ~; 36 |; 15 &)
% ( 4 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-3 aty)
% Number of variables : 53 ( 4 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d3_lattices,axiom,
! [X1] :
( ( join_semilatt_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( below(X1,X2,X3)
<=> join(X1,X2,X3) = X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d3_lattices) ).
fof(t2_lattice3,conjecture,
! [X1,X2] :
( element(X2,the_carrier(boole_lattice(X1)))
=> ! [X3] :
( element(X3,the_carrier(boole_lattice(X1)))
=> ( below(boole_lattice(X1),X2,X3)
<=> subset(X2,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t2_lattice3) ).
fof(dt_l3_lattices,axiom,
! [X1] :
( latt_str(X1)
=> ( join_semilatt_str(X1)
& meet_semilatt_str(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_l3_lattices) ).
fof(dt_k1_lattice3,axiom,
! [X1] :
( latt_str(boole_lattice(X1))
& strict_latt_str(boole_lattice(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_lattice3) ).
fof(fc1_lattice3,axiom,
! [X1] :
( strict_latt_str(boole_lattice(X1))
& ~ empty_carrier(boole_lattice(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_lattice3) ).
fof(t1_lattice3,axiom,
! [X1,X2] :
( element(X2,the_carrier(boole_lattice(X1)))
=> ! [X3] :
( element(X3,the_carrier(boole_lattice(X1)))
=> ( meet(boole_lattice(X1),X2,X3) = set_intersection2(X2,X3)
& join(boole_lattice(X1),X2,X3) = set_union2(X2,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t1_lattice3) ).
fof(t12_xboole_1,axiom,
! [X1,X2] :
( subset(X1,X2)
=> set_union2(X1,X2) = X2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t12_xboole_1) ).
fof(t7_xboole_1,axiom,
! [X1,X2] : subset(X1,set_union2(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_xboole_1) ).
fof(c_0_8,plain,
! [X1] :
( ( join_semilatt_str(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( below(X1,X2,X3)
<=> join(X1,X2,X3) = X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[d3_lattices]) ).
fof(c_0_9,negated_conjecture,
~ ! [X1,X2] :
( element(X2,the_carrier(boole_lattice(X1)))
=> ! [X3] :
( element(X3,the_carrier(boole_lattice(X1)))
=> ( below(boole_lattice(X1),X2,X3)
<=> subset(X2,X3) ) ) ),
inference(assume_negation,[status(cth)],[t2_lattice3]) ).
fof(c_0_10,plain,
! [X54] :
( ( ~ latt_str(X54)
| join_semilatt_str(X54) )
& ( ~ latt_str(X54)
| meet_semilatt_str(X54) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l3_lattices])])])]) ).
fof(c_0_11,plain,
! [X20] :
( latt_str(boole_lattice(X20))
& strict_latt_str(boole_lattice(X20)) ),
inference(variable_rename,[status(thm)],[dt_k1_lattice3]) ).
fof(c_0_12,plain,
! [X1] :
( strict_latt_str(boole_lattice(X1))
& ~ empty_carrier(boole_lattice(X1)) ),
inference(fof_simplification,[status(thm)],[fc1_lattice3]) ).
fof(c_0_13,plain,
! [X17,X18,X19] :
( ( ~ join_semilatt_str(X17)
| empty_carrier(X17)
| ~ element(X18,the_carrier(X17))
| ~ element(X19,the_carrier(X17))
| below(X17,X18,X19)
| join(X17,X18,X19) != X19 )
& ( ~ join_semilatt_str(X17)
| empty_carrier(X17)
| ~ element(X18,the_carrier(X17))
| ~ element(X19,the_carrier(X17))
| join(X17,X18,X19) = X19
| ~ below(X17,X18,X19) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])]) ).
fof(c_0_14,negated_conjecture,
( ( subset(esk2_0,esk3_0)
| below(boole_lattice(esk1_0),esk2_0,esk3_0) )
& ( ~ subset(esk2_0,esk3_0)
| ~ below(boole_lattice(esk1_0),esk2_0,esk3_0) )
& element(esk3_0,the_carrier(boole_lattice(esk1_0)))
& element(esk2_0,the_carrier(boole_lattice(esk1_0))) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
cnf(c_0_15,plain,
( ~ latt_str(X1)
| join_semilatt_str(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
latt_str(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X21] :
( strict_latt_str(boole_lattice(X21))
& ~ empty_carrier(boole_lattice(X21)) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_12])]) ).
fof(c_0_18,plain,
! [X22,X23,X24] :
( ( ~ element(X23,the_carrier(boole_lattice(X22)))
| ~ element(X24,the_carrier(boole_lattice(X22)))
| meet(boole_lattice(X22),X23,X24) = set_intersection2(X23,X24) )
& ( ~ element(X23,the_carrier(boole_lattice(X22)))
| ~ element(X24,the_carrier(boole_lattice(X22)))
| join(boole_lattice(X22),X23,X24) = set_union2(X23,X24) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_lattice3])])])])]) ).
cnf(c_0_19,plain,
( ~ join_semilatt_str(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| ~ below(X1,X2,X3)
| empty_carrier(X1)
| join(X1,X2,X3) = X3 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,negated_conjecture,
( subset(esk2_0,esk3_0)
| below(boole_lattice(esk1_0),esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
join_semilatt_str(boole_lattice(X1)),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,negated_conjecture,
element(esk3_0,the_carrier(boole_lattice(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_23,negated_conjecture,
element(esk2_0,the_carrier(boole_lattice(esk1_0))),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_24,plain,
~ empty_carrier(boole_lattice(X1)),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_25,plain,
! [X11,X12] :
( set_union2(X11,X12) = X12
| ~ subset(X11,X12) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t12_xboole_1])])]) ).
fof(c_0_26,plain,
! [X15,X16] : subset(X15,set_union2(X15,X16)),
inference(variable_rename,[status(thm)],[t7_xboole_1]) ).
cnf(c_0_27,plain,
( ~ element(X2,the_carrier(boole_lattice(X1)))
| ~ element(X3,the_carrier(boole_lattice(X1)))
| join(boole_lattice(X1),X2,X3) = set_union2(X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,negated_conjecture,
( subset(esk2_0,esk3_0)
| join(boole_lattice(esk1_0),esk2_0,esk3_0) = esk3_0 ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_29,plain,
( ~ subset(X1,X2)
| set_union2(X1,X2) = X2 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_30,plain,
subset(X1,set_union2(X1,X2)),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_31,negated_conjecture,
set_union2(esk2_0,esk3_0) = esk3_0,
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_22]),c_0_23])]),c_0_29]) ).
cnf(c_0_32,negated_conjecture,
( ~ subset(esk2_0,esk3_0)
| ~ below(boole_lattice(esk1_0),esk2_0,esk3_0) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_33,negated_conjecture,
subset(esk2_0,esk3_0),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_34,negated_conjecture,
~ below(boole_lattice(esk1_0),esk2_0,esk3_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
cnf(c_0_35,plain,
( ~ join_semilatt_str(X1)
| ~ element(X2,the_carrier(X1))
| ~ element(X3,the_carrier(X1))
| join(X1,X2,X3) != X3
| empty_carrier(X1)
| below(X1,X2,X3) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_36,negated_conjecture,
join(boole_lattice(esk1_0),esk2_0,esk3_0) != esk3_0,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_21]),c_0_22]),c_0_23])]),c_0_24]) ).
cnf(c_0_37,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_36,c_0_27]),c_0_31]),c_0_22]),c_0_23])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : SEU344+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/5.47 % Computer : n007.cluster.edu
% 0.19/5.47 % Model : x86_64 x86_64
% 0.19/5.47 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/5.47 % Memory : 8046.5625MB
% 0.19/5.47 % OS : Linux 6.8.0-71-generic
% 0.19/5.47 % CPULimit : 300
% 0.19/5.47 % WCLimit : 300
% 0.19/5.47 % DateTime : Mon Sep 21 06:11:40 UTC 2026
% 0.19/5.47 % CPUTime :
% 0.19/5.47 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.23/5.54 Running first-order theorem proving
% 0.23/5.54 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.23/5.62 % Version: 3.5.1
% 0.23/5.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/5.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/5.62 % Starting new_bool_3 with 300s (1) cores
% 0.23/5.62 % Starting new_bool_1 with 300s (1) cores
% 0.23/5.62 % Starting sh5l with 300s (1) cores
% 0.23/5.62 % new_bool_3 with pid 351876 completed with status 0
% 0.23/5.62 % Result found by new_bool_3
% 0.23/5.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/5.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/5.62 % Starting new_bool_3 with 300s (1) cores
% 0.23/5.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/5.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/5.62 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.23/5.62 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.23/5.62 % Starting SubtermCWHack with 28s (1) cores
% 0.23/5.62 % SubtermCWHack with pid 351879 completed with status 0
% 0.23/5.62 % Result found by SubtermCWHack
% 0.23/5.62 % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.23/5.62 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/5.62 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.23/5.62 % Starting new_bool_3 with 300s (1) cores
% 0.23/5.62 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.23/5.62 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.23/5.62 % Search class: FGHSM-FFMM31-SFFFFFNN
% 0.23/5.62 % Scheduled 11 strats onto 1 cores with 300 seconds (300 total)
% 0.23/5.62 % Starting SubtermCWHack with 28s (1) cores
% 0.23/5.62 % Preprocessing time : 0.003 s
% 0.23/5.62
% 0.23/5.62 % Proof found!
% 0.23/5.62 % SZS status Theorem
% 0.23/5.62 % SZS output start CNFRefutation
% See solution above
% 0.23/5.62 % Parsed axioms : 81
% 0.23/5.62 % Removed by relevancy pruning/SinE : 29
% 0.23/5.62 % Initial clauses : 72
% 0.23/5.62 % Removed in clause preprocessing : 0
% 0.23/5.62 % Initial clauses in saturation : 72
% 0.23/5.62 % Processed clauses : 234
% 0.23/5.62 % ...of these trivial : 6
% 0.23/5.62 % ...subsumed : 92
% 0.23/5.62 % ...remaining for further processing : 136
% 0.23/5.62 % Other redundant clauses eliminated : 0
% 0.23/5.62 % Clauses deleted for lack of memory : 0
% 0.23/5.62 % Backward-subsumed : 1
% 0.23/5.62 % Backward-rewritten : 5
% 0.23/5.62 % Generated clauses : 282
% 0.23/5.62 % ...of the previous two non-redundant : 198
% 0.23/5.62 % ...aggressively subsumed : 0
% 0.23/5.62 % Contextual simplify-reflections : 2
% 0.23/5.62 % Paramodulations : 282
% 0.23/5.62 % Factorizations : 0
% 0.23/5.62 % NegExts : 0
% 0.23/5.62 % Equation resolutions : 0
% 0.23/5.62 % Disequality decompositions : 0
% 0.23/5.62 % Total rewrite steps : 105
% 0.23/5.62 % ...of those cached : 68
% 0.23/5.62 % Propositional unsat checks : 0
% 0.23/5.62 % Propositional check models : 0
% 0.23/5.62 % Propositional check unsatisfiable : 0
% 0.23/5.62 % Propositional clauses : 0
% 0.23/5.62 % Propositional clauses after purity: 0
% 0.23/5.62 % Propositional unsat core size : 0
% 0.23/5.62 % Propositional preprocessing time : 0.000
% 0.23/5.62 % Propositional encoding time : 0.000
% 0.23/5.62 % Propositional solver time : 0.000
% 0.23/5.62 % Success case prop preproc time : 0.000
% 0.23/5.62 % Success case prop encoding time : 0.000
% 0.23/5.62 % Success case prop solver time : 0.000
% 0.23/5.62 % Current number of processed clauses : 130
% 0.23/5.62 % Positive orientable unit clauses : 43
% 0.23/5.62 % Positive unorientable unit clauses: 2
% 0.23/5.62 % Negative unit clauses : 14
% 0.23/5.62 % Non-unit-clauses : 71
% 0.23/5.62 % Current number of unprocessed clauses: 36
% 0.23/5.62 % ...number of literals in the above : 146
% 0.23/5.62 % Current number of archived formulas : 0
% 0.23/5.62 % Current number of archived clauses : 6
% 0.23/5.62 % Clause-clause subsumption calls (NU) : 1226
% 0.23/5.62 % Rec. Clause-clause subsumption calls : 739
% 0.23/5.62 % Non-unit clause-clause subsumptions : 70
% 0.23/5.62 % Unit Clause-clause subsumption calls : 200
% 0.23/5.62 % Rewrite failures with RHS unbound : 0
% 0.23/5.62 % BW rewrite match attempts : 19
% 0.23/5.62 % BW rewrite match successes : 15
% 0.23/5.62 % Condensation attempts : 0
% 0.23/5.62 % Condensation successes : 0
% 0.23/5.62 % Termbank termtop insertions : 7190
% 0.23/5.62 % Search garbage collected termcells : 850
% 0.23/5.62
% 0.23/5.62 % -------------------------------------------------
% 0.23/5.62 % User time : 0.015 s
% 0.23/5.62 % System time : 0.006 s
% 0.23/5.62 % Total time : 0.022 s
% 0.23/5.62 % Maximum resident set size: 3708 pages
% 0.23/5.62
% 0.23/5.62 % -------------------------------------------------
% 0.23/5.62 % User time : 0.020 s
% 0.23/5.62 % System time : 0.013 s
% 0.23/5.62 % Total time : 0.033 s
% 0.23/5.62 % Maximum resident set size: 4608 pages
% 0.23/5.62 % E exiting
%------------------------------------------------------------------------------