%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT246-1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:32 PM UTC 2026
% Result : Unsatisfiable 97.56s 14.86s
% Output : CNFRefutation 97.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of clauses : 60 ( 57 unt; 0 nHn; 15 RR)
% Number of literals : 66 ( 65 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 92 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_distributivity_hypothesis) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption2) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-4.ax',complement_meet) ).
cnf(equation_H60,axiom,
meet(X1,meet(join(X2,X3),join(X2,X4))) = meet(X1,join(X2,meet(join(X2,X3),join(X4,meet(X1,X2))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equation_H60) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',idempotence_of_join) ).
cnf(meet_join_complement,axiom,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-4.ax',meet_join_complement) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-4.ax',complement_join) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_distributivity) ).
cnf(c_0_14,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_15,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_16,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_17,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_18,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_19,hypothesis,
meet(a,meet(b,X1)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_15]) ).
cnf(c_0_21,hypothesis,
meet(a,meet(X1,b)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_22,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_23,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_24,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_25,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_26,hypothesis,
join(meet(X1,b),meet(a,X1)) = meet(X1,b),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_29,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_30,plain,
join(X1,join(X2,meet(X3,join(X1,X2)))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_25]) ).
cnf(c_0_31,hypothesis,
join(a,meet(b,join(X1,a))) = meet(b,join(X1,a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_15]),c_0_23]),c_0_15]) ).
cnf(c_0_32,hypothesis,
meet(a,complement(b)) = meet(a,zero),
inference(spm,[status(thm)],[c_0_19,c_0_28]) ).
cnf(c_0_33,plain,
meet(X1,zero) = zero,
inference(spm,[status(thm)],[c_0_29,c_0_28]) ).
cnf(c_0_34,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_16,c_0_22]) ).
cnf(c_0_35,plain,
meet(X1,meet(X2,complement(meet(X1,X2)))) = zero,
inference(spm,[status(thm)],[c_0_28,c_0_16]) ).
cnf(c_0_36,hypothesis,
join(X1,meet(b,join(X1,a))) = join(X1,a),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
cnf(c_0_37,axiom,
meet(X1,meet(join(X2,X3),join(X2,X4))) = meet(X1,join(X2,meet(join(X2,X3),join(X4,meet(X1,X2))))),
equation_H60 ).
cnf(c_0_38,hypothesis,
meet(a,complement(b)) = zero,
inference(rw,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_39,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_28]) ).
cnf(c_0_40,plain,
meet(X1,meet(X2,complement(meet(join(X1,X3),X2)))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_33]) ).
cnf(c_0_41,hypothesis,
join(X1,meet(b,join(a,X1))) = join(a,X1),
inference(spm,[status(thm)],[c_0_36,c_0_23]) ).
cnf(c_0_42,plain,
meet(X1,meet(join(X2,X1),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_16,c_0_27]) ).
cnf(c_0_43,hypothesis,
meet(a,meet(join(complement(b),X1),join(complement(b),X2))) = meet(a,join(complement(b),meet(join(complement(b),X1),X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_44,hypothesis,
meet(X1,meet(X2,complement(meet(join(a,X1),X2)))) = zero,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_45,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_46,plain,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
inference(fof_simplification,[status(thm)],[meet_join_complement]) ).
cnf(c_0_47,hypothesis,
meet(a,join(complement(b),meet(join(a,complement(b)),X1))) = meet(a,join(complement(b),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_23]) ).
cnf(c_0_48,hypothesis,
meet(X1,complement(meet(join(a,X1),join(X1,X2)))) = zero,
inference(spm,[status(thm)],[c_0_34,c_0_44]) ).
cnf(c_0_49,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_25,c_0_45]) ).
cnf(c_0_50,plain,
meet(join(X1,X2),join(X1,join(X2,X3))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_25]) ).
cnf(c_0_51,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_52,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
inference(fof_simplification,[status(thm)],[prove_distributivity]) ).
cnf(c_0_53,plain,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
c_0_46 ).
cnf(c_0_54,hypothesis,
meet(a,join(complement(b),complement(join(a,complement(b))))) = zero,
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(spm,[status(thm)],[c_0_47,c_0_48]),c_0_39]),c_0_32]),c_0_33]),c_0_49]),c_0_25]),c_0_50]) ).
cnf(c_0_55,plain,
join(X1,join(X2,complement(join(X1,X2)))) = one,
inference(spm,[status(thm)],[c_0_51,c_0_25]) ).
cnf(c_0_56,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
c_0_52 ).
cnf(c_0_57,hypothesis,
join(complement(b),complement(join(a,complement(b)))) = complement(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55])]) ).
cnf(c_0_58,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_56,c_0_23]) ).
cnf(c_0_59,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_57]),c_0_23]),c_0_58]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LAT246-1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.54 % Computer : n026.cluster.edu
% 0.08/0.54 % Model : x86_64 x86_64
% 0.08/0.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.54 % Memory : 8046.5625MB
% 0.08/0.54 % OS : Linux 6.8.0-71-generic
% 0.08/0.54 % CPULimit : 300
% 0.08/0.54 % WCLimit : 300
% 0.08/0.54 % DateTime : Sun Sep 20 23:25:25 UTC 2026
% 0.08/0.55 % CPUTime :
% 0.08/0.55 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.59 Running first-order theorem proving
% 0.13/0.59 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 97.56/14.86 % Version: 3.5.1
% 97.56/14.86 % Preprocessing class: FSSSSMSSSSSNFFN.
% 97.56/14.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 97.56/14.86 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 97.56/14.86 % Starting new_bool_3 with 300s (1) cores
% 97.56/14.86 % Starting new_bool_1 with 300s (1) cores
% 97.56/14.86 % Starting sh5l with 300s (1) cores
% 97.56/14.86 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 813168 completed with status 0
% 97.56/14.86 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 97.56/14.86 % Preprocessing class: FSSSSMSSSSSNFFN.
% 97.56/14.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 97.56/14.86 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 97.56/14.86 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 97.56/14.86 % No SInE strategy applied
% 97.56/14.86 % Search class: FHUPM-FFSF21-MFFFFFNN
% 97.56/14.86 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 97.56/14.86 % Starting SubtermCWHack with 136s (1) cores
% 97.56/14.86 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 97.56/14.86 % Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 97.56/14.86 % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 97.56/14.86 % Starting new_bool_3 with 136s (1) cores
% 97.56/14.86 % G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with pid 813178 completed with status 0
% 97.56/14.86 % Result found by G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S
% 97.56/14.86 % Preprocessing class: FSSSSMSSSSSNFFN.
% 97.56/14.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 97.56/14.86 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 97.56/14.86 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 97.56/14.86 % No SInE strategy applied
% 97.56/14.86 % Search class: FHUPM-FFSF21-MFFFFFNN
% 97.56/14.86 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 97.56/14.86 % Starting SubtermCWHack with 136s (1) cores
% 97.56/14.86 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 97.56/14.86 % Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 97.56/14.86 % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 97.56/14.86 % Preprocessing time : 0.001 s
% 97.56/14.86 % Presaturation interreduction done
% 97.56/14.86
% 97.56/14.86 % Proof found!
% 97.56/14.86 % SZS status Unsatisfiable
% 97.56/14.86 % SZS output start CNFRefutation
% See solution above
% 97.56/14.86 % Parsed axioms : 14
% 97.56/14.86 % Removed by relevancy pruning/SinE : 0
% 97.56/14.86 % Initial clauses : 14
% 97.56/14.86 % Removed in clause preprocessing : 0
% 97.56/14.86 % Initial clauses in saturation : 14
% 97.56/14.86 % Processed clauses : 21869
% 97.56/14.86 % ...of these trivial : 12192
% 97.56/14.86 % ...subsumed : 8228
% 97.56/14.86 % ...remaining for further processing : 1449
% 97.56/14.86 % Other redundant clauses eliminated : 0
% 97.56/14.86 % Clauses deleted for lack of memory : 0
% 97.56/14.86 % Backward-subsumed : 18
% 97.56/14.86 % Backward-rewritten : 183
% 97.56/14.86 % Generated clauses : 786432
% 97.56/14.86 % ...of the previous two non-redundant : 314589
% 97.56/14.86 % ...aggressively subsumed : 0
% 97.56/14.86 % Contextual simplify-reflections : 0
% 97.56/14.86 % Paramodulations : 786415
% 97.56/14.86 % Factorizations : 0
% 97.56/14.86 % NegExts : 0
% 97.56/14.86 % Equation resolutions : 17
% 97.56/14.86 % Disequality decompositions : 0
% 97.56/14.86 % Total rewrite steps : 2176127
% 97.56/14.86 % ...of those cached : 1952435
% 97.56/14.86 % Propositional unsat checks : 0
% 97.56/14.86 % Propositional check models : 0
% 97.56/14.86 % Propositional check unsatisfiable : 0
% 97.56/14.86 % Propositional clauses : 0
% 97.56/14.86 % Propositional clauses after purity: 0
% 97.56/14.86 % Propositional unsat core size : 0
% 97.56/14.86 % Propositional preprocessing time : 0.000
% 97.56/14.86 % Propositional encoding time : 0.000
% 97.56/14.86 % Propositional solver time : 0.000
% 97.56/14.86 % Success case prop preproc time : 0.000
% 97.56/14.86 % Success case prop encoding time : 0.000
% 97.56/14.86 % Success case prop solver time : 0.000
% 97.56/14.86 % Current number of processed clauses : 1234
% 97.56/14.86 % Positive orientable unit clauses : 1094
% 97.56/14.86 % Positive unorientable unit clauses: 10
% 97.56/14.86 % Negative unit clauses : 1
% 97.56/14.86 % Non-unit-clauses : 129
% 97.56/14.86 % Current number of unprocessed clauses: 291925
% 97.56/14.86 % ...number of literals in the above : 314844
% 97.56/14.86 % Current number of archived formulas : 0
% 97.56/14.86 % Current number of archived clauses : 215
% 97.56/14.86 % Clause-clause subsumption calls (NU) : 14365
% 97.56/14.86 % Rec. Clause-clause subsumption calls : 14365
% 97.56/14.86 % Non-unit clause-clause subsumptions : 4523
% 97.56/14.86 % Unit Clause-clause subsumption calls : 775
% 97.56/14.86 % Rewrite failures with RHS unbound : 0
% 97.56/14.86 % BW rewrite match attempts : 18973
% 97.56/14.86 % BW rewrite match successes : 2402
% 97.56/14.86 % Condensation attempts : 0
% 97.56/14.86 % Condensation successes : 0
% 97.56/14.86 % Termbank termtop insertions : 13116067
% 97.56/14.86 % Search garbage collected termcells : 8
% 97.56/14.86
% 97.56/14.86 % -------------------------------------------------
% 97.56/14.86 % User time : 13.254 s
% 97.56/14.86 % System time : 0.472 s
% 97.56/14.86 % Total time : 13.726 s
% 97.56/14.86 % Maximum resident set size: 3640 pages
% 97.56/14.86
% 97.56/14.86 % -------------------------------------------------
% 97.56/14.86 % User time : 67.085 s
% 97.56/14.86 % System time : 2.283 s
% 97.56/14.86 % Total time : 69.368 s
% 97.56/14.86 % Maximum resident set size: 4864 pages
% 97.56/14.86 % E exiting
%------------------------------------------------------------------------------