%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT169-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 : n012.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 95.06s 14.28s
% Output : CNFRefutation 95.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 9
% Syntax : Number of clauses : 42 ( 42 unt; 0 nHn; 4 RR)
% Number of literals : 42 ( 41 equ; 3 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 : 98 ( 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(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(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(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).
cnf(equation_H21_dual,axiom,
meet(join(X1,X2),join(X1,X3)) = join(X1,meet(join(X2,meet(X1,join(X2,X3))),join(X3,meet(X1,X2)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equation_H21_dual) ).
cnf(prove_H58,negated_conjecture,
meet(a,join(b,c)) != meet(a,join(b,meet(join(a,b),join(c,meet(a,b))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_H58) ).
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(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_12,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
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,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_16,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_17,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_14]),c_0_15]) ).
cnf(c_0_18,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_15]) ).
cnf(c_0_19,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_20,plain,
join(X1,join(X2,meet(X3,join(X1,X2)))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_21,plain,
join(X1,meet(join(X1,X2),join(X3,X1))) = meet(join(X1,X2),join(X3,X1)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_22,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_11,c_0_19]) ).
cnf(c_0_23,plain,
join(X1,meet(X2,meet(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_11]) ).
cnf(c_0_24,plain,
join(X1,meet(join(X2,X3),join(X1,X2))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_25,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_22,c_0_10]) ).
cnf(c_0_26,plain,
join(X1,meet(X2,meet(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_10]) ).
cnf(c_0_27,plain,
join(X1,meet(join(X2,X3),join(X1,X3))) = join(X1,X3),
inference(spm,[status(thm)],[c_0_24,c_0_15]) ).
cnf(c_0_28,axiom,
meet(join(X1,X2),join(X1,X3)) = join(X1,meet(join(X2,meet(X1,join(X2,X3))),join(X3,meet(X1,X2)))),
equation_H21_dual ).
cnf(c_0_29,plain,
meet(X1,meet(join(X2,X1),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_11,c_0_18]) ).
cnf(c_0_30,plain,
meet(X1,meet(X2,meet(X1,X3))) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_25]),c_0_11]),c_0_11]) ).
cnf(c_0_31,plain,
join(X1,join(X2,meet(X1,X3))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_14]),c_0_16]) ).
cnf(c_0_32,plain,
join(X1,meet(X2,join(X1,meet(X2,X3)))) = join(X1,meet(X2,X3)),
inference(spm,[status(thm)],[c_0_27,c_0_9]) ).
cnf(c_0_33,plain,
join(X1,meet(join(X2,meet(X1,X3)),join(X3,meet(X1,join(X3,X2))))) = meet(join(X1,X3),join(X1,X2)),
inference(rw,[status(thm)],[c_0_28,c_0_10]) ).
cnf(c_0_34,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_9]),c_0_11]),c_0_11]),c_0_30]) ).
cnf(c_0_35,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_18,c_0_31]),c_0_10]) ).
cnf(c_0_36,plain,
join(X1,meet(join(X1,X2),join(X3,meet(X1,X2)))) = meet(join(X1,X2),join(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]),c_0_10]),c_0_35]) ).
cnf(c_0_37,negated_conjecture,
meet(a,join(b,c)) != meet(a,join(b,meet(join(a,b),join(c,meet(a,b))))),
inference(fof_simplification,[status(thm)],[prove_H58]) ).
cnf(c_0_38,plain,
join(X1,meet(join(X1,X2),join(X3,meet(X2,X1)))) = meet(join(X1,X2),join(X1,X3)),
inference(spm,[status(thm)],[c_0_36,c_0_10]) ).
cnf(c_0_39,negated_conjecture,
meet(a,join(b,c)) != meet(a,join(b,meet(join(a,b),join(c,meet(a,b))))),
c_0_37 ).
cnf(c_0_40,plain,
join(X1,meet(join(X2,X1),join(X3,meet(X2,X1)))) = meet(join(X2,X1),join(X1,X3)),
inference(spm,[status(thm)],[c_0_38,c_0_15]) ).
cnf(c_0_41,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_39,c_0_40]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LAT169-1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n012.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sun Sep 20 23:17:21 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.12/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.39 Running first-order theorem proving
% 0.12/0.39 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
% 95.06/14.28 % Version: 3.5.1
% 95.06/14.28 % Preprocessing class: FSSSSMSSSSSNFFN.
% 95.06/14.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 95.06/14.28 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 95.06/14.28 % Starting new_bool_3 with 300s (1) cores
% 95.06/14.28 % Starting new_bool_1 with 300s (1) cores
% 95.06/14.28 % Starting sh5l with 300s (1) cores
% 95.06/14.28 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1061669 completed with status 0
% 95.06/14.28 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 95.06/14.28 % Preprocessing class: FSSSSMSSSSSNFFN.
% 95.06/14.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 95.06/14.28 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 95.06/14.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 95.06/14.28 % No SInE strategy applied
% 95.06/14.28 % Search class: FUUPM-FFSF22-MFFFFFNN
% 95.06/14.28 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 95.06/14.28 % Starting SubtermCWHack with 136s (1) cores
% 95.06/14.28 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 95.06/14.28 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 95.06/14.28 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 95.06/14.28 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 95.06/14.28 % U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 1061680 completed with status 0
% 95.06/14.28 % Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 95.06/14.28 % Preprocessing class: FSSSSMSSSSSNFFN.
% 95.06/14.28 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 95.06/14.28 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 95.06/14.28 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 95.06/14.28 % No SInE strategy applied
% 95.06/14.28 % Search class: FUUPM-FFSF22-MFFFFFNN
% 95.06/14.28 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 95.06/14.28 % Starting SubtermCWHack with 136s (1) cores
% 95.06/14.28 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 95.06/14.28 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 95.06/14.28 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 95.06/14.28 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 95.06/14.28 % Preprocessing time : 0.001 s
% 95.06/14.28 % Presaturation interreduction done
% 95.06/14.28
% 95.06/14.28 % Proof found!
% 95.06/14.28 % SZS status Unsatisfiable
% 95.06/14.28 % SZS output start CNFRefutation
% See solution above
% 95.06/14.28 % Parsed axioms : 10
% 95.06/14.28 % Removed by relevancy pruning/SinE : 0
% 95.06/14.28 % Initial clauses : 10
% 95.06/14.28 % Removed in clause preprocessing : 0
% 95.06/14.28 % Initial clauses in saturation : 10
% 95.06/14.28 % Processed clauses : 54814
% 95.06/14.28 % ...of these trivial : 27106
% 95.06/14.28 % ...subsumed : 26904
% 95.06/14.28 % ...remaining for further processing : 804
% 95.06/14.28 % Other redundant clauses eliminated : 0
% 95.06/14.28 % Clauses deleted for lack of memory : 0
% 95.06/14.28 % Backward-subsumed : 0
% 95.06/14.28 % Backward-rewritten : 4
% 95.06/14.28 % Generated clauses : 898438
% 95.06/14.28 % ...of the previous two non-redundant : 552607
% 95.06/14.28 % ...aggressively subsumed : 0
% 95.06/14.28 % Contextual simplify-reflections : 0
% 95.06/14.28 % Paramodulations : 898438
% 95.06/14.28 % Factorizations : 0
% 95.06/14.28 % NegExts : 0
% 95.06/14.28 % Equation resolutions : 0
% 95.06/14.28 % Disequality decompositions : 0
% 95.06/14.28 % Total rewrite steps : 1418527
% 95.06/14.28 % ...of those cached : 1139533
% 95.06/14.28 % Propositional unsat checks : 0
% 95.06/14.28 % Propositional check models : 0
% 95.06/14.28 % Propositional check unsatisfiable : 0
% 95.06/14.28 % Propositional clauses : 0
% 95.06/14.28 % Propositional clauses after purity: 0
% 95.06/14.28 % Propositional unsat core size : 0
% 95.06/14.28 % Propositional preprocessing time : 0.000
% 95.06/14.28 % Propositional encoding time : 0.000
% 95.06/14.28 % Propositional solver time : 0.000
% 95.06/14.28 % Success case prop preproc time : 0.000
% 95.06/14.28 % Success case prop encoding time : 0.000
% 95.06/14.28 % Success case prop solver time : 0.000
% 95.06/14.28 % Current number of processed clauses : 790
% 95.06/14.28 % Positive orientable unit clauses : 780
% 95.06/14.28 % Positive unorientable unit clauses: 10
% 95.06/14.28 % Negative unit clauses : 0
% 95.06/14.28 % Non-unit-clauses : 0
% 95.06/14.28 % Current number of unprocessed clauses: 497753
% 95.06/14.28 % ...number of literals in the above : 497753
% 95.06/14.28 % Current number of archived formulas : 0
% 95.06/14.28 % Current number of archived clauses : 14
% 95.06/14.28 % Clause-clause subsumption calls (NU) : 0
% 95.06/14.28 % Rec. Clause-clause subsumption calls : 0
% 95.06/14.28 % Non-unit clause-clause subsumptions : 0
% 95.06/14.28 % Unit Clause-clause subsumption calls : 66
% 95.06/14.28 % Rewrite failures with RHS unbound : 0
% 95.06/14.28 % BW rewrite match attempts : 24313
% 95.06/14.28 % BW rewrite match successes : 292
% 95.06/14.28 % Condensation attempts : 0
% 95.06/14.28 % Condensation successes : 0
% 95.06/14.28 % Termbank termtop insertions : 11126152
% 95.06/14.28 % Search garbage collected termcells : 2
% 95.06/14.28
% 95.06/14.28 % -------------------------------------------------
% 95.06/14.28 % User time : 13.068 s
% 95.06/14.28 % System time : 0.444 s
% 95.06/14.28 % Total time : 13.512 s
% 95.06/14.28 % Maximum resident set size: 3640 pages
% 95.06/14.28
% 95.06/14.28 % -------------------------------------------------
% 95.06/14.28 % User time : 65.170 s
% 95.06/14.28 % System time : 2.224 s
% 95.06/14.28 % Total time : 67.394 s
% 95.06/14.28 % Maximum resident set size: 4608 pages
% 95.06/14.28 % E exiting
%------------------------------------------------------------------------------