%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT239-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 : n004.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:31 PM UTC 2026
% Result : Unsatisfiable 2.83s 0.95s
% Output : CNFRefutation 2.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 12
% Syntax : Number of clauses : 57 ( 54 unt; 0 nHn; 13 RR)
% Number of literals : 63 ( 62 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 : 83 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-4.ax',complement_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption2) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-4.ax',complement_meet) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_distributivity_hypothesis) ).
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(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(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/sandbox/benchmark/theBenchmark.p',equation_H49) ).
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_12,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_13,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_14,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_15,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_16,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_17,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_18,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_19,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
meet(one,X1) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_23,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_16]) ).
cnf(c_0_24,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_25,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_12,c_0_20]) ).
cnf(c_0_26,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_27,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_28,plain,
meet(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_14,c_0_21]) ).
cnf(c_0_29,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_22,c_0_16]) ).
cnf(c_0_30,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_12]),c_0_24]) ).
cnf(c_0_31,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_13]),c_0_25]) ).
cnf(c_0_32,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_33,plain,
meet(X1,meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_14]),c_0_27]) ).
cnf(c_0_34,plain,
meet(X1,meet(complement(X1),X2)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_15]),c_0_28]) ).
cnf(c_0_35,plain,
meet(X1,zero) = zero,
inference(spm,[status(thm)],[c_0_16,c_0_28]) ).
cnf(c_0_36,hypothesis,
meet(a,meet(b,X1)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_27,c_0_29]) ).
cnf(c_0_37,plain,
join(complement(X1),join(X2,X1)) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_24]) ).
cnf(c_0_38,plain,
meet(complement(X1),meet(X2,X1)) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_27]) ).
cnf(c_0_39,hypothesis,
meet(a,join(b,X1)) = a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_12]),c_0_29]) ).
cnf(c_0_40,plain,
join(X1,complement(meet(X2,X1))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_23]),c_0_18]) ).
cnf(c_0_41,plain,
meet(X1,complement(join(X2,X1))) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_26]),c_0_16]) ).
cnf(c_0_42,hypothesis,
join(b,join(X1,a)) = join(b,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_39]),c_0_24]) ).
cnf(c_0_43,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_44,hypothesis,
meet(a,complement(b)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_29]),c_0_16]) ).
cnf(c_0_45,hypothesis,
join(meet(b,X1),complement(meet(a,X1))) = one,
inference(spm,[status(thm)],[c_0_40,c_0_36]) ).
cnf(c_0_46,hypothesis,
meet(join(X1,a),complement(join(b,X1))) = zero,
inference(spm,[status(thm)],[c_0_41,c_0_42]) ).
cnf(c_0_47,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
inference(fof_simplification,[status(thm)],[prove_distributivity]) ).
cnf(c_0_48,plain,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
inference(fof_simplification,[status(thm)],[meet_join_complement]) ).
cnf(c_0_49,hypothesis,
meet(a,join(X1,meet(complement(b),join(X1,X2)))) = meet(a,join(X1,meet(complement(b),join(a,X2)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_21]) ).
cnf(c_0_50,hypothesis,
join(complement(a),meet(b,join(a,X1))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_12]),c_0_18]) ).
cnf(c_0_51,hypothesis,
meet(complement(b),join(a,meet(b,X1))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_14]),c_0_18]),c_0_16]) ).
cnf(c_0_52,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
c_0_47 ).
cnf(c_0_53,plain,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
c_0_48 ).
cnf(c_0_54,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(spm,[status(thm)],[c_0_49,c_0_50]),c_0_17]),c_0_51]),c_0_19]),c_0_15]) ).
cnf(c_0_55,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_52,c_0_18]) ).
cnf(c_0_56,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_31])]),c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LAT239-1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n004.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Sun Sep 20 23:22:19 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.27/0.52 Running first-order theorem proving
% 0.27/0.53 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
% 2.83/0.95 % Version: 3.5.1
% 2.83/0.95 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.83/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.83/0.95 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.83/0.95 % Starting new_bool_3 with 300s (1) cores
% 2.83/0.95 % Starting new_bool_1 with 300s (1) cores
% 2.83/0.95 % Starting sh5l with 300s (1) cores
% 2.83/0.95 % sh5l with pid 1705327 completed with status 0
% 2.83/0.95 % Result found by sh5l
% 2.83/0.95 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.83/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.83/0.95 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.83/0.95 % Starting new_bool_3 with 300s (1) cores
% 2.83/0.95 % Starting new_bool_1 with 300s (1) cores
% 2.83/0.95 % Starting sh5l with 300s (1) cores
% 2.83/0.95 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 2.83/0.95 % SinE strategy is gf500_gu_R04_F100_L20000
% 2.83/0.95 % Search class: FHUPM-FFSF21-MFFFFFNN
% 2.83/0.95 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 2.83/0.95 % Starting SubtermCWHack with 28s (1) cores
% 2.83/0.95 % SubtermCWHack with pid 1705332 completed with status 0
% 2.83/0.95 % Result found by SubtermCWHack
% 2.83/0.95 % Preprocessing class: FSSSSMSSSSSNFFN.
% 2.83/0.95 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.83/0.95 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 2.83/0.95 % Starting new_bool_3 with 300s (1) cores
% 2.83/0.95 % Starting new_bool_1 with 300s (1) cores
% 2.83/0.95 % Starting sh5l with 300s (1) cores
% 2.83/0.95 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 2.83/0.95 % SinE strategy is gf500_gu_R04_F100_L20000
% 2.83/0.95 % Search class: FHUPM-FFSF21-MFFFFFNN
% 2.83/0.95 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 2.83/0.95 % Starting SubtermCWHack with 28s (1) cores
% 2.83/0.95 % Preprocessing time : 0.002 s
% 2.83/0.95
% 2.83/0.95 % Proof found!
% 2.83/0.95 % SZS status Unsatisfiable
% 2.83/0.95 % SZS output start CNFRefutation
% See solution above
% 2.83/0.95 % Parsed axioms : 14
% 2.83/0.95 % Removed by relevancy pruning/SinE : 0
% 2.83/0.95 % Initial clauses : 14
% 2.83/0.95 % Removed in clause preprocessing : 0
% 2.83/0.95 % Initial clauses in saturation : 14
% 2.83/0.95 % Processed clauses : 826
% 2.83/0.95 % ...of these trivial : 496
% 2.83/0.95 % ...subsumed : 122
% 2.83/0.95 % ...remaining for further processing : 208
% 2.83/0.95 % Other redundant clauses eliminated : 78
% 2.83/0.95 % Clauses deleted for lack of memory : 0
% 2.83/0.95 % Backward-subsumed : 5
% 2.83/0.95 % Backward-rewritten : 12
% 2.83/0.95 % Generated clauses : 19689
% 2.83/0.95 % ...of the previous two non-redundant : 8618
% 2.83/0.95 % ...aggressively subsumed : 0
% 2.83/0.95 % Contextual simplify-reflections : 0
% 2.83/0.95 % Paramodulations : 19611
% 2.83/0.95 % Factorizations : 0
% 2.83/0.95 % NegExts : 0
% 2.83/0.95 % Equation resolutions : 78
% 2.83/0.95 % Disequality decompositions : 0
% 2.83/0.95 % Total rewrite steps : 33120
% 2.83/0.95 % ...of those cached : 26093
% 2.83/0.95 % Propositional unsat checks : 0
% 2.83/0.95 % Propositional check models : 0
% 2.83/0.95 % Propositional check unsatisfiable : 0
% 2.83/0.95 % Propositional clauses : 0
% 2.83/0.95 % Propositional clauses after purity: 0
% 2.83/0.95 % Propositional unsat core size : 0
% 2.83/0.95 % Propositional preprocessing time : 0.000
% 2.83/0.95 % Propositional encoding time : 0.000
% 2.83/0.95 % Propositional solver time : 0.000
% 2.83/0.95 % Success case prop preproc time : 0.000
% 2.83/0.95 % Success case prop encoding time : 0.000
% 2.83/0.95 % Success case prop solver time : 0.000
% 2.83/0.95 % Current number of processed clauses : 191
% 2.83/0.95 % Positive orientable unit clauses : 170
% 2.83/0.95 % Positive unorientable unit clauses: 7
% 2.83/0.95 % Negative unit clauses : 3
% 2.83/0.95 % Non-unit-clauses : 11
% 2.83/0.95 % Current number of unprocessed clauses: 7759
% 2.83/0.95 % ...number of literals in the above : 8923
% 2.83/0.95 % Current number of archived formulas : 0
% 2.83/0.95 % Current number of archived clauses : 17
% 2.83/0.95 % Clause-clause subsumption calls (NU) : 24
% 2.83/0.95 % Rec. Clause-clause subsumption calls : 24
% 2.83/0.95 % Non-unit clause-clause subsumptions : 10
% 2.83/0.95 % Unit Clause-clause subsumption calls : 25
% 2.83/0.95 % Rewrite failures with RHS unbound : 0
% 2.83/0.95 % BW rewrite match attempts : 728
% 2.83/0.95 % BW rewrite match successes : 273
% 2.83/0.95 % Condensation attempts : 0
% 2.83/0.95 % Condensation successes : 0
% 2.83/0.95 % Termbank termtop insertions : 234622
% 2.83/0.95 % Search garbage collected termcells : 8
% 2.83/0.95
% 2.83/0.95 % -------------------------------------------------
% 2.83/0.95 % User time : 0.326 s
% 2.83/0.95 % System time : 0.025 s
% 2.83/0.95 % Total time : 0.351 s
% 2.83/0.95 % Maximum resident set size: 3640 pages
% 2.83/0.95
% 2.83/0.95 % -------------------------------------------------
% 2.83/0.95 % User time : 0.331 s
% 2.83/0.95 % System time : 0.029 s
% 2.83/0.95 % Total time : 0.360 s
% 2.83/0.95 % Maximum resident set size: 4608 pages
% 2.83/0.95 % E exiting
%------------------------------------------------------------------------------