%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LAT241-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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:49 PM UTC 2026
% Result : Unsatisfiable 0.15s 10.52s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 14
% Syntax : Number of clauses : 50 ( 50 unt; 0 nHn; 12 RR)
% Number of literals : 50 ( 49 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 74 ( 10 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',idempotence_of_join) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_meet) ).
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_distributivity_hypothesis) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_meet) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_of_join) ).
cnf(equation_H51,axiom,
meet(X1,join(X2,meet(X3,join(X1,X4)))) = meet(X1,join(X2,join(meet(X1,X3),meet(X3,X4)))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equation_H51) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',absorption1) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',associativity_of_meet) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_distributivity) ).
cnf(meet_join_complement,axiom,
ifeq(join(X1,X2),one,ifeq(meet(X1,X2),zero,complement(X1),X2),X2) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',meet_join_complement) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(c_0_14,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_15,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_16,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_18,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_19,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_20,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_21,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_22,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_23,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_24,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_26,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_21]) ).
cnf(c_0_27,plain,
join(X1,join(complement(X1),X2)) = join(one,X2),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_28,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_29,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_22]),c_0_14]) ).
cnf(c_0_30,hypothesis,
join(a,b) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_22]) ).
cnf(c_0_31,axiom,
meet(X1,join(X2,meet(X3,join(X1,X4)))) = meet(X1,join(X2,join(meet(X1,X3),meet(X3,X4)))),
equation_H51 ).
cnf(c_0_32,plain,
join(zero,X1) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_26]) ).
cnf(c_0_33,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,hypothesis,
join(a,join(X1,b)) = join(X1,b),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_36,plain,
meet(X1,join(X2,meet(complement(X1),join(X1,X3)))) = meet(X1,join(X2,meet(complement(X1),X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_21]),c_0_32]) ).
cnf(c_0_37,hypothesis,
join(b,complement(a)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_22]) ).
cnf(c_0_38,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_35,c_0_17]) ).
cnf(c_0_39,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_40,hypothesis,
meet(b,join(X1,meet(complement(a),complement(b)))) = meet(b,join(X1,complement(b))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]),c_0_19]) ).
cnf(c_0_41,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
inference(fof_simplification,[status(thm)],[prove_distributivity]) ).
cnf(c_0_42,hypothesis,
meet(a,meet(b,X1)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_39,c_0_25]) ).
cnf(c_0_43,hypothesis,
meet(b,join(complement(a),complement(b))) = meet(b,complement(a)),
inference(spm,[status(thm)],[c_0_40,c_0_18]) ).
cnf(c_0_44,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
c_0_41 ).
cnf(c_0_45,axiom,
ifeq(join(X1,X2),one,ifeq(meet(X1,X2),zero,complement(X1),X2),X2) = X2,
meet_join_complement ).
cnf(c_0_46,hypothesis,
meet(a,join(complement(a),complement(b))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_42]),c_0_21]) ).
cnf(c_0_47,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_48,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_44,c_0_22]) ).
cnf(c_0_49,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_33]),c_0_47]),c_0_47]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LAT241-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/10.40 % Computer : n018.cluster.edu
% 0.11/10.40 % Model : x86_64 x86_64
% 0.11/10.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/10.40 % Memory : 8046.5625MB
% 0.11/10.40 % OS : Linux 6.8.0-71-generic
% 0.11/10.40 % CPULimit : 300
% 0.11/10.40 % WCLimit : 300
% 0.11/10.40 % DateTime : Sun Sep 20 23:24:55 UTC 2026
% 0.11/10.40 % CPUTime :
% 0.11/10.40 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/10.44 Running first-order theorem proving
% 0.11/10.44 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
% 0.15/10.52 % Version: 3.5.1
% 0.15/10.52 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/10.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/10.52 % Starting new_bool_3 with 300s (1) cores
% 0.15/10.52 % Starting new_bool_1 with 300s (1) cores
% 0.15/10.52 % Starting sh5l with 300s (1) cores
% 0.15/10.52 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 413299 completed with status 0
% 0.15/10.52 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/10.52 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/10.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/10.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/10.52 % No SInE strategy applied
% 0.15/10.52 % Search class: FUUPM-FFSF32-MFFFFFNN
% 0.15/10.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/10.52 % Starting SubtermCWHack with 136s (1) cores
% 0.15/10.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/10.52 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 0.15/10.52 % Starting G-E--_208_B02_F1_AE_CS_SP_PS_S0Y with 136s (1) cores
% 0.15/10.52 % Starting H----_047_C09_12_F1_AE_ND_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.15/10.52 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 413304 completed with status 0
% 0.15/10.52 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/10.52 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/10.52 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/10.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/10.52 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/10.52 % No SInE strategy applied
% 0.15/10.52 % Search class: FUUPM-FFSF32-MFFFFFNN
% 0.15/10.52 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/10.52 % Starting SubtermCWHack with 136s (1) cores
% 0.15/10.52 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/10.52 % Preprocessing time : 0.001 s
% 0.15/10.52
% 0.15/10.52 % Proof found!
% 0.15/10.52 % SZS status Unsatisfiable
% 0.15/10.52 % SZS output start CNFRefutation
% See solution above
% 0.15/10.52 % Parsed axioms : 15
% 0.15/10.52 % Removed by relevancy pruning/SinE : 0
% 0.15/10.52 % Initial clauses : 15
% 0.15/10.52 % Removed in clause preprocessing : 0
% 0.15/10.52 % Initial clauses in saturation : 15
% 0.15/10.52 % Processed clauses : 303
% 0.15/10.52 % ...of these trivial : 136
% 0.15/10.52 % ...subsumed : 46
% 0.15/10.52 % ...remaining for further processing : 121
% 0.15/10.52 % Other redundant clauses eliminated : 0
% 0.15/10.52 % Clauses deleted for lack of memory : 0
% 0.15/10.52 % Backward-subsumed : 0
% 0.15/10.52 % Backward-rewritten : 9
% 0.15/10.52 % Generated clauses : 5990
% 0.15/10.52 % ...of the previous two non-redundant : 3726
% 0.15/10.52 % ...aggressively subsumed : 0
% 0.15/10.52 % Contextual simplify-reflections : 0
% 0.15/10.52 % Paramodulations : 5990
% 0.15/10.52 % Factorizations : 0
% 0.15/10.52 % NegExts : 0
% 0.15/10.52 % Equation resolutions : 0
% 0.15/10.52 % Disequality decompositions : 0
% 0.15/10.52 % Total rewrite steps : 7738
% 0.15/10.52 % ...of those cached : 5400
% 0.15/10.52 % Propositional unsat checks : 0
% 0.15/10.52 % Propositional check models : 0
% 0.15/10.52 % Propositional check unsatisfiable : 0
% 0.15/10.52 % Propositional clauses : 0
% 0.15/10.52 % Propositional clauses after purity: 0
% 0.15/10.52 % Propositional unsat core size : 0
% 0.15/10.52 % Propositional preprocessing time : 0.000
% 0.15/10.52 % Propositional encoding time : 0.000
% 0.15/10.52 % Propositional solver time : 0.000
% 0.15/10.52 % Success case prop preproc time : 0.000
% 0.15/10.52 % Success case prop encoding time : 0.000
% 0.15/10.52 % Success case prop solver time : 0.000
% 0.15/10.52 % Current number of processed clauses : 112
% 0.15/10.52 % Positive orientable unit clauses : 105
% 0.15/10.52 % Positive unorientable unit clauses: 6
% 0.15/10.52 % Negative unit clauses : 1
% 0.15/10.52 % Non-unit-clauses : 0
% 0.15/10.52 % Current number of unprocessed clauses: 3419
% 0.15/10.52 % ...number of literals in the above : 3419
% 0.15/10.52 % Current number of archived formulas : 0
% 0.15/10.52 % Current number of archived clauses : 9
% 0.15/10.52 % Clause-clause subsumption calls (NU) : 0
% 0.15/10.52 % Rec. Clause-clause subsumption calls : 0
% 0.15/10.52 % Non-unit clause-clause subsumptions : 0
% 0.15/10.52 % Unit Clause-clause subsumption calls : 15
% 0.15/10.52 % Rewrite failures with RHS unbound : 0
% 0.15/10.52 % BW rewrite match attempts : 245
% 0.15/10.52 % BW rewrite match successes : 77
% 0.15/10.52 % Condensation attempts : 0
% 0.15/10.52 % Condensation successes : 0
% 0.15/10.52 % Termbank termtop insertions : 78765
% 0.15/10.52 % Search garbage collected termcells : 2
% 0.15/10.52
% 0.15/10.52 % -------------------------------------------------
% 0.15/10.52 % User time : 0.048 s
% 0.15/10.52 % System time : 0.007 s
% 0.15/10.52 % Total time : 0.055 s
% 0.15/10.52 % Maximum resident set size: 3636 pages
% 0.15/10.52
% 0.15/10.52 % -------------------------------------------------
% 0.15/10.52 % User time : 0.240 s
% 0.15/10.52 % System time : 0.032 s
% 0.15/10.52 % Total time : 0.272 s
% 0.15/10.52 % Maximum resident set size: 4864 pages
% 0.15/10.52 % E exiting
%------------------------------------------------------------------------------