%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT256-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 : n007.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:34 PM UTC 2026
% Result : Unsatisfiable 140.56s 21.19s
% Output : CNFRefutation 140.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of clauses : 69 ( 64 unt; 0 nHn; 24 RR)
% Number of literals : 78 ( 77 equ; 13 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 : 94 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
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(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-4.ax',complement_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption2) ).
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(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_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(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(equation_H81,axiom,
meet(X1,join(meet(X1,X2),meet(X3,join(X1,meet(X2,join(X1,X3)))))) = meet(X1,join(meet(X1,X2),meet(X1,X3))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equation_H81) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_distributivity) ).
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,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_22,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_23,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_24,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_25,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_26,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_27,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_28,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_29,plain,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
inference(fof_simplification,[status(thm)],[meet_join_complement]) ).
cnf(c_0_30,axiom,
meet(X1,join(meet(X1,X2),meet(X3,join(X1,meet(X2,join(X1,X3)))))) = meet(X1,join(meet(X1,X2),meet(X1,X3))),
equation_H81 ).
cnf(c_0_31,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_32,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_22]) ).
cnf(c_0_33,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_34,plain,
join(X1,join(complement(X1),X2)) = join(one,X2),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_35,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_36,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_25]),c_0_14]) ).
cnf(c_0_37,hypothesis,
join(a,b) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_25]) ).
cnf(c_0_38,plain,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
c_0_29 ).
cnf(c_0_39,plain,
meet(X1,join(meet(X1,X2),meet(complement(X1),join(X1,X2)))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_17]),c_0_22]),c_0_31]),c_0_32]),c_0_33]) ).
cnf(c_0_40,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_41,hypothesis,
join(a,join(X1,b)) = join(X1,b),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_42,plain,
( join(X1,X2) != one
| meet(X2,X1) != zero
| complement(X1) = X2 ),
inference(spm,[status(thm)],[c_0_38,c_0_19]) ).
cnf(c_0_43,plain,
meet(X1,join(meet(X1,X2),meet(complement(X1),join(X2,X1)))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_39,c_0_25]) ).
cnf(c_0_44,hypothesis,
join(b,complement(a)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_25]) ).
cnf(c_0_45,plain,
complement(complement(X1)) = X1,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_22]),c_0_25]),c_0_17])]) ).
cnf(c_0_46,plain,
meet(X1,join(meet(X2,X1),meet(complement(X1),join(X1,X2)))) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_39,c_0_19]) ).
cnf(c_0_47,hypothesis,
meet(complement(a),join(a,meet(b,complement(a)))) = meet(b,complement(a)),
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_43,c_0_44]),c_0_19]),c_0_45]),c_0_31]),c_0_25]),c_0_19]) ).
cnf(c_0_48,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_19]),c_0_23]) ).
cnf(c_0_49,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_25]) ).
cnf(c_0_50,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_23,c_0_21]) ).
cnf(c_0_51,hypothesis,
meet(join(a,meet(b,complement(a))),join(meet(b,complement(a)),complement(join(a,meet(b,complement(a)))))) = meet(b,complement(a)),
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_46,c_0_47]),c_0_14]),c_0_25]),c_0_27]),c_0_17]),c_0_31]) ).
cnf(c_0_52,hypothesis,
meet(a,meet(b,X1)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_53,plain,
meet(X1,meet(X2,join(X3,X1))) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_54,hypothesis,
meet(a,join(meet(b,complement(a)),complement(join(a,meet(b,complement(a)))))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]),c_0_22]) ).
cnf(c_0_55,plain,
join(X1,join(X2,complement(join(X1,X2)))) = one,
inference(spm,[status(thm)],[c_0_17,c_0_14]) ).
cnf(c_0_56,hypothesis,
meet(b,meet(complement(a),complement(join(a,meet(b,complement(a)))))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_51]),c_0_22]),c_0_19]),c_0_23]) ).
cnf(c_0_57,hypothesis,
join(meet(b,complement(a)),complement(join(a,meet(b,complement(a))))) = complement(a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_54]),c_0_55])]) ).
cnf(c_0_58,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_14,c_0_18]) ).
cnf(c_0_59,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
inference(fof_simplification,[status(thm)],[prove_distributivity]) ).
cnf(c_0_60,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_16,c_0_25]) ).
cnf(c_0_61,hypothesis,
( join(b,meet(complement(a),complement(join(a,meet(b,complement(a)))))) != one
| meet(complement(a),complement(join(a,meet(b,complement(a))))) = complement(b) ),
inference(spm,[status(thm)],[c_0_38,c_0_56]) ).
cnf(c_0_62,hypothesis,
meet(complement(a),complement(join(a,meet(b,complement(a))))) = complement(join(a,meet(b,complement(a)))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_57]),c_0_19]) ).
cnf(c_0_63,hypothesis,
join(b,complement(join(a,meet(b,complement(a))))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_57]),c_0_44]) ).
cnf(c_0_64,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
c_0_59 ).
cnf(c_0_65,hypothesis,
join(complement(a),complement(join(a,meet(b,complement(a))))) = complement(a),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_57]),c_0_25]) ).
cnf(c_0_66,hypothesis,
complement(join(a,meet(b,complement(a)))) = complement(b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62]),c_0_62]),c_0_63])]) ).
cnf(c_0_67,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_64,c_0_25]) ).
cnf(c_0_68,hypothesis,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT256-1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n007.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 23:21:35 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.16/0.45 Running first-order theorem proving
% 0.16/0.45 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
% 140.56/21.19 % Version: 3.5.1
% 140.56/21.19 % Preprocessing class: FSSSSMSSSSSNFFN.
% 140.56/21.19 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 140.56/21.19 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 140.56/21.19 % Starting new_bool_3 with 300s (1) cores
% 140.56/21.19 % Starting new_bool_1 with 300s (1) cores
% 140.56/21.19 % Starting sh5l with 300s (1) cores
% 140.56/21.19 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3802851 completed with status 0
% 140.56/21.19 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 140.56/21.19 % Preprocessing class: FSSSSMSSSSSNFFN.
% 140.56/21.19 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 140.56/21.19 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 140.56/21.19 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 140.56/21.19 % No SInE strategy applied
% 140.56/21.19 % Search class: FHUPM-FFSF21-DFFFFFNN
% 140.56/21.19 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 140.56/21.19 % Starting SubtermCWHack with 136s (1) cores
% 140.56/21.19 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 140.56/21.19 % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 140.56/21.19 % Starting new_bool_3 with 136s (1) cores
% 140.56/21.19 % Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S04AN with 136s (1) cores
% 140.56/21.19 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3802856 completed with status 0
% 140.56/21.19 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 140.56/21.19 % Preprocessing class: FSSSSMSSSSSNFFN.
% 140.56/21.19 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 140.56/21.19 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 140.56/21.19 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 140.56/21.19 % No SInE strategy applied
% 140.56/21.19 % Search class: FHUPM-FFSF21-DFFFFFNN
% 140.56/21.19 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 140.56/21.19 % Starting SubtermCWHack with 136s (1) cores
% 140.56/21.19 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 140.56/21.19 % Preprocessing time : 0.001 s
% 140.56/21.19
% 140.56/21.19 % Proof found!
% 140.56/21.19 % SZS status Unsatisfiable
% 140.56/21.19 % SZS output start CNFRefutation
% See solution above
% 140.56/21.20 % Parsed axioms : 14
% 140.56/21.20 % Removed by relevancy pruning/SinE : 0
% 140.56/21.20 % Initial clauses : 14
% 140.56/21.20 % Removed in clause preprocessing : 0
% 140.56/21.20 % Initial clauses in saturation : 14
% 140.56/21.20 % Processed clauses : 9616
% 140.56/21.20 % ...of these trivial : 1309
% 140.56/21.20 % ...subsumed : 7348
% 140.56/21.20 % ...remaining for further processing : 959
% 140.56/21.20 % Other redundant clauses eliminated : 0
% 140.56/21.20 % Clauses deleted for lack of memory : 0
% 140.56/21.20 % Backward-subsumed : 168
% 140.56/21.20 % Backward-rewritten : 67
% 140.56/21.20 % Generated clauses : 524347
% 140.56/21.20 % ...of the previous two non-redundant : 410113
% 140.56/21.20 % ...aggressively subsumed : 0
% 140.56/21.20 % Contextual simplify-reflections : 9
% 140.56/21.20 % Paramodulations : 524345
% 140.56/21.20 % Factorizations : 0
% 140.56/21.20 % NegExts : 0
% 140.56/21.20 % Equation resolutions : 2
% 140.56/21.20 % Disequality decompositions : 0
% 140.56/21.20 % Total rewrite steps : 1555665
% 140.56/21.20 % ...of those cached : 1304419
% 140.56/21.20 % Propositional unsat checks : 0
% 140.56/21.20 % Propositional check models : 0
% 140.56/21.20 % Propositional check unsatisfiable : 0
% 140.56/21.20 % Propositional clauses : 0
% 140.56/21.20 % Propositional clauses after purity: 0
% 140.56/21.20 % Propositional unsat core size : 0
% 140.56/21.20 % Propositional preprocessing time : 0.000
% 140.56/21.20 % Propositional encoding time : 0.000
% 140.56/21.20 % Propositional solver time : 0.000
% 140.56/21.20 % Success case prop preproc time : 0.000
% 140.56/21.20 % Success case prop encoding time : 0.000
% 140.56/21.20 % Success case prop solver time : 0.000
% 140.56/21.20 % Current number of processed clauses : 724
% 140.56/21.20 % Positive orientable unit clauses : 498
% 140.56/21.20 % Positive unorientable unit clauses: 8
% 140.56/21.20 % Negative unit clauses : 43
% 140.56/21.20 % Non-unit-clauses : 175
% 140.56/21.20 % Current number of unprocessed clauses: 399476
% 140.56/21.20 % ...number of literals in the above : 603337
% 140.56/21.20 % Current number of archived formulas : 0
% 140.56/21.20 % Current number of archived clauses : 235
% 140.56/21.20 % Clause-clause subsumption calls (NU) : 16986
% 140.56/21.20 % Rec. Clause-clause subsumption calls : 13402
% 140.56/21.20 % Non-unit clause-clause subsumptions : 931
% 140.56/21.20 % Unit Clause-clause subsumption calls : 1470
% 140.56/21.20 % Rewrite failures with RHS unbound : 0
% 140.56/21.20 % BW rewrite match attempts : 30502
% 140.56/21.20 % BW rewrite match successes : 286
% 140.56/21.20 % Condensation attempts : 0
% 140.56/21.20 % Condensation successes : 0
% 140.56/21.20 % Termbank termtop insertions : 17941064
% 140.56/21.20 % Search garbage collected termcells : 8
% 140.56/21.20
% 140.56/21.20 % -------------------------------------------------
% 140.56/21.20 % User time : 19.179 s
% 140.56/21.20 % System time : 0.674 s
% 140.56/21.20 % Total time : 19.853 s
% 140.56/21.20 % Maximum resident set size: 3640 pages
% 140.56/21.20
% 140.56/21.20 % -------------------------------------------------
% 140.56/21.20 % User time : 95.977 s
% 140.56/21.20 % System time : 3.305 s
% 140.56/21.20 % Total time : 99.282 s
% 140.56/21.20 % Maximum resident set size: 4608 pages
% 140.56/21.20 % E exiting
%------------------------------------------------------------------------------