%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT249-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 : n017.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:33 PM UTC 2026
% Result : Unsatisfiable 0.49s 0.49s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of clauses : 49 ( 46 unt; 0 nHn; 15 RR)
% Number of literals : 55 ( 54 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 8 ( 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 : 67 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-4.ax',complement_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(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(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(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption2) ).
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(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',idempotence_of_join) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-4.ax',complement_join) ).
cnf(equation_H64,axiom,
meet(X1,join(X2,X3)) = meet(X1,join(X2,meet(X1,join(X3,meet(X1,join(X2,meet(X1,X3))))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equation_H64) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_distributivity) ).
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(c_0_14,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_15,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_16,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_17,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_18,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_19,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_20,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_21,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_22,plain,
meet(X1,meet(X2,complement(meet(X1,X2)))) = zero,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_23,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_26,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_27,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_28,plain,
meet(X1,meet(X2,meet(X1,X2))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_21,c_0_15]) ).
cnf(c_0_29,hypothesis,
meet(a,meet(b,complement(a))) = zero,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,plain,
meet(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_31,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_33,axiom,
meet(X1,join(X2,X3)) = meet(X1,join(X2,meet(X1,join(X3,meet(X1,join(X2,meet(X1,X3))))))),
equation_H64 ).
cnf(c_0_34,hypothesis,
meet(a,meet(b,X1)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_15,c_0_23]) ).
cnf(c_0_35,hypothesis,
meet(a,zero) = zero,
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_28,c_0_29]),c_0_15]),c_0_17]),c_0_30]),c_0_17]),c_0_30]) ).
cnf(c_0_36,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
inference(fof_simplification,[status(thm)],[prove_distributivity]) ).
cnf(c_0_38,plain,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
inference(fof_simplification,[status(thm)],[meet_join_complement]) ).
cnf(c_0_39,plain,
meet(X1,join(X2,meet(X1,join(complement(X1),meet(X1,X2))))) = meet(X1,join(X2,complement(X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_14]),c_0_25]) ).
cnf(c_0_40,hypothesis,
meet(a,complement(b)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_14]),c_0_35]) ).
cnf(c_0_41,plain,
join(X1,join(complement(X1),X2)) = join(one,X2),
inference(spm,[status(thm)],[c_0_26,c_0_32]) ).
cnf(c_0_42,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_19,c_0_36]) ).
cnf(c_0_43,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
c_0_37 ).
cnf(c_0_44,plain,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
c_0_38 ).
cnf(c_0_45,hypothesis,
meet(a,join(complement(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(spm,[status(thm)],[c_0_39,c_0_40]),c_0_25]),c_0_14]),c_0_25]),c_0_40]),c_0_19]) ).
cnf(c_0_46,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_43,c_0_19]) ).
cnf(c_0_48,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46])]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT249-1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n017.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:18:42 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 0.49/0.49 % Version: 3.5.1
% 0.49/0.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.49/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.49/0.49 % Starting new_bool_3 with 300s (1) cores
% 0.49/0.49 % Starting new_bool_1 with 300s (1) cores
% 0.49/0.49 % Starting sh5l with 300s (1) cores
% 0.49/0.49 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 842938 completed with status 0
% 0.49/0.49 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.49/0.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.49/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.49/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.49/0.49 % No SInE strategy applied
% 0.49/0.49 % Search class: FHUPM-FFSF21-DFFFFFNN
% 0.49/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.49/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.49/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.49/0.49 % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.49/0.49 % Starting new_bool_3 with 136s (1) cores
% 0.49/0.49 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.49/0.49 % G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with pid 842949 completed with status 0
% 0.49/0.49 % Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN
% 0.49/0.49 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.49/0.49 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.49/0.49 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.49/0.49 % No SInE strategy applied
% 0.49/0.49 % Search class: FHUPM-FFSF21-DFFFFFNN
% 0.49/0.49 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.49/0.49 % Starting SubtermCWHack with 136s (1) cores
% 0.49/0.49 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.49/0.49 % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.49/0.49 % Starting new_bool_3 with 136s (1) cores
% 0.49/0.49 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 0.49/0.49 % Preprocessing time : 0.002 s
% 0.49/0.49
% 0.49/0.49 % Proof found!
% 0.49/0.49 % SZS status Unsatisfiable
% 0.49/0.49 % SZS output start CNFRefutation
% See solution above
% 0.49/0.49 % Parsed axioms : 14
% 0.49/0.49 % Removed by relevancy pruning/SinE : 0
% 0.49/0.49 % Initial clauses : 14
% 0.49/0.49 % Removed in clause preprocessing : 0
% 0.49/0.49 % Initial clauses in saturation : 14
% 0.49/0.49 % Processed clauses : 199
% 0.49/0.49 % ...of these trivial : 33
% 0.49/0.49 % ...subsumed : 59
% 0.49/0.49 % ...remaining for further processing : 107
% 0.49/0.49 % Other redundant clauses eliminated : 0
% 0.49/0.49 % Clauses deleted for lack of memory : 0
% 0.49/0.49 % Backward-subsumed : 12
% 0.49/0.49 % Backward-rewritten : 13
% 0.49/0.49 % Generated clauses : 2718
% 0.49/0.49 % ...of the previous two non-redundant : 1750
% 0.49/0.49 % ...aggressively subsumed : 0
% 0.49/0.49 % Contextual simplify-reflections : 1
% 0.49/0.49 % Paramodulations : 2717
% 0.49/0.49 % Factorizations : 0
% 0.49/0.49 % NegExts : 0
% 0.49/0.49 % Equation resolutions : 1
% 0.49/0.49 % Disequality decompositions : 0
% 0.49/0.49 % Total rewrite steps : 3773
% 0.49/0.49 % ...of those cached : 2776
% 0.49/0.49 % Propositional unsat checks : 0
% 0.49/0.49 % Propositional check models : 0
% 0.49/0.49 % Propositional check unsatisfiable : 0
% 0.49/0.49 % Propositional clauses : 0
% 0.49/0.49 % Propositional clauses after purity: 0
% 0.49/0.49 % Propositional unsat core size : 0
% 0.49/0.49 % Propositional preprocessing time : 0.000
% 0.49/0.49 % Propositional encoding time : 0.000
% 0.49/0.49 % Propositional solver time : 0.000
% 0.49/0.49 % Success case prop preproc time : 0.000
% 0.49/0.49 % Success case prop encoding time : 0.000
% 0.49/0.49 % Success case prop solver time : 0.000
% 0.49/0.49 % Current number of processed clauses : 82
% 0.49/0.49 % Positive orientable unit clauses : 56
% 0.49/0.49 % Positive unorientable unit clauses: 6
% 0.49/0.49 % Negative unit clauses : 3
% 0.49/0.49 % Non-unit-clauses : 17
% 0.49/0.49 % Current number of unprocessed clauses: 1541
% 0.49/0.49 % ...number of literals in the above : 2069
% 0.49/0.49 % Current number of archived formulas : 0
% 0.49/0.49 % Current number of archived clauses : 25
% 0.49/0.49 % Clause-clause subsumption calls (NU) : 181
% 0.49/0.49 % Rec. Clause-clause subsumption calls : 129
% 0.49/0.49 % Non-unit clause-clause subsumptions : 34
% 0.49/0.49 % Unit Clause-clause subsumption calls : 35
% 0.49/0.49 % Rewrite failures with RHS unbound : 0
% 0.49/0.49 % BW rewrite match attempts : 123
% 0.49/0.49 % BW rewrite match successes : 76
% 0.49/0.49 % Condensation attempts : 0
% 0.49/0.49 % Condensation successes : 0
% 0.49/0.49 % Termbank termtop insertions : 30111
% 0.49/0.49 % Search garbage collected termcells : 8
% 0.49/0.49
% 0.49/0.49 % -------------------------------------------------
% 0.49/0.49 % User time : 0.048 s
% 0.49/0.49 % System time : 0.004 s
% 0.49/0.49 % Total time : 0.052 s
% 0.49/0.49 % Maximum resident set size: 3644 pages
% 0.49/0.49
% 0.49/0.49 % -------------------------------------------------
% 0.49/0.49 % User time : 0.230 s
% 0.49/0.49 % System time : 0.024 s
% 0.49/0.49 % Total time : 0.254 s
% 0.49/0.49 % Maximum resident set size: 4608 pages
% 0.49/0.49 % E exiting
%------------------------------------------------------------------------------