%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LAT013-1 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:05:19 PM UTC 2026
% Result : Unsatisfiable 11.90s 2.24s
% Output : CNFRefutation 11.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 5
% Syntax : Number of clauses : 64 ( 64 unt; 0 nHn; 5 RR)
% Number of literals : 64 ( 63 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 158 ( 46 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(mckenzie2,axiom,
meet(X1,join(X2,join(X1,X3))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mckenzie2) ).
cnf(mckenzie1,axiom,
join(X1,meet(X2,meet(X1,X3))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mckenzie1) ).
cnf(mckenzie4,axiom,
meet(meet(join(X1,X2),join(X2,X3)),X2) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mckenzie4) ).
cnf(mckenzie3,axiom,
join(join(meet(X1,X2),meet(X2,X3)),X2) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mckenzie3) ).
cnf(prove_associativity_of_meet,negated_conjecture,
meet(meet(a,b),c) != meet(a,meet(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_associativity_of_meet) ).
cnf(c_0_5,axiom,
meet(X1,join(X2,join(X1,X3))) = X1,
mckenzie2 ).
cnf(c_0_6,axiom,
join(X1,meet(X2,meet(X1,X3))) = X1,
mckenzie1 ).
cnf(c_0_7,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_5]) ).
cnf(c_0_9,axiom,
meet(meet(join(X1,X2),join(X2,X3)),X2) = X2,
mckenzie4 ).
cnf(c_0_10,plain,
meet(meet(X1,X2),X2) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,axiom,
join(join(meet(X1,X2),meet(X2,X3)),X2) = X2,
mckenzie3 ).
cnf(c_0_12,plain,
join(join(X1,X2),X2) = join(X1,X2),
inference(spm,[status(thm)],[c_0_8,c_0_7]) ).
cnf(c_0_13,plain,
join(X1,meet(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_9]) ).
cnf(c_0_14,plain,
meet(join(X1,X2),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_6]),c_0_10]) ).
cnf(c_0_15,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_16,plain,
join(meet(X1,X2),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_5]),c_0_12]) ).
cnf(c_0_17,plain,
meet(meet(X1,X2),X1) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_7,c_0_13]) ).
cnf(c_0_18,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_14,c_0_8]) ).
cnf(c_0_19,plain,
meet(X1,join(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_15]) ).
cnf(c_0_20,plain,
meet(meet(X1,join(meet(X2,X1),X3)),meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_9,c_0_8]) ).
cnf(c_0_21,plain,
join(meet(X1,X2),X1) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_22,plain,
meet(join(X1,join(X2,X3)),X2) = X2,
inference(spm,[status(thm)],[c_0_18,c_0_5]) ).
cnf(c_0_23,plain,
join(join(X1,X2),X1) = join(X1,X2),
inference(spm,[status(thm)],[c_0_8,c_0_19]) ).
cnf(c_0_24,plain,
meet(meet(X1,X2),meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_16,c_0_7]) ).
cnf(c_0_26,plain,
join(X1,meet(meet(X1,X2),X3)) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_17]) ).
cnf(c_0_27,plain,
meet(join(join(X1,X2),X3),X1) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_24]),c_0_24]) ).
cnf(c_0_29,plain,
join(meet(meet(X1,X2),X3),X1) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_30,plain,
join(join(X1,meet(join(X2,X1),X3)),join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_11,c_0_7]) ).
cnf(c_0_31,plain,
meet(join(X1,X2),meet(X3,X1)) = meet(X3,X1),
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_32,plain,
meet(X1,meet(X2,meet(X1,X3))) = meet(X2,meet(X1,X3)),
inference(spm,[status(thm)],[c_0_14,c_0_6]) ).
cnf(c_0_33,plain,
meet(meet(X1,X2),meet(X2,join(meet(X1,X2),X3))) = meet(X1,X2),
inference(rw,[status(thm)],[c_0_20,c_0_28]) ).
cnf(c_0_34,plain,
join(meet(X1,X2),join(X3,X1)) = join(X3,X1),
inference(spm,[status(thm)],[c_0_29,c_0_14]) ).
cnf(c_0_35,plain,
join(join(X1,meet(X2,X3)),join(X3,X1)) = join(X3,X1),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_36,plain,
meet(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_37,plain,
meet(meet(X1,X2),meet(X3,meet(X2,X1))) = meet(X3,meet(X2,X1)),
inference(spm,[status(thm)],[c_0_32,c_0_24]) ).
cnf(c_0_38,plain,
meet(meet(X1,X2),meet(X2,join(X3,X1))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
join(join(X1,X2),join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
meet(meet(X1,X2),meet(join(X3,X1),X2)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_28]) ).
cnf(c_0_41,plain,
meet(meet(X1,X2),meet(X1,join(X3,X2))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_38,c_0_28]) ).
cnf(c_0_42,plain,
join(X1,X2) = join(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_39]),c_0_39]) ).
cnf(c_0_43,plain,
meet(meet(X1,X2),meet(join(X3,X2),X1)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_40,c_0_28]) ).
cnf(c_0_44,plain,
join(meet(X1,X2),meet(X1,join(X3,X2))) = meet(X1,join(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_41]),c_0_42]) ).
cnf(c_0_45,plain,
meet(meet(X1,X2),meet(X2,meet(X1,X3))) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_13]),c_0_28]) ).
cnf(c_0_46,plain,
meet(X1,meet(X2,join(X3,X1))) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_44]),c_0_45]) ).
cnf(c_0_47,plain,
join(join(X1,join(X2,X3)),X2) = join(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_8,c_0_5]) ).
cnf(c_0_48,plain,
meet(meet(X1,X2),meet(meet(X3,X1),X2)) = meet(meet(X3,X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_8]),c_0_28]) ).
cnf(c_0_49,plain,
meet(meet(X1,X2),meet(X3,X2)) = meet(X3,meet(X1,X2)),
inference(spm,[status(thm)],[c_0_46,c_0_8]) ).
cnf(c_0_50,plain,
meet(meet(X1,X2),meet(meet(X1,X3),X2)) = meet(meet(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_13]),c_0_28]) ).
cnf(c_0_51,negated_conjecture,
meet(meet(a,b),c) != meet(a,meet(b,c)),
inference(fof_simplification,[status(thm)],[prove_associativity_of_meet]) ).
cnf(c_0_52,plain,
meet(join(X1,X2),meet(X3,X2)) = meet(X3,X2),
inference(spm,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_53,plain,
join(join(X1,X2),meet(X2,X3)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_47,c_0_21]) ).
cnf(c_0_54,plain,
meet(meet(X1,X2),meet(X2,X3)) = meet(meet(X1,X2),X3),
inference(rw,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_55,plain,
meet(meet(X1,X2),meet(X1,X3)) = meet(meet(X1,X2),X3),
inference(rw,[status(thm)],[c_0_50,c_0_49]) ).
cnf(c_0_56,negated_conjecture,
meet(meet(a,b),c) != meet(a,meet(b,c)),
c_0_51 ).
cnf(c_0_57,plain,
meet(X1,meet(X2,meet(X3,meet(X1,X4)))) = meet(X2,meet(X3,meet(X1,X4))),
inference(spm,[status(thm)],[c_0_32,c_0_32]) ).
cnf(c_0_58,plain,
meet(X1,meet(join(X2,X1),X3)) = meet(X3,X1),
inference(spm,[status(thm)],[c_0_46,c_0_28]) ).
cnf(c_0_59,plain,
meet(join(X1,X2),meet(X3,meet(X2,X4))) = meet(X3,meet(X2,X4)),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_60,plain,
meet(meet(X1,X2),X3) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_54]),c_0_55]) ).
cnf(c_0_61,negated_conjecture,
meet(c,meet(a,b)) != meet(a,meet(b,c)),
inference(rw,[status(thm)],[c_0_56,c_0_28]) ).
cnf(c_0_62,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X3,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_60]),c_0_60]),c_0_18]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62]),c_0_28]),c_0_62]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LAT013-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.45 % Computer : n009.cluster.edu
% 0.18/0.45 % Model : x86_64 x86_64
% 0.18/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.45 % Memory : 8046.5625MB
% 0.18/0.45 % OS : Linux 6.8.0-71-generic
% 0.18/0.45 % CPULimit : 300
% 0.18/0.45 % WCLimit : 300
% 0.18/0.45 % DateTime : Sun Sep 20 23:06:43 UTC 2026
% 0.18/0.46 % CPUTime :
% 0.18/0.46 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.53 Running first-order theorem proving
% 0.21/0.53 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
% 11.90/2.24 % Version: 3.5.1
% 11.90/2.24 % Preprocessing class: FSSSSMSSSSSNFFN.
% 11.90/2.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.90/2.24 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.90/2.24 % Starting new_bool_3 with 300s (1) cores
% 11.90/2.24 % Starting new_bool_1 with 300s (1) cores
% 11.90/2.24 % Starting sh5l with 300s (1) cores
% 11.90/2.24 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 249712 completed with status 0
% 11.90/2.24 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 11.90/2.24 % Preprocessing class: FSSSSMSSSSSNFFN.
% 11.90/2.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.90/2.24 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.90/2.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.90/2.24 % No SInE strategy applied
% 11.90/2.24 % Search class: FUUPM-FFSF22-MFFFFFNN
% 11.90/2.24 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 11.90/2.24 % Starting SubtermCWHack with 136s (1) cores
% 11.90/2.24 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 11.90/2.24 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 11.90/2.24 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 11.90/2.24 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 11.90/2.24 % E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 249717 completed with status 0
% 11.90/2.24 % Result found by E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 11.90/2.24 % Preprocessing class: FSSSSMSSSSSNFFN.
% 11.90/2.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 11.90/2.24 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 11.90/2.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 11.90/2.24 % No SInE strategy applied
% 11.90/2.24 % Search class: FUUPM-FFSF22-MFFFFFNN
% 11.90/2.24 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 11.90/2.24 % Starting SubtermCWHack with 136s (1) cores
% 11.90/2.24 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 11.90/2.24 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 11.90/2.24 % Preprocessing time : 0.002 s
% 11.90/2.24 % Presaturation interreduction done
% 11.90/2.24
% 11.90/2.24 % Proof found!
% 11.90/2.24 % SZS status Unsatisfiable
% 11.90/2.24 % SZS output start CNFRefutation
% See solution above
% 11.90/2.24 % Parsed axioms : 5
% 11.90/2.24 % Removed by relevancy pruning/SinE : 0
% 11.90/2.24 % Initial clauses : 5
% 11.90/2.24 % Removed in clause preprocessing : 0
% 11.90/2.24 % Initial clauses in saturation : 5
% 11.90/2.24 % Processed clauses : 2127
% 11.90/2.24 % ...of these trivial : 812
% 11.90/2.24 % ...subsumed : 974
% 11.90/2.24 % ...remaining for further processing : 341
% 11.90/2.24 % Other redundant clauses eliminated : 0
% 11.90/2.24 % Clauses deleted for lack of memory : 0
% 11.90/2.24 % Backward-subsumed : 0
% 11.90/2.24 % Backward-rewritten : 148
% 11.90/2.24 % Generated clauses : 113132
% 11.90/2.24 % ...of the previous two non-redundant : 55138
% 11.90/2.24 % ...aggressively subsumed : 0
% 11.90/2.24 % Contextual simplify-reflections : 0
% 11.90/2.24 % Paramodulations : 113132
% 11.90/2.24 % Factorizations : 0
% 11.90/2.24 % NegExts : 0
% 11.90/2.24 % Equation resolutions : 0
% 11.90/2.24 % Disequality decompositions : 0
% 11.90/2.24 % Total rewrite steps : 89422
% 11.90/2.24 % ...of those cached : 68996
% 11.90/2.24 % Propositional unsat checks : 0
% 11.90/2.24 % Propositional check models : 0
% 11.90/2.24 % Propositional check unsatisfiable : 0
% 11.90/2.24 % Propositional clauses : 0
% 11.90/2.24 % Propositional clauses after purity: 0
% 11.90/2.24 % Propositional unsat core size : 0
% 11.90/2.24 % Propositional preprocessing time : 0.000
% 11.90/2.24 % Propositional encoding time : 0.000
% 11.90/2.24 % Propositional solver time : 0.000
% 11.90/2.24 % Success case prop preproc time : 0.000
% 11.90/2.24 % Success case prop encoding time : 0.000
% 11.90/2.24 % Success case prop solver time : 0.000
% 11.90/2.24 % Current number of processed clauses : 188
% 11.90/2.24 % Positive orientable unit clauses : 185
% 11.90/2.24 % Positive unorientable unit clauses: 3
% 11.90/2.24 % Negative unit clauses : 0
% 11.90/2.24 % Non-unit-clauses : 0
% 11.90/2.24 % Current number of unprocessed clauses: 52313
% 11.90/2.24 % ...number of literals in the above : 52313
% 11.90/2.24 % Current number of archived formulas : 0
% 11.90/2.24 % Current number of archived clauses : 153
% 11.90/2.24 % Clause-clause subsumption calls (NU) : 0
% 11.90/2.24 % Rec. Clause-clause subsumption calls : 0
% 11.90/2.24 % Non-unit clause-clause subsumptions : 0
% 11.90/2.24 % Unit Clause-clause subsumption calls : 93
% 11.90/2.24 % Rewrite failures with RHS unbound : 0
% 11.90/2.24 % BW rewrite match attempts : 1496
% 11.90/2.24 % BW rewrite match successes : 468
% 11.90/2.24 % Condensation attempts : 0
% 11.90/2.24 % Condensation successes : 0
% 11.90/2.24 % Termbank termtop insertions : 1022897
% 11.90/2.24 % Search garbage collected termcells : 2
% 11.90/2.24
% 11.90/2.24 % -------------------------------------------------
% 11.90/2.24 % User time : 1.412 s
% 11.90/2.24 % System time : 0.061 s
% 11.90/2.24 % Total time : 1.473 s
% 11.90/2.24 % Maximum resident set size: 3632 pages
% 11.90/2.24
% 11.90/2.24 % -------------------------------------------------
% 11.90/2.24 % User time : 7.516 s
% 11.90/2.24 % System time : 0.290 s
% 11.90/2.24 % Total time : 7.805 s
% 11.90/2.24 % Maximum resident set size: 4864 pages
% 11.90/2.24 % E exiting
%------------------------------------------------------------------------------