%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT174-1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:04:23 PM UTC 2026
% Result : Unsatisfiable 194.89s 28.77s
% Output : CNFRefutation 194.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of clauses : 57 ( 57 unt; 0 nHn; 5 RR)
% Number of literals : 57 ( 56 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 139 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).
cnf(equation_H76_dual,axiom,
join(X1,meet(X2,join(X3,meet(X2,X4)))) = join(X1,meet(X2,join(X3,meet(X4,join(X1,X2))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equation_H76_dual) ).
cnf(prove_H6,negated_conjecture,
meet(a,join(b,meet(a,c))) != meet(a,join(meet(a,join(b,meet(a,c))),meet(c,join(a,b)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_H6) ).
cnf(c_0_9,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_10,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_11,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_12,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_13,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_14,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_16,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_17,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
join(meet(X1,X2),meet(X1,meet(X2,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_19,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_21,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_22,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_23,plain,
meet(X1,join(X2,join(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_24,plain,
join(meet(X1,X2),meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_10]),c_0_9]),c_0_19]),c_0_9]),c_0_19]) ).
cnf(c_0_25,plain,
meet(join(X1,X2),join(meet(X1,X3),X2)) = join(meet(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_20]),c_0_15]) ).
cnf(c_0_26,plain,
join(X1,join(X2,X3)) = join(X2,join(X3,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_27,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_11]),c_0_16]) ).
cnf(c_0_28,plain,
join(meet(X1,X2),meet(join(X1,X3),X2)) = meet(join(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_12]) ).
cnf(c_0_29,plain,
meet(X1,meet(X2,join(X3,meet(X2,X1)))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_9]) ).
cnf(c_0_30,plain,
meet(X1,join(meet(X1,X2),meet(X1,X3))) = join(meet(X1,X2),meet(X1,X3)),
inference(spm,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_31,plain,
join(X1,join(X2,X3)) = join(X3,join(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_16]),c_0_27]) ).
cnf(c_0_32,plain,
join(meet(X1,X2),join(meet(X2,X1),X3)) = join(meet(X1,X2),X3),
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_33,plain,
join(X1,meet(X2,meet(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_9]) ).
cnf(c_0_34,plain,
meet(join(X1,X2),join(X2,X1)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
cnf(c_0_35,plain,
join(X1,join(X2,meet(X3,join(X1,X2)))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_36,plain,
join(X1,meet(join(X1,X2),join(X3,X1))) = meet(join(X1,X2),join(X3,X1)),
inference(spm,[status(thm)],[c_0_28,c_0_17]) ).
cnf(c_0_37,plain,
meet(X1,join(meet(X2,X3),meet(X2,X1))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,plain,
join(meet(X1,X2),X3) = join(X3,meet(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_24]) ).
cnf(c_0_39,plain,
join(X1,join(X2,meet(X3,join(X2,X1)))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_16]) ).
cnf(c_0_40,plain,
join(X1,meet(join(X1,X2),join(X1,X3))) = meet(join(X1,X2),join(X1,X3)),
inference(spm,[status(thm)],[c_0_28,c_0_11]) ).
cnf(c_0_41,plain,
join(X1,meet(join(X2,X3),join(X1,X2))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
meet(X1,join(meet(X1,X2),meet(X2,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
join(X1,meet(join(X2,X3),join(X2,X1))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
join(X1,meet(join(X2,X3),join(X1,X3))) = join(X1,X3),
inference(spm,[status(thm)],[c_0_41,c_0_12]) ).
cnf(c_0_45,plain,
meet(X1,join(X2,meet(X1,join(X2,X3)))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_12]) ).
cnf(c_0_46,axiom,
join(X1,meet(X2,join(X3,meet(X2,X4)))) = join(X1,meet(X2,join(X3,meet(X4,join(X1,X2))))),
equation_H76_dual ).
cnf(c_0_47,plain,
join(X1,meet(X2,join(X1,meet(X2,X3)))) = join(X1,meet(X2,X3)),
inference(spm,[status(thm)],[c_0_44,c_0_13]) ).
cnf(c_0_48,negated_conjecture,
meet(a,join(b,meet(a,c))) != meet(a,join(meet(a,join(b,meet(a,c))),meet(c,join(a,b)))),
inference(fof_simplification,[status(thm)],[prove_H6]) ).
cnf(c_0_49,plain,
join(X1,meet(join(X2,X3),join(X3,X1))) = join(X1,X3),
inference(spm,[status(thm)],[c_0_43,c_0_12]) ).
cnf(c_0_50,plain,
meet(X1,join(X2,meet(X3,join(X2,X1)))) = meet(X1,join(X2,meet(X1,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_51,negated_conjecture,
meet(a,join(b,meet(a,c))) != meet(a,join(meet(a,join(b,meet(a,c))),meet(c,join(a,b)))),
c_0_48 ).
cnf(c_0_52,plain,
meet(X1,join(X2,meet(X1,join(X3,X2)))) = meet(X1,join(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_49]),c_0_12]) ).
cnf(c_0_53,plain,
meet(X1,join(X2,meet(X3,join(X1,X2)))) = meet(X1,join(X2,meet(X1,X3))),
inference(spm,[status(thm)],[c_0_50,c_0_12]) ).
cnf(c_0_54,negated_conjecture,
meet(a,join(meet(c,join(a,b)),meet(a,join(b,meet(a,c))))) != meet(a,join(b,meet(a,c))),
inference(rw,[status(thm)],[c_0_51,c_0_12]) ).
cnf(c_0_55,plain,
meet(X1,join(meet(X2,join(X1,X3)),meet(X1,join(X3,meet(X1,X2))))) = meet(X1,join(X3,meet(X1,X2))),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_56,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_55])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LAT174-1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.43 % Computer : n011.cluster.edu
% 0.19/0.43 % Model : x86_64 x86_64
% 0.19/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.43 % Memory : 8046.5625MB
% 0.19/0.43 % OS : Linux 6.8.0-71-generic
% 0.19/0.43 % CPULimit : 300
% 0.19/0.43 % WCLimit : 300
% 0.19/0.43 % DateTime : Sun Sep 20 23:17:40 UTC 2026
% 0.19/0.44 % CPUTime :
% 0.19/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.26/0.51 Running first-order theorem proving
% 0.26/0.51 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
% 194.89/28.77 % Version: 3.5.1
% 194.89/28.77 % Preprocessing class: FSSSSMSSSSSNFFN.
% 194.89/28.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 194.89/28.77 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 194.89/28.77 % Starting new_bool_3 with 300s (1) cores
% 194.89/28.77 % Starting new_bool_1 with 300s (1) cores
% 194.89/28.77 % Starting sh5l with 300s (1) cores
% 194.89/28.77 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 401224 completed with status 0
% 194.89/28.77 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 194.89/28.77 % Preprocessing class: FSSSSMSSSSSNFFN.
% 194.89/28.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 194.89/28.77 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 194.89/28.77 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 194.89/28.77 % No SInE strategy applied
% 194.89/28.77 % Search class: FUUPM-FFSF22-MFFFFFNN
% 194.89/28.77 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 194.89/28.77 % Starting SubtermCWHack with 136s (1) cores
% 194.89/28.77 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 194.89/28.77 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 194.89/28.77 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 194.89/28.77 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 194.89/28.77 % U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 401235 completed with status 0
% 194.89/28.77 % Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 194.89/28.77 % Preprocessing class: FSSSSMSSSSSNFFN.
% 194.89/28.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 194.89/28.77 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 194.89/28.77 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 194.89/28.77 % No SInE strategy applied
% 194.89/28.77 % Search class: FUUPM-FFSF22-MFFFFFNN
% 194.89/28.77 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 194.89/28.77 % Starting SubtermCWHack with 136s (1) cores
% 194.89/28.77 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 194.89/28.77 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 194.89/28.77 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 194.89/28.77 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 194.89/28.77 % Preprocessing time : 0.002 s
% 194.89/28.77 % Presaturation interreduction done
% 194.89/28.77
% 194.89/28.77 % Proof found!
% 194.89/28.77 % SZS status Unsatisfiable
% 194.89/28.77 % SZS output start CNFRefutation
% See solution above
% 194.89/28.77 % Parsed axioms : 10
% 194.89/28.77 % Removed by relevancy pruning/SinE : 0
% 194.89/28.77 % Initial clauses : 10
% 194.89/28.77 % Removed in clause preprocessing : 0
% 194.89/28.77 % Initial clauses in saturation : 10
% 194.89/28.77 % Processed clauses : 64272
% 194.89/28.77 % ...of these trivial : 31302
% 194.89/28.77 % ...subsumed : 32073
% 194.89/28.77 % ...remaining for further processing : 897
% 194.89/28.77 % Other redundant clauses eliminated : 0
% 194.89/28.77 % Clauses deleted for lack of memory : 0
% 194.89/28.77 % Backward-subsumed : 0
% 194.89/28.77 % Backward-rewritten : 5
% 194.89/28.77 % Generated clauses : 1125821
% 194.89/28.77 % ...of the previous two non-redundant : 695185
% 194.89/28.77 % ...aggressively subsumed : 0
% 194.89/28.77 % Contextual simplify-reflections : 0
% 194.89/28.77 % Paramodulations : 1125821
% 194.89/28.77 % Factorizations : 0
% 194.89/28.77 % NegExts : 0
% 194.89/28.77 % Equation resolutions : 0
% 194.89/28.77 % Disequality decompositions : 0
% 194.89/28.77 % Total rewrite steps : 1907372
% 194.89/28.77 % ...of those cached : 1549000
% 194.89/28.77 % Propositional unsat checks : 0
% 194.89/28.77 % Propositional check models : 0
% 194.89/28.77 % Propositional check unsatisfiable : 0
% 194.89/28.77 % Propositional clauses : 0
% 194.89/28.77 % Propositional clauses after purity: 0
% 194.89/28.77 % Propositional unsat core size : 0
% 194.89/28.77 % Propositional preprocessing time : 0.000
% 194.89/28.77 % Propositional encoding time : 0.000
% 194.89/28.77 % Propositional solver time : 0.000
% 194.89/28.77 % Success case prop preproc time : 0.000
% 194.89/28.77 % Success case prop encoding time : 0.000
% 194.89/28.77 % Success case prop solver time : 0.000
% 194.89/28.77 % Current number of processed clauses : 882
% 194.89/28.77 % Positive orientable unit clauses : 872
% 194.89/28.77 % Positive unorientable unit clauses: 10
% 194.89/28.77 % Negative unit clauses : 0
% 194.89/28.77 % Non-unit-clauses : 0
% 194.89/28.77 % Current number of unprocessed clauses: 630872
% 194.89/28.77 % ...number of literals in the above : 630872
% 194.89/28.77 % Current number of archived formulas : 0
% 194.89/28.77 % Current number of archived clauses : 15
% 194.89/28.77 % Clause-clause subsumption calls (NU) : 0
% 194.89/28.77 % Rec. Clause-clause subsumption calls : 0
% 194.89/28.77 % Non-unit clause-clause subsumptions : 0
% 194.89/28.77 % Unit Clause-clause subsumption calls : 68
% 194.89/28.77 % Rewrite failures with RHS unbound : 0
% 194.89/28.77 % BW rewrite match attempts : 34027
% 194.89/28.77 % BW rewrite match successes : 301
% 194.89/28.77 % Condensation attempts : 0
% 194.89/28.77 % Condensation successes : 0
% 194.89/28.77 % Termbank termtop insertions : 14887802
% 194.89/28.77 % Search garbage collected termcells : 2
% 194.89/28.77
% 194.89/28.77 % -------------------------------------------------
% 194.89/28.77 % User time : 27.063 s
% 194.89/28.77 % System time : 0.906 s
% 194.89/28.77 % Total time : 27.969 s
% 194.89/28.77 % Maximum resident set size: 3640 pages
% 194.89/28.77
% 194.89/28.77 % -------------------------------------------------
% 194.89/28.77 % User time : 134.625 s
% 194.89/28.77 % System time : 4.069 s
% 194.89/28.77 % Total time : 138.695 s
% 194.89/28.77 % Maximum resident set size: 4608 pages
% 194.89/28.77 % E exiting
%------------------------------------------------------------------------------