%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LAT251-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 : n013.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:05:51 PM UTC 2026
% Result : Unsatisfiable 0.64s 1.06s
% Output : CNFRefutation 0.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 47 ( 43 unt; 0 nHn; 14 RR)
% Number of literals : 54 ( 53 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 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 : 66 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
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_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
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(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(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_distributivity_hypothesis) ).
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(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(equation_H69,axiom,
meet(X1,join(X2,X3)) = join(meet(X1,join(X3,meet(X1,X2))),meet(X1,join(X2,meet(X1,X3)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equation_H69) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_distributivity) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',idempotence_of_join) ).
cnf(c_0_13,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_14,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_15,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_16,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_18,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_19,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_20,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_15]) ).
cnf(c_0_21,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_22,plain,
meet(zero,X1) = zero,
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_23,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_24,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_19]) ).
cnf(c_0_25,plain,
meet(X1,meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_13]),c_0_21]) ).
cnf(c_0_26,plain,
meet(X1,meet(complement(X1),X2)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_14]),c_0_22]) ).
cnf(c_0_27,plain,
meet(X1,zero) = zero,
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_28,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_29,plain,
meet(one,X1) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_30,plain,
meet(complement(X1),meet(X2,X1)) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_21]) ).
cnf(c_0_31,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_28,c_0_23]) ).
cnf(c_0_32,plain,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
inference(fof_simplification,[status(thm)],[meet_join_complement]) ).
cnf(c_0_33,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_34,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_17,c_0_29]) ).
cnf(c_0_35,axiom,
meet(X1,join(X2,X3)) = join(meet(X1,join(X3,meet(X1,X2))),meet(X1,join(X2,meet(X1,X3)))),
equation_H69 ).
cnf(c_0_36,hypothesis,
meet(a,complement(b)) = zero,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_23]) ).
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 ),
c_0_32 ).
cnf(c_0_39,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_19]),c_0_34]) ).
cnf(c_0_40,hypothesis,
join(meet(a,X1),meet(a,join(complement(b),meet(a,X1)))) = meet(a,join(X1,complement(b))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_16]),c_0_15]) ).
cnf(c_0_41,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_42,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
c_0_37 ).
cnf(c_0_43,plain,
( meet(X1,join(complement(X1),X2)) != zero
| join(complement(X1),X2) = complement(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,hypothesis,
meet(a,join(complement(a),complement(b))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_14]),c_0_16]),c_0_36]),c_0_41]) ).
cnf(c_0_45,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_42,c_0_15]) ).
cnf(c_0_46,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT251-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.09/0.93 % Computer : n013.cluster.edu
% 0.09/0.93 % Model : x86_64 x86_64
% 0.09/0.93 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.93 % Memory : 8046.5625MB
% 0.09/0.93 % OS : Linux 6.8.0-71-generic
% 0.09/0.93 % CPULimit : 300
% 0.09/0.93 % WCLimit : 300
% 0.09/0.93 % DateTime : Sun Sep 20 23:22:37 UTC 2026
% 0.09/0.93 % CPUTime :
% 0.09/0.94 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.98 Running first-order theorem proving
% 0.09/0.98 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.64/1.05 % Version: 3.5.1
% 0.64/1.05 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.64/1.05 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/1.05 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.64/1.05 % Starting new_bool_3 with 300s (1) cores
% 0.64/1.05 % Starting new_bool_1 with 300s (1) cores
% 0.64/1.05 % Starting sh5l with 300s (1) cores
% 0.64/1.05 % sh5l with pid 3617007 completed with status 0
% 0.64/1.05 % Result found by sh5l
% 0.64/1.05 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.64/1.05 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/1.05 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.64/1.05 % Starting new_bool_3 with 300s (1) cores
% 0.64/1.05 % Starting new_bool_1 with 300s (1) cores
% 0.64/1.05 % Starting sh5l with 300s (1) cores
% 0.64/1.05 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.64/1.05 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.64/1.05 % Search class: FHUPM-FFSF21-MFFFFFNN
% 0.64/1.05 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.64/1.05 % Starting SubtermCWHack with 28s (1) cores
% 0.64/1.05 % SubtermCWHack with pid 3617013 completed with status 0
% 0.64/1.05 % Result found by SubtermCWHack
% 0.64/1.06 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.64/1.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.64/1.06 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.64/1.06 % Starting new_bool_3 with 300s (1) cores
% 0.64/1.06 % Starting new_bool_1 with 300s (1) cores
% 0.64/1.06 % Starting sh5l with 300s (1) cores
% 0.64/1.06 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.64/1.06 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.64/1.06 % Search class: FHUPM-FFSF21-MFFFFFNN
% 0.64/1.06 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.64/1.06 % Starting SubtermCWHack with 28s (1) cores
% 0.64/1.06 % Preprocessing time : 0.001 s
% 0.64/1.06
% 0.64/1.06 % Proof found!
% 0.64/1.06 % SZS status Unsatisfiable
% 0.64/1.06 % SZS output start CNFRefutation
% See solution above
% 0.64/1.06 % Parsed axioms : 14
% 0.64/1.06 % Removed by relevancy pruning/SinE : 0
% 0.64/1.06 % Initial clauses : 14
% 0.64/1.06 % Removed in clause preprocessing : 0
% 0.64/1.06 % Initial clauses in saturation : 14
% 0.64/1.06 % Processed clauses : 584
% 0.64/1.06 % ...of these trivial : 336
% 0.64/1.06 % ...subsumed : 68
% 0.64/1.06 % ...remaining for further processing : 180
% 0.64/1.06 % Other redundant clauses eliminated : 56
% 0.64/1.06 % Clauses deleted for lack of memory : 0
% 0.64/1.06 % Backward-subsumed : 3
% 0.64/1.06 % Backward-rewritten : 12
% 0.64/1.06 % Generated clauses : 14482
% 0.64/1.06 % ...of the previous two non-redundant : 5218
% 0.64/1.06 % ...aggressively subsumed : 0
% 0.64/1.06 % Contextual simplify-reflections : 0
% 0.64/1.06 % Paramodulations : 14426
% 0.64/1.06 % Factorizations : 0
% 0.64/1.06 % NegExts : 0
% 0.64/1.06 % Equation resolutions : 56
% 0.64/1.06 % Disequality decompositions : 0
% 0.64/1.06 % Total rewrite steps : 25455
% 0.64/1.06 % ...of those cached : 21483
% 0.64/1.06 % Propositional unsat checks : 0
% 0.64/1.06 % Propositional check models : 0
% 0.64/1.06 % Propositional check unsatisfiable : 0
% 0.64/1.06 % Propositional clauses : 0
% 0.64/1.06 % Propositional clauses after purity: 0
% 0.64/1.06 % Propositional unsat core size : 0
% 0.64/1.06 % Propositional preprocessing time : 0.000
% 0.64/1.06 % Propositional encoding time : 0.000
% 0.64/1.06 % Propositional solver time : 0.000
% 0.64/1.06 % Success case prop preproc time : 0.000
% 0.64/1.06 % Success case prop encoding time : 0.000
% 0.64/1.06 % Success case prop solver time : 0.000
% 0.64/1.06 % Current number of processed clauses : 165
% 0.64/1.06 % Positive orientable unit clauses : 151
% 0.64/1.06 % Positive unorientable unit clauses: 6
% 0.64/1.06 % Negative unit clauses : 2
% 0.64/1.06 % Non-unit-clauses : 6
% 0.64/1.06 % Current number of unprocessed clauses: 4579
% 0.64/1.06 % ...number of literals in the above : 5358
% 0.64/1.06 % Current number of archived formulas : 0
% 0.64/1.06 % Current number of archived clauses : 15
% 0.64/1.06 % Clause-clause subsumption calls (NU) : 10
% 0.64/1.06 % Rec. Clause-clause subsumption calls : 10
% 0.64/1.06 % Non-unit clause-clause subsumptions : 3
% 0.64/1.06 % Unit Clause-clause subsumption calls : 23
% 0.64/1.06 % Rewrite failures with RHS unbound : 0
% 0.64/1.06 % BW rewrite match attempts : 515
% 0.64/1.06 % BW rewrite match successes : 251
% 0.64/1.06 % Condensation attempts : 0
% 0.64/1.06 % Condensation successes : 0
% 0.64/1.06 % Termbank termtop insertions : 137790
% 0.64/1.06 % Search garbage collected termcells : 8
% 0.64/1.06
% 0.64/1.06 % -------------------------------------------------
% 0.64/1.06 % User time : 0.053 s
% 0.64/1.06 % System time : 0.007 s
% 0.64/1.06 % Total time : 0.060 s
% 0.64/1.06 % Maximum resident set size: 3588 pages
% 0.64/1.06
% 0.64/1.06 % -------------------------------------------------
% 0.64/1.06 % User time : 0.054 s
% 0.64/1.06 % System time : 0.010 s
% 0.64/1.06 % Total time : 0.063 s
% 0.64/1.06 % Maximum resident set size: 4608 pages
% 0.64/1.06 % E exiting
%------------------------------------------------------------------------------