%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT010-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 : n003.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:01 PM UTC 2026
% Result : Unsatisfiable 0.69s 0.60s
% Output : CNFRefutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 52 ( 52 unt; 0 nHn; 5 RR)
% Number of literals : 52 ( 51 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 124 ( 15 sgn)
% Comments :
%------------------------------------------------------------------------------
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_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(nr_3,hypothesis,
meet(join(X1,meet(X2,X3)),join(X3,meet(X1,X2))) = join(meet(X3,join(X1,meet(X2,X3))),meet(X1,join(X2,X3))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',nr_3) ).
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(prove_this,negated_conjecture,
meet(a,meet(join(b,c),join(b,d))) != meet(meet(a,meet(join(b,c),join(b,d))),join(meet(a,join(b,meet(c,d))),join(meet(a,c),meet(a,d)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_this) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).
cnf(c_0_9,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_10,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_11,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_12,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_13,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_14,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_16,hypothesis,
meet(join(X1,meet(X2,X3)),join(X3,meet(X1,X2))) = join(meet(X3,join(X1,meet(X2,X3))),meet(X1,join(X2,X3))),
nr_3 ).
cnf(c_0_17,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_18,plain,
meet(X1,meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_11]),c_0_13]) ).
cnf(c_0_19,plain,
join(X1,meet(X2,meet(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_20,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_21,hypothesis,
join(meet(X1,join(X2,X3)),meet(X3,join(X1,meet(X2,X3)))) = meet(join(X1,meet(X2,X3)),join(X3,meet(X1,X2))),
inference(rw,[status(thm)],[c_0_16,c_0_10]) ).
cnf(c_0_22,plain,
meet(X1,meet(X2,join(X1,X3))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_17]) ).
cnf(c_0_23,plain,
join(X1,join(X2,meet(X3,X1))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_9]),c_0_20]) ).
cnf(c_0_24,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_20,c_0_11]) ).
cnf(c_0_25,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_9]),c_0_20]) ).
cnf(c_0_26,hypothesis,
meet(X1,meet(join(X2,X3),meet(join(X1,meet(X2,X3)),join(X3,meet(X1,X2))))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_21]),c_0_13]) ).
cnf(c_0_27,plain,
meet(X1,meet(X2,meet(join(X1,X3),X4))) = meet(X1,meet(X2,X4)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_22]),c_0_13]),c_0_13]) ).
cnf(c_0_28,plain,
meet(join(X1,X2),join(X2,meet(X3,X1))) = join(X2,meet(X3,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_23]),c_0_12]) ).
cnf(c_0_29,plain,
join(X1,join(X2,meet(X1,X3))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_24]) ).
cnf(c_0_30,hypothesis,
meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(X3,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_27]),c_0_28]) ).
cnf(c_0_31,plain,
meet(join(X1,X2),join(X2,meet(X1,X3))) = join(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_29]),c_0_12]) ).
cnf(c_0_32,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X1,X2)),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_33,plain,
meet(join(X1,X2),join(X2,X1)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_25]) ).
cnf(c_0_34,hypothesis,
meet(X1,join(X2,meet(X3,X1))) = meet(X1,join(X3,X2)),
inference(spm,[status(thm)],[c_0_30,c_0_12]) ).
cnf(c_0_35,negated_conjecture,
meet(a,meet(join(b,c),join(b,d))) != meet(meet(a,meet(join(b,c),join(b,d))),join(meet(a,join(b,meet(c,d))),join(meet(a,c),meet(a,d)))),
inference(fof_simplification,[status(thm)],[prove_this]) ).
cnf(c_0_36,plain,
join(X1,join(X2,meet(X3,join(X1,X2)))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_15,c_0_20]) ).
cnf(c_0_37,plain,
join(meet(X1,X2),meet(X1,X3)) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_11]),c_0_30]),c_0_30]) ).
cnf(c_0_38,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X2,X1)),
inference(spm,[status(thm)],[c_0_32,c_0_12]) ).
cnf(c_0_39,plain,
meet(join(X1,X2),meet(join(X2,X1),X3)) = meet(join(X1,X2),X3),
inference(spm,[status(thm)],[c_0_13,c_0_33]) ).
cnf(c_0_40,plain,
join(meet(X1,X2),meet(X2,X3)) = meet(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_15]),c_0_30]),c_0_34]) ).
cnf(c_0_41,negated_conjecture,
meet(a,meet(join(b,c),join(b,d))) != meet(meet(a,meet(join(b,c),join(b,d))),join(meet(a,join(b,meet(c,d))),join(meet(a,c),meet(a,d)))),
c_0_35 ).
cnf(c_0_42,plain,
join(X1,meet(X2,join(X3,X1))) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_23]) ).
cnf(c_0_43,plain,
meet(join(X1,X2),X3) = meet(X3,join(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_33]) ).
cnf(c_0_44,plain,
join(X1,meet(join(X1,X2),X3)) = meet(join(X1,X2),join(X1,X3)),
inference(spm,[status(thm)],[c_0_40,c_0_9]) ).
cnf(c_0_45,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_46,negated_conjecture,
meet(a,meet(join(b,c),meet(join(b,d),join(meet(a,join(b,meet(c,d))),join(meet(a,c),meet(a,d)))))) != meet(a,meet(join(b,c),join(b,d))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_13]),c_0_13]) ).
cnf(c_0_47,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_10,c_0_20]) ).
cnf(c_0_48,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_12]),c_0_13]) ).
cnf(c_0_49,plain,
meet(join(X1,X2),join(X1,X3)) = join(X1,meet(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]) ).
cnf(c_0_50,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_45]) ).
cnf(c_0_51,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_37]),c_0_37]),c_0_20]),c_0_47]),c_0_10]),c_0_11]),c_0_10]),c_0_48]),c_0_49]),c_0_12]),c_0_14]),c_0_48]),c_0_49]),c_0_12]),c_0_50]),c_0_49]),c_0_12])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT010-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n003.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 23:07:47 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40 Running first-order theorem proving
% 0.10/0.40 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.69/0.60 % Version: 3.5.1
% 0.69/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.69/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.69/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.69/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.69/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.69/0.60 % Starting sh5l with 300s (1) cores
% 0.69/0.60 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2815300 completed with status 0
% 0.69/0.60 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.69/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.69/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.69/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.69/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.69/0.60 % No SInE strategy applied
% 0.69/0.60 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.69/0.60 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.69/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.69/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.69/0.60 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.69/0.60 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.69/0.60 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.69/0.60 % E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 2815307 completed with status 0
% 0.69/0.60 % Result found by E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 0.69/0.60 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.69/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.69/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.69/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.69/0.60 % No SInE strategy applied
% 0.69/0.60 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.69/0.60 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.69/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.69/0.60 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.69/0.60 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.69/0.60 % Preprocessing time : 0.001 s
% 0.69/0.60 % Presaturation interreduction done
% 0.69/0.60
% 0.69/0.60 % Proof found!
% 0.69/0.60 % SZS status Unsatisfiable
% 0.69/0.60 % SZS output start CNFRefutation
% See solution above
% 0.69/0.60 % Parsed axioms : 12
% 0.69/0.60 % Removed by relevancy pruning/SinE : 0
% 0.69/0.60 % Initial clauses : 12
% 0.69/0.60 % Removed in clause preprocessing : 0
% 0.69/0.60 % Initial clauses in saturation : 12
% 0.69/0.60 % Processed clauses : 1166
% 0.69/0.60 % ...of these trivial : 274
% 0.69/0.60 % ...subsumed : 740
% 0.69/0.60 % ...remaining for further processing : 152
% 0.69/0.60 % Other redundant clauses eliminated : 0
% 0.69/0.60 % Clauses deleted for lack of memory : 0
% 0.69/0.60 % Backward-subsumed : 0
% 0.69/0.60 % Backward-rewritten : 42
% 0.69/0.60 % Generated clauses : 22336
% 0.69/0.60 % ...of the previous two non-redundant : 15422
% 0.69/0.60 % ...aggressively subsumed : 0
% 0.69/0.60 % Contextual simplify-reflections : 0
% 0.69/0.60 % Paramodulations : 22336
% 0.69/0.60 % Factorizations : 0
% 0.69/0.60 % NegExts : 0
% 0.69/0.60 % Equation resolutions : 0
% 0.69/0.60 % Disequality decompositions : 0
% 0.69/0.60 % Total rewrite steps : 44983
% 0.69/0.60 % ...of those cached : 33236
% 0.69/0.60 % Propositional unsat checks : 0
% 0.69/0.60 % Propositional check models : 0
% 0.69/0.60 % Propositional check unsatisfiable : 0
% 0.69/0.60 % Propositional clauses : 0
% 0.69/0.60 % Propositional clauses after purity: 0
% 0.69/0.60 % Propositional unsat core size : 0
% 0.69/0.60 % Propositional preprocessing time : 0.000
% 0.69/0.60 % Propositional encoding time : 0.000
% 0.69/0.60 % Propositional solver time : 0.000
% 0.69/0.60 % Success case prop preproc time : 0.000
% 0.69/0.60 % Success case prop encoding time : 0.000
% 0.69/0.60 % Success case prop solver time : 0.000
% 0.69/0.60 % Current number of processed clauses : 98
% 0.69/0.60 % Positive orientable unit clauses : 88
% 0.69/0.60 % Positive unorientable unit clauses: 10
% 0.69/0.60 % Negative unit clauses : 0
% 0.69/0.60 % Non-unit-clauses : 0
% 0.69/0.60 % Current number of unprocessed clauses: 14238
% 0.69/0.60 % ...number of literals in the above : 14238
% 0.69/0.60 % Current number of archived formulas : 0
% 0.69/0.60 % Current number of archived clauses : 54
% 0.69/0.60 % Clause-clause subsumption calls (NU) : 0
% 0.69/0.60 % Rec. Clause-clause subsumption calls : 0
% 0.69/0.60 % Non-unit clause-clause subsumptions : 0
% 0.69/0.60 % Unit Clause-clause subsumption calls : 71
% 0.69/0.60 % Rewrite failures with RHS unbound : 0
% 0.69/0.60 % BW rewrite match attempts : 902
% 0.69/0.60 % BW rewrite match successes : 312
% 0.69/0.60 % Condensation attempts : 0
% 0.69/0.60 % Condensation successes : 0
% 0.69/0.60 % Termbank termtop insertions : 312411
% 0.69/0.60 % Search garbage collected termcells : 2
% 0.69/0.60
% 0.69/0.60 % -------------------------------------------------
% 0.69/0.60 % User time : 0.162 s
% 0.69/0.60 % System time : 0.013 s
% 0.69/0.60 % Total time : 0.175 s
% 0.69/0.60 % Maximum resident set size: 3644 pages
% 0.69/0.60
% 0.69/0.60 % -------------------------------------------------
% 0.69/0.60 % User time : 0.779 s
% 0.69/0.60 % System time : 0.058 s
% 0.69/0.60 % Total time : 0.837 s
% 0.69/0.60 % Maximum resident set size: 4864 pages
% 0.69/0.60 % E exiting
%------------------------------------------------------------------------------