%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT156-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 : 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:04:22 PM UTC 2026
% Result : Unsatisfiable 27.38s 4.54s
% Output : CNFRefutation 27.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 9
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 5 RR)
% Number of literals : 43 ( 42 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 : 100 ( 16 sgn)
% Comments :
%------------------------------------------------------------------------------
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(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(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(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(equation_H49,axiom,
meet(X1,join(X2,meet(X3,join(X1,X4)))) = meet(X1,join(X2,join(meet(X1,X3),meet(X3,join(X2,X4))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equation_H49) ).
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(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_join) ).
cnf(c_0_9,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_10,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_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,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_14,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_15,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_16,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_17,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_11]),c_0_14]) ).
cnf(c_0_18,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_15,c_0_11]) ).
cnf(c_0_19,plain,
join(X1,meet(X2,meet(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_20,plain,
meet(join(X1,X2),join(X2,X1)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,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_13,c_0_18]),c_0_12]) ).
cnf(c_0_22,plain,
join(X1,join(X2,meet(X3,join(X2,X1)))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_14]) ).
cnf(c_0_23,plain,
join(X1,meet(join(X1,X2),join(X1,X3))) = meet(join(X1,X2),join(X1,X3)),
inference(spm,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_24,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_25,plain,
join(X1,join(X2,meet(join(X1,X2),X3))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_14]) ).
cnf(c_0_26,plain,
meet(X1,meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_9]),c_0_15]) ).
cnf(c_0_27,axiom,
meet(X1,join(X2,meet(X3,join(X1,X4)))) = meet(X1,join(X2,join(meet(X1,X3),meet(X3,join(X2,X4))))),
equation_H49 ).
cnf(c_0_28,plain,
join(X1,meet(join(X2,X3),join(X2,X1))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
join(X1,join(X2,meet(join(X2,X1),X3))) = join(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_12]) ).
cnf(c_0_30,plain,
meet(X1,meet(X2,join(X1,X3))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_26]),c_0_18]) ).
cnf(c_0_31,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_32,plain,
meet(X1,join(X2,join(meet(X1,X3),meet(X3,join(X4,X2))))) = meet(X1,join(X2,meet(X3,join(X1,X4)))),
inference(spm,[status(thm)],[c_0_27,c_0_12]) ).
cnf(c_0_33,plain,
join(X1,meet(join(X2,X3),join(X3,X1))) = join(X1,X3),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
join(meet(X1,X2),meet(X2,join(X1,X3))) = meet(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_30]),c_0_12]) ).
cnf(c_0_35,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_36,plain,
join(X1,join(X2,meet(X3,X1))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_11]),c_0_14]) ).
cnf(c_0_37,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_31 ).
cnf(c_0_38,plain,
meet(X1,join(X2,meet(X1,join(X3,X2)))) = meet(X1,join(X3,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_12]),c_0_17]),c_0_12]),c_0_34]),c_0_30]) ).
cnf(c_0_39,plain,
meet(X1,join(X2,meet(X3,join(X1,X2)))) = meet(X1,join(X2,meet(X1,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_35]),c_0_36]) ).
cnf(c_0_40,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_37,c_0_12]) ).
cnf(c_0_41,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_38,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT156-1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n009.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 : Sun Sep 20 23:16:27 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/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
% 27.38/4.53 % Version: 3.5.1
% 27.38/4.53 % Preprocessing class: FSSSSMSSSSSNFFN.
% 27.38/4.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.38/4.53 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 27.38/4.53 % Starting new_bool_3 with 300s (1) cores
% 27.38/4.53 % Starting new_bool_1 with 300s (1) cores
% 27.38/4.53 % Starting sh5l with 300s (1) cores
% 27.38/4.53 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 260966 completed with status 0
% 27.38/4.53 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 27.38/4.53 % Preprocessing class: FSSSSMSSSSSNFFN.
% 27.38/4.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.38/4.53 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 27.38/4.53 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 27.38/4.53 % No SInE strategy applied
% 27.38/4.53 % Search class: FUUPM-FFSF22-MFFFFFNN
% 27.38/4.53 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 27.38/4.53 % Starting SubtermCWHack with 136s (1) cores
% 27.38/4.53 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 27.38/4.53 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 27.38/4.53 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 27.38/4.54 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 27.38/4.54 % E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 260973 completed with status 0
% 27.38/4.54 % Result found by E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 27.38/4.54 % Preprocessing class: FSSSSMSSSSSNFFN.
% 27.38/4.54 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 27.38/4.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 27.38/4.54 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 27.38/4.54 % No SInE strategy applied
% 27.38/4.54 % Search class: FUUPM-FFSF22-MFFFFFNN
% 27.38/4.54 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 27.38/4.54 % Starting SubtermCWHack with 136s (1) cores
% 27.38/4.54 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 27.38/4.54 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 27.38/4.54 % Preprocessing time : 0.001 s
% 27.38/4.54 % Presaturation interreduction done
% 27.38/4.54
% 27.38/4.54 % Proof found!
% 27.38/4.54 % SZS status Unsatisfiable
% 27.38/4.54 % SZS output start CNFRefutation
% See solution above
% 27.38/4.54 % Parsed axioms : 10
% 27.38/4.54 % Removed by relevancy pruning/SinE : 0
% 27.38/4.54 % Initial clauses : 10
% 27.38/4.54 % Removed in clause preprocessing : 0
% 27.38/4.54 % Initial clauses in saturation : 10
% 27.38/4.54 % Processed clauses : 8989
% 27.38/4.54 % ...of these trivial : 3024
% 27.38/4.54 % ...subsumed : 5552
% 27.38/4.54 % ...remaining for further processing : 413
% 27.38/4.54 % Other redundant clauses eliminated : 0
% 27.38/4.54 % Clauses deleted for lack of memory : 0
% 27.38/4.54 % Backward-subsumed : 0
% 27.38/4.54 % Backward-rewritten : 4
% 27.38/4.54 % Generated clauses : 224613
% 27.38/4.54 % ...of the previous two non-redundant : 149035
% 27.38/4.54 % ...aggressively subsumed : 0
% 27.38/4.54 % Contextual simplify-reflections : 0
% 27.38/4.54 % Paramodulations : 224613
% 27.38/4.54 % Factorizations : 0
% 27.38/4.54 % NegExts : 0
% 27.38/4.54 % Equation resolutions : 0
% 27.38/4.54 % Disequality decompositions : 0
% 27.38/4.54 % Total rewrite steps : 403341
% 27.38/4.54 % ...of those cached : 310238
% 27.38/4.54 % Propositional unsat checks : 0
% 27.38/4.54 % Propositional check models : 0
% 27.38/4.54 % Propositional check unsatisfiable : 0
% 27.38/4.54 % Propositional clauses : 0
% 27.38/4.54 % Propositional clauses after purity: 0
% 27.38/4.54 % Propositional unsat core size : 0
% 27.38/4.54 % Propositional preprocessing time : 0.000
% 27.38/4.54 % Propositional encoding time : 0.000
% 27.38/4.54 % Propositional solver time : 0.000
% 27.38/4.54 % Success case prop preproc time : 0.000
% 27.38/4.54 % Success case prop encoding time : 0.000
% 27.38/4.54 % Success case prop solver time : 0.000
% 27.38/4.54 % Current number of processed clauses : 399
% 27.38/4.54 % Positive orientable unit clauses : 389
% 27.38/4.54 % Positive unorientable unit clauses: 10
% 27.38/4.54 % Negative unit clauses : 0
% 27.38/4.54 % Non-unit-clauses : 0
% 27.38/4.54 % Current number of unprocessed clauses: 140025
% 27.38/4.54 % ...number of literals in the above : 140025
% 27.38/4.54 % Current number of archived formulas : 0
% 27.38/4.54 % Current number of archived clauses : 14
% 27.38/4.54 % Clause-clause subsumption calls (NU) : 0
% 27.38/4.54 % Rec. Clause-clause subsumption calls : 0
% 27.38/4.54 % Non-unit clause-clause subsumptions : 0
% 27.38/4.54 % Unit Clause-clause subsumption calls : 70
% 27.38/4.54 % Rewrite failures with RHS unbound : 0
% 27.38/4.54 % BW rewrite match attempts : 6021
% 27.38/4.54 % BW rewrite match successes : 273
% 27.38/4.54 % Condensation attempts : 0
% 27.38/4.54 % Condensation successes : 0
% 27.38/4.54 % Termbank termtop insertions : 3421291
% 27.38/4.54 % Search garbage collected termcells : 2
% 27.38/4.54
% 27.38/4.54 % -------------------------------------------------
% 27.38/4.54 % User time : 3.810 s
% 27.38/4.54 % System time : 0.171 s
% 27.38/4.54 % Total time : 3.982 s
% 27.38/4.54 % Maximum resident set size: 3640 pages
% 27.38/4.54
% 27.38/4.54 % -------------------------------------------------
% 27.38/4.54 % User time : 18.455 s
% 27.38/4.54 % System time : 0.839 s
% 27.38/4.54 % Total time : 19.294 s
% 27.38/4.54 % Maximum resident set size: 4608 pages
% 27.38/4.54 % E exiting
%------------------------------------------------------------------------------