%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LAT240-1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n016.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 1.54s 0.68s
% Output : CNFRefutation 1.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 51 ( 48 unt; 0 nHn; 12 RR)
% Number of literals : 57 ( 56 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 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 : 75 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-4.ax',complement_join) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_distributivity_hypothesis) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption2) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_join) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
cnf(equation_H50,axiom,
meet(X1,join(X2,meet(X3,join(X1,X4)))) = meet(X1,join(X2,meet(X3,join(X1,meet(X3,join(X2,X4)))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equation_H50) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-4.ax',complement_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,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-4.ax',meet_join_complement) ).
cnf(c_0_13,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_14,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_15,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_17,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_18,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_19,plain,
meet(one,X1) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_21,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_22,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_23,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_24,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_25,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_26,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_27,hypothesis,
meet(a,meet(b,X1)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_28,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_13]),c_0_20]) ).
cnf(c_0_29,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_14]),c_0_25]) ).
cnf(c_0_30,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_26,c_0_14]) ).
cnf(c_0_31,hypothesis,
meet(a,meet(X1,b)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_27,c_0_16]) ).
cnf(c_0_32,plain,
join(complement(X1),join(X2,X1)) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_20]) ).
cnf(c_0_33,hypothesis,
join(meet(X1,b),meet(a,X1)) = meet(X1,b),
inference(spm,[status(thm)],[c_0_24,c_0_31]) ).
cnf(c_0_34,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_35,axiom,
meet(X1,join(X2,meet(X3,join(X1,X4)))) = meet(X1,join(X2,meet(X3,join(X1,meet(X3,join(X2,X4)))))),
equation_H50 ).
cnf(c_0_36,hypothesis,
join(meet(X1,b),complement(meet(a,X1))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_34]) ).
cnf(c_0_37,hypothesis,
meet(a,join(X1,meet(X2,join(b,meet(X2,join(X1,X3)))))) = meet(a,join(X1,meet(X2,join(b,X3)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_35]),c_0_27]) ).
cnf(c_0_38,hypothesis,
join(complement(a),meet(b,join(a,X1))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_13]),c_0_16]),c_0_34]) ).
cnf(c_0_39,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_34]) ).
cnf(c_0_40,hypothesis,
meet(a,join(complement(a),meet(X1,b))) = meet(a,join(complement(a),X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_15]),c_0_39]),c_0_18]) ).
cnf(c_0_41,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_42,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
inference(fof_simplification,[status(thm)],[prove_distributivity]) ).
cnf(c_0_43,plain,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
inference(fof_simplification,[status(thm)],[meet_join_complement]) ).
cnf(c_0_44,hypothesis,
meet(a,join(complement(a),meet(b,X1))) = meet(a,join(complement(a),X1)),
inference(spm,[status(thm)],[c_0_40,c_0_16]) ).
cnf(c_0_45,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
c_0_42 ).
cnf(c_0_47,plain,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
c_0_43 ).
cnf(c_0_48,hypothesis,
meet(a,join(complement(a),complement(b))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_41]),c_0_45]),c_0_41]) ).
cnf(c_0_49,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_46,c_0_34]) ).
cnf(c_0_50,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_29])]),c_0_49]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT240-1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.35 % Computer : n016.cluster.edu
% 0.09/0.35 % Model : x86_64 x86_64
% 0.09/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35 % Memory : 8046.5625MB
% 0.09/0.35 % OS : Linux 6.8.0-71-generic
% 0.09/0.35 % CPULimit : 300
% 0.09/0.35 % WCLimit : 300
% 0.09/0.35 % DateTime : Sun Sep 20 23:27:07 UTC 2026
% 0.09/0.35 % CPUTime :
% 0.09/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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
% 1.54/0.68 % Version: 3.5.1
% 1.54/0.68 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.54/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.54/0.68 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.54/0.68 % Starting new_bool_3 with 300s (1) cores
% 1.54/0.68 % Starting new_bool_1 with 300s (1) cores
% 1.54/0.68 % Starting sh5l with 300s (1) cores
% 1.54/0.68 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1015552 completed with status 0
% 1.54/0.68 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.54/0.68 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.54/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.54/0.68 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.54/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.54/0.68 % No SInE strategy applied
% 1.54/0.68 % Search class: FHUPM-FFSF21-DFFFFFNN
% 1.54/0.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.54/0.68 % Starting SubtermCWHack with 136s (1) cores
% 1.54/0.68 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.54/0.68 % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 1.54/0.68 % Starting new_bool_3 with 136s (1) cores
% 1.54/0.68 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 1.54/0.68 % G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 1015560 completed with status 0
% 1.54/0.68 % Result found by G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 1.54/0.68 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.54/0.68 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.54/0.68 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.54/0.68 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.54/0.68 % No SInE strategy applied
% 1.54/0.68 % Search class: FHUPM-FFSF21-DFFFFFNN
% 1.54/0.68 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.54/0.68 % Starting SubtermCWHack with 136s (1) cores
% 1.54/0.68 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.54/0.68 % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 1.54/0.68 % Preprocessing time : 0.001 s
% 1.54/0.68 % Presaturation interreduction done
% 1.54/0.68
% 1.54/0.68 % Proof found!
% 1.54/0.68 % SZS status Unsatisfiable
% 1.54/0.68 % SZS output start CNFRefutation
% See solution above
% 1.54/0.68 % Parsed axioms : 14
% 1.54/0.68 % Removed by relevancy pruning/SinE : 0
% 1.54/0.68 % Initial clauses : 14
% 1.54/0.68 % Removed in clause preprocessing : 0
% 1.54/0.68 % Initial clauses in saturation : 14
% 1.54/0.68 % Processed clauses : 1107
% 1.54/0.68 % ...of these trivial : 666
% 1.54/0.68 % ...subsumed : 141
% 1.54/0.68 % ...remaining for further processing : 300
% 1.54/0.68 % Other redundant clauses eliminated : 0
% 1.54/0.68 % Clauses deleted for lack of memory : 0
% 1.54/0.68 % Backward-subsumed : 0
% 1.54/0.68 % Backward-rewritten : 36
% 1.54/0.68 % Generated clauses : 22227
% 1.54/0.68 % ...of the previous two non-redundant : 7923
% 1.54/0.68 % ...aggressively subsumed : 0
% 1.54/0.68 % Contextual simplify-reflections : 0
% 1.54/0.68 % Paramodulations : 22222
% 1.54/0.68 % Factorizations : 0
% 1.54/0.68 % NegExts : 0
% 1.54/0.68 % Equation resolutions : 5
% 1.54/0.68 % Disequality decompositions : 0
% 1.54/0.68 % Total rewrite steps : 47944
% 1.54/0.68 % ...of those cached : 40483
% 1.54/0.68 % Propositional unsat checks : 0
% 1.54/0.68 % Propositional check models : 0
% 1.54/0.68 % Propositional check unsatisfiable : 0
% 1.54/0.68 % Propositional clauses : 0
% 1.54/0.68 % Propositional clauses after purity: 0
% 1.54/0.68 % Propositional unsat core size : 0
% 1.54/0.68 % Propositional preprocessing time : 0.000
% 1.54/0.68 % Propositional encoding time : 0.000
% 1.54/0.68 % Propositional solver time : 0.000
% 1.54/0.68 % Success case prop preproc time : 0.000
% 1.54/0.68 % Success case prop encoding time : 0.000
% 1.54/0.68 % Success case prop solver time : 0.000
% 1.54/0.68 % Current number of processed clauses : 250
% 1.54/0.68 % Positive orientable unit clauses : 234
% 1.54/0.68 % Positive unorientable unit clauses: 4
% 1.54/0.68 % Negative unit clauses : 1
% 1.54/0.68 % Non-unit-clauses : 11
% 1.54/0.68 % Current number of unprocessed clauses: 6794
% 1.54/0.68 % ...number of literals in the above : 6971
% 1.54/0.68 % Current number of archived formulas : 0
% 1.54/0.68 % Current number of archived clauses : 50
% 1.54/0.68 % Clause-clause subsumption calls (NU) : 83
% 1.54/0.68 % Rec. Clause-clause subsumption calls : 83
% 1.54/0.68 % Non-unit clause-clause subsumptions : 43
% 1.54/0.68 % Unit Clause-clause subsumption calls : 25
% 1.54/0.68 % Rewrite failures with RHS unbound : 0
% 1.54/0.68 % BW rewrite match attempts : 808
% 1.54/0.68 % BW rewrite match successes : 242
% 1.54/0.68 % Condensation attempts : 0
% 1.54/0.68 % Condensation successes : 0
% 1.54/0.68 % Termbank termtop insertions : 280996
% 1.54/0.68 % Search garbage collected termcells : 8
% 1.54/0.68
% 1.54/0.68 % -------------------------------------------------
% 1.54/0.68 % User time : 0.206 s
% 1.54/0.68 % System time : 0.012 s
% 1.54/0.68 % Total time : 0.218 s
% 1.54/0.68 % Maximum resident set size: 3644 pages
% 1.54/0.68
% 1.54/0.68 % -------------------------------------------------
% 1.54/0.68 % User time : 0.923 s
% 1.54/0.68 % System time : 0.064 s
% 1.54/0.68 % Total time : 0.987 s
% 1.54/0.68 % Maximum resident set size: 4864 pages
% 1.54/0.68 % E exiting
%------------------------------------------------------------------------------