%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU305+2 : 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 : 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 02:24:38 PM UTC 2026
% Result : Theorem 19.15s 2.97s
% Output : CNFRefutation 19.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 32 ( 13 unt; 0 def)
% Number of atoms : 129 ( 25 equ)
% Maximal formula atoms : 12 ( 4 avg)
% Number of connectives : 143 ( 46 ~; 38 |; 35 &)
% ( 2 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 48 ( 0 sgn 36 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t26_lattices,conjecture,
! [X1] :
( ( join_semilatt_str(X1)
& join_commutative(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( ( below(X1,X3,X2)
& below(X1,X2,X3) )
=> X2 = X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t26_lattices) ).
fof(redefinition_k3_lattices,axiom,
! [X1,X2,X3] :
( ( element(X3,the_carrier(X1))
& element(X2,the_carrier(X1))
& join_semilatt_str(X1)
& join_commutative(X1)
& ~ empty_carrier(X1) )
=> join_commut(X1,X2,X3) = join(X1,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',redefinition_k3_lattices) ).
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/sandbox2/benchmark/theBenchmark.p',d3_lattices) ).
fof(commutativity_k3_lattices,axiom,
! [X1,X2,X3] :
( ( element(X3,the_carrier(X1))
& element(X2,the_carrier(X1))
& join_semilatt_str(X1)
& join_commutative(X1)
& ~ empty_carrier(X1) )
=> join_commut(X1,X2,X3) = join_commut(X1,X3,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k3_lattices) ).
fof(c_0_4,negated_conjecture,
~ ! [X1] :
( ( join_semilatt_str(X1)
& join_commutative(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( ( below(X1,X3,X2)
& below(X1,X2,X3) )
=> X2 = X3 ) ) ) ),
inference(assume_negation,[status(cth)],[t26_lattices]) ).
fof(c_0_5,plain,
! [X1,X2,X3] :
( ( element(X3,the_carrier(X1))
& element(X2,the_carrier(X1))
& join_semilatt_str(X1)
& join_commutative(X1)
& ~ empty_carrier(X1) )
=> join_commut(X1,X2,X3) = join(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[redefinition_k3_lattices]) ).
fof(c_0_6,negated_conjecture,
~ ! [X1] :
( ( join_semilatt_str(X1)
& join_commutative(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> ! [X3] :
( element(X3,the_carrier(X1))
=> ( ( below(X1,X3,X2)
& below(X1,X2,X3) )
=> X2 = X3 ) ) ) ),
inference(fof_simplification,[status(thm)],[c_0_4]) ).
fof(c_0_7,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_8,plain,
! [X1,X2,X3] :
( ( element(X3,the_carrier(X1))
& element(X2,the_carrier(X1))
& join_semilatt_str(X1)
& join_commutative(X1)
& ~ empty_carrier(X1) )
=> join_commut(X1,X2,X3) = join_commut(X1,X3,X2) ),
inference(fof_simplification,[status(thm)],[commutativity_k3_lattices]) ).
fof(c_0_9,plain,
! [X710,X711,X712] :
( join_commut(X710,X711,X712) = join(X710,X711,X712)
| ~ element(X712,the_carrier(X710))
| ~ element(X711,the_carrier(X710))
| ~ join_semilatt_str(X710)
| ~ join_commutative(X710)
| empty_carrier(X710) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])]) ).
fof(c_0_10,negated_conjecture,
( esk291_0 != esk292_0
& below(esk290_0,esk292_0,esk291_0)
& below(esk290_0,esk291_0,esk292_0)
& element(esk292_0,the_carrier(esk290_0))
& element(esk291_0,the_carrier(esk290_0))
& join_semilatt_str(esk290_0)
& join_commutative(esk290_0)
& ~ empty_carrier(esk290_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
fof(c_0_11,plain,
! [X298,X299,X300] :
( ( ~ join_semilatt_str(X298)
| empty_carrier(X298)
| ~ element(X299,the_carrier(X298))
| ~ element(X300,the_carrier(X298))
| below(X298,X299,X300)
| join(X298,X299,X300) != X300 )
& ( ~ join_semilatt_str(X298)
| empty_carrier(X298)
| ~ element(X299,the_carrier(X298))
| ~ element(X300,the_carrier(X298))
| join(X298,X299,X300) = X300
| ~ below(X298,X299,X300) ) ),
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_7])])])])]) ).
fof(c_0_12,plain,
! [X47,X48,X49] :
( join_commut(X47,X48,X49) = join_commut(X47,X49,X48)
| ~ element(X49,the_carrier(X47))
| ~ element(X48,the_carrier(X47))
| ~ join_semilatt_str(X47)
| ~ join_commutative(X47)
| empty_carrier(X47) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).
cnf(c_0_13,plain,
( ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ join_semilatt_str(X1)
| ~ join_commutative(X1)
| join_commut(X1,X2,X3) = join(X1,X2,X3)
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_14,negated_conjecture,
element(esk292_0,the_carrier(esk290_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_15,negated_conjecture,
join_semilatt_str(esk290_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,negated_conjecture,
join_commutative(esk290_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_17,negated_conjecture,
~ empty_carrier(esk290_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,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_11]) ).
cnf(c_0_19,negated_conjecture,
below(esk290_0,esk291_0,esk292_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_20,negated_conjecture,
element(esk291_0,the_carrier(esk290_0)),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_21,negated_conjecture,
below(esk290_0,esk292_0,esk291_0),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_22,plain,
( ~ element(X3,the_carrier(X1))
| ~ element(X2,the_carrier(X1))
| ~ join_semilatt_str(X1)
| ~ join_commutative(X1)
| join_commut(X1,X2,X3) = join_commut(X1,X3,X2)
| empty_carrier(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_23,negated_conjecture,
( ~ element(X1,the_carrier(esk290_0))
| join_commut(esk290_0,X1,esk292_0) = join(esk290_0,X1,esk292_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_24,negated_conjecture,
join(esk290_0,esk291_0,esk292_0) = esk292_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_18,c_0_19]),c_0_15]),c_0_14]),c_0_20])]),c_0_17]) ).
cnf(c_0_25,negated_conjecture,
( ~ element(X1,the_carrier(esk290_0))
| join_commut(esk290_0,X1,esk291_0) = join(esk290_0,X1,esk291_0) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_20]),c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_26,negated_conjecture,
join(esk290_0,esk292_0,esk291_0) = esk291_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_18,c_0_21]),c_0_15]),c_0_20]),c_0_14])]),c_0_17]) ).
cnf(c_0_27,negated_conjecture,
( ~ element(X1,the_carrier(esk290_0))
| join_commut(esk290_0,X1,esk292_0) = join_commut(esk290_0,esk292_0,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_14]),c_0_15]),c_0_16])]),c_0_17]) ).
cnf(c_0_28,negated_conjecture,
join_commut(esk290_0,esk291_0,esk292_0) = esk292_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_20]),c_0_24]) ).
cnf(c_0_29,negated_conjecture,
join_commut(esk290_0,esk292_0,esk291_0) = esk291_0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_14]),c_0_26]) ).
cnf(c_0_30,negated_conjecture,
esk291_0 != esk292_0,
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_20]),c_0_28]),c_0_29]),c_0_30]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU305+2 : TPTP v9.3.1. Released v3.3.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 06:12:52 UTC 2026
% 0.03/0.38 % CPUTime :
% 0.03/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.03/0.42 Running first-order theorem proving
% 0.03/0.42 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
% 19.15/2.97 % Version: 3.5.1
% 19.15/2.97 % Preprocessing class: FSLSSMSSSSSNFFN.
% 19.15/2.97 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.15/2.97 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 19.15/2.97 % Starting new_bool_3 with 300s (1) cores
% 19.15/2.97 % Starting new_bool_1 with 300s (1) cores
% 19.15/2.97 % Starting sh5l with 300s (1) cores
% 19.15/2.97 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 1536675 completed with status 0
% 19.15/2.97 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 19.15/2.97 % Preprocessing class: FSLSSMSSSSSNFFN.
% 19.15/2.97 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.15/2.97 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 19.15/2.97 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 19.15/2.97 % No SInE strategy applied
% 19.15/2.97 % Search class: FGHSM-SMLM32-MFFFFFNN
% 19.15/2.97 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 19.15/2.97 % Starting SubtermCWHack with 136s (1) cores
% 19.15/2.97 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 19.15/2.97 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 113s (1) cores
% 19.15/2.97 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 113s (1) cores
% 19.15/2.97 % Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 113s (1) cores
% 19.15/2.97 % G-E--_208_C18_F1_SE_CS_SP_PS_S2g with pid 1536726 completed with status 0
% 19.15/2.97 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S2g
% 19.15/2.97 % Preprocessing class: FSLSSMSSSSSNFFN.
% 19.15/2.97 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 19.15/2.97 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 19.15/2.97 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 19.15/2.97 % No SInE strategy applied
% 19.15/2.97 % Search class: FGHSM-SMLM32-MFFFFFNN
% 19.15/2.97 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 19.15/2.97 % Starting SubtermCWHack with 136s (1) cores
% 19.15/2.97 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 19.15/2.97 % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 113s (1) cores
% 19.15/2.97 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S2g with 113s (1) cores
% 19.15/2.97 % Preprocessing time : 0.022 s
% 19.15/2.97 % Presaturation interreduction done
% 19.15/2.97
% 19.15/2.97 % Proof found!
% 19.15/2.97 % SZS status Theorem
% 19.15/2.97 % SZS output start CNFRefutation
% See solution above
% 19.15/2.97 % Parsed axioms : 454
% 19.15/2.97 % Removed by relevancy pruning/SinE : 0
% 19.15/2.98 % Initial clauses : 1784
% 19.15/2.98 % Removed in clause preprocessing : 40
% 19.15/2.98 % Initial clauses in saturation : 1744
% 19.15/2.98 % Processed clauses : 11927
% 19.15/2.98 % ...of these trivial : 624
% 19.15/2.98 % ...subsumed : 3710
% 19.15/2.98 % ...remaining for further processing : 7593
% 19.15/2.98 % Other redundant clauses eliminated : 645
% 19.15/2.98 % Clauses deleted for lack of memory : 0
% 19.15/2.98 % Backward-subsumed : 25
% 19.15/2.98 % Backward-rewritten : 231
% 19.15/2.98 % Generated clauses : 144754
% 19.15/2.98 % ...of the previous two non-redundant : 140279
% 19.15/2.98 % ...aggressively subsumed : 0
% 19.15/2.98 % Contextual simplify-reflections : 189
% 19.15/2.98 % Paramodulations : 144223
% 19.15/2.98 % Factorizations : 8
% 19.15/2.98 % NegExts : 0
% 19.15/2.98 % Equation resolutions : 652
% 19.15/2.98 % Disequality decompositions : 0
% 19.15/2.98 % Total rewrite steps : 30189
% 19.15/2.98 % ...of those cached : 28077
% 19.15/2.98 % Propositional unsat checks : 0
% 19.15/2.98 % Propositional check models : 0
% 19.15/2.98 % Propositional check unsatisfiable : 0
% 19.15/2.98 % Propositional clauses : 0
% 19.15/2.98 % Propositional clauses after purity: 0
% 19.15/2.98 % Propositional unsat core size : 0
% 19.15/2.98 % Propositional preprocessing time : 0.000
% 19.15/2.98 % Propositional encoding time : 0.000
% 19.15/2.98 % Propositional solver time : 0.000
% 19.15/2.98 % Success case prop preproc time : 0.000
% 19.15/2.98 % Success case prop encoding time : 0.000
% 19.15/2.98 % Success case prop solver time : 0.000
% 19.15/2.98 % Current number of processed clauses : 5353
% 19.15/2.98 % Positive orientable unit clauses : 1190
% 19.15/2.98 % Positive unorientable unit clauses: 3
% 19.15/2.98 % Negative unit clauses : 760
% 19.15/2.98 % Non-unit-clauses : 3400
% 19.15/2.98 % Current number of unprocessed clauses: 131179
% 19.15/2.98 % ...number of literals in the above : 291076
% 19.15/2.98 % Current number of archived formulas : 0
% 19.15/2.98 % Current number of archived clauses : 1876
% 19.15/2.98 % Clause-clause subsumption calls (NU) : 2838102
% 19.15/2.98 % Rec. Clause-clause subsumption calls : 878750
% 19.15/2.98 % Non-unit clause-clause subsumptions : 1815
% 19.15/2.98 % Unit Clause-clause subsumption calls : 165947
% 19.15/2.98 % Rewrite failures with RHS unbound : 0
% 19.15/2.98 % BW rewrite match attempts : 2218
% 19.15/2.98 % BW rewrite match successes : 123
% 19.15/2.98 % Condensation attempts : 0
% 19.15/2.98 % Condensation successes : 0
% 19.15/2.98 % Termbank termtop insertions : 2155796
% 19.15/2.98 % Search garbage collected termcells : 25041
% 19.15/2.98
% 19.15/2.98 % -------------------------------------------------
% 19.15/2.98 % User time : 2.358 s
% 19.15/2.98 % System time : 0.110 s
% 19.15/2.98 % Total time : 2.467 s
% 19.15/2.98 % Maximum resident set size: 8280 pages
% 19.15/2.98
% 19.15/2.98 % -------------------------------------------------
% 19.15/2.98 % User time : 11.531 s
% 19.15/2.98 % System time : 0.398 s
% 19.15/2.98 % Total time : 11.929 s
% 19.15/2.98 % Maximum resident set size: 5376 pages
% 19.15/2.98 % E exiting
%------------------------------------------------------------------------------