%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT005-3 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:00 PM UTC 2026
% Result : Unsatisfiable 225.27s 33.77s
% Output : CNFRefutation 225.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of clauses : 72 ( 63 unt; 0 nHn; 25 RR)
% Number of literals : 81 ( 70 equ; 15 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 121 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(modular,axiom,
( meet(X1,X2) != X1
| meet(X2,join(X1,X3)) = join(X1,meet(X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-1.ax',modular) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_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(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption2) ).
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(complement_join,axiom,
( ~ complement(X1,X2)
| join(X1,X2) = n1 ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-2.ax',complement_join) ).
cnf(complement_of_a_meet_b,hypothesis,
complement(r2,meet(a,b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_of_a_meet_b) ).
cnf(complement_meet,axiom,
( ~ complement(X1,X2)
| meet(X1,X2) = n0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-2.ax',complement_meet) ).
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(x_meet_1,axiom,
meet(X1,n1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-1.ax',x_meet_1) ).
cnf(prove_lemma,negated_conjecture,
r1 != meet(join(r1,meet(r2,b)),join(r1,meet(r2,a))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lemma) ).
cnf(complement_of_a_join_b,hypothesis,
complement(r1,join(a,b)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',complement_of_a_join_b) ).
cnf(x_meet_0,axiom,
meet(X1,n0) = n0,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-1.ax',x_meet_0) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).
cnf(x_join_0,axiom,
join(X1,n0) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-1.ax',x_join_0) ).
cnf(c_0_16,plain,
( meet(X1,X2) != X1
| meet(X2,join(X1,X3)) = join(X1,meet(X3,X2)) ),
inference(fof_simplification,[status(thm)],[modular]) ).
cnf(c_0_17,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_18,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_19,plain,
( meet(X1,X2) != X1
| meet(X2,join(X1,X3)) = join(X1,meet(X3,X2)) ),
c_0_16 ).
cnf(c_0_20,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_21,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_22,plain,
join(X1,meet(X2,join(X3,X1))) = meet(join(X3,X1),join(X1,X2)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_23,plain,
join(X1,meet(X2,join(X1,X3))) = meet(join(X1,X3),join(X1,X2)),
inference(spm,[status(thm)],[c_0_19,c_0_17]) ).
cnf(c_0_24,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_25,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_26,plain,
meet(join(X1,X2),join(X3,X1)) = join(X1,meet(X2,join(X3,X1))),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
( ~ complement(X1,X2)
| join(X1,X2) = n1 ),
inference(fof_simplification,[status(thm)],[complement_join]) ).
cnf(c_0_28,plain,
meet(join(X1,X2),join(X1,X3)) = join(X1,meet(X2,join(X1,X3))),
inference(spm,[status(thm)],[c_0_21,c_0_23]) ).
cnf(c_0_29,plain,
meet(join(X1,X2),join(X2,X3)) = join(X2,meet(join(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_30,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_21]) ).
cnf(c_0_31,plain,
meet(X1,meet(X2,join(meet(X1,X2),X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_25]) ).
cnf(c_0_32,plain,
meet(X1,join(meet(X1,X2),X3)) = join(meet(X1,X2),meet(X3,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_24]),c_0_21]) ).
cnf(c_0_33,plain,
( ~ complement(X1,X2)
| join(X1,X2) = n1 ),
c_0_27 ).
cnf(c_0_34,hypothesis,
complement(r2,meet(a,b)),
complement_of_a_meet_b ).
cnf(c_0_35,plain,
( ~ complement(X1,X2)
| meet(X1,X2) = n0 ),
inference(fof_simplification,[status(thm)],[complement_meet]) ).
cnf(c_0_36,plain,
join(X1,meet(join(X2,X1),X3)) = join(X1,meet(X2,join(X1,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_18]),c_0_29]) ).
cnf(c_0_37,plain,
join(meet(X1,X2),meet(X2,join(meet(X1,X2),X3))) = meet(X2,join(meet(X1,X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_18]) ).
cnf(c_0_38,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_39,plain,
meet(X1,join(meet(X1,X2),X3)) = join(meet(X1,X2),meet(X1,X3)),
inference(spm,[status(thm)],[c_0_32,c_0_21]) ).
cnf(c_0_40,hypothesis,
join(meet(a,b),r2) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_18]) ).
cnf(c_0_41,axiom,
meet(X1,n1) = X1,
x_meet_1 ).
cnf(c_0_42,negated_conjecture,
r1 != meet(join(r1,meet(r2,b)),join(r1,meet(r2,a))),
inference(fof_simplification,[status(thm)],[prove_lemma]) ).
cnf(c_0_43,plain,
( ~ complement(X1,X2)
| meet(X1,X2) = n0 ),
c_0_35 ).
cnf(c_0_44,hypothesis,
complement(r1,join(a,b)),
complement_of_a_join_b ).
cnf(c_0_45,axiom,
meet(X1,n0) = n0,
x_meet_0 ).
cnf(c_0_46,plain,
meet(X1,join(meet(X2,X1),X3)) = join(meet(X2,X1),meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_30]),c_0_37]) ).
cnf(c_0_47,plain,
join(X1,join(meet(X2,X1),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_38,c_0_30]) ).
cnf(c_0_48,hypothesis,
join(meet(a,b),meet(a,r2)) = a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_49,negated_conjecture,
r1 != meet(join(r1,meet(r2,b)),join(r1,meet(r2,a))),
c_0_42 ).
cnf(c_0_50,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_25,c_0_17]) ).
cnf(c_0_51,hypothesis,
meet(r1,join(a,b)) = n0,
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_52,plain,
meet(n0,X1) = n0,
inference(spm,[status(thm)],[c_0_45,c_0_21]) ).
cnf(c_0_53,plain,
meet(X1,join(X2,meet(X3,X1))) = join(meet(X3,X1),meet(X1,X2)),
inference(spm,[status(thm)],[c_0_46,c_0_18]) ).
cnf(c_0_54,hypothesis,
join(b,meet(a,r2)) = join(a,b),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_18]) ).
cnf(c_0_55,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_56,negated_conjecture,
meet(join(r1,meet(a,r2)),join(r1,meet(b,r2))) != r1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_21]),c_0_21]),c_0_21]) ).
cnf(c_0_57,plain,
meet(join(X1,X2),join(X3,X2)) = join(X2,meet(X1,join(X3,X2))),
inference(spm,[status(thm)],[c_0_26,c_0_18]) ).
cnf(c_0_58,plain,
meet(X1,meet(X2,join(X1,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_50,c_0_21]) ).
cnf(c_0_59,hypothesis,
meet(r1,meet(join(a,b),X1)) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_51]),c_0_52]) ).
cnf(c_0_60,hypothesis,
meet(join(a,b),r2) = join(meet(a,r2),meet(b,r2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_21]),c_0_21]) ).
cnf(c_0_61,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_25,c_0_55]) ).
cnf(c_0_62,negated_conjecture,
join(r1,meet(a,meet(r2,join(r1,meet(b,r2))))) != r1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_28]),c_0_25]) ).
cnf(c_0_63,plain,
meet(X1,join(X2,meet(X3,X1))) = join(meet(X3,X1),meet(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_30]),c_0_21]) ).
cnf(c_0_64,plain,
meet(X1,join(X2,meet(X3,join(X1,X2)))) = meet(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_58,c_0_26]) ).
cnf(c_0_65,hypothesis,
meet(r1,join(meet(a,r2),meet(b,r2))) = n0,
inference(spm,[status(thm)],[c_0_59,c_0_60]) ).
cnf(c_0_66,axiom,
join(X1,n0) = X1,
x_join_0 ).
cnf(c_0_67,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_61,c_0_21]) ).
cnf(c_0_68,hypothesis,
meet(a,meet(b,r2)) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_34]),c_0_21]),c_0_25]) ).
cnf(c_0_69,negated_conjecture,
join(r1,meet(a,join(meet(r1,r2),meet(b,r2)))) != r1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_18]) ).
cnf(c_0_70,hypothesis,
meet(a,join(meet(r1,r2),meet(b,r2))) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[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_64,c_0_65]),c_0_66]),c_0_25]),c_0_67]),c_0_68]),c_0_25]),c_0_46]),c_0_21]),c_0_18]) ).
cnf(c_0_71,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_69,c_0_70]),c_0_66])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LAT005-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.51 % Computer : n009.cluster.edu
% 0.21/0.51 % Model : x86_64 x86_64
% 0.21/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.21/0.51 % Memory : 8046.5625MB
% 0.21/0.51 % OS : Linux 6.8.0-71-generic
% 0.21/0.51 % CPULimit : 300
% 0.21/0.51 % WCLimit : 300
% 0.21/0.51 % DateTime : Sun Sep 20 23:05:14 UTC 2026
% 0.21/0.52 % CPUTime :
% 0.21/0.52 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.21/0.59 Running first-order theorem proving
% 0.21/0.59 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
% 225.27/33.77 % Version: 3.5.1
% 225.27/33.77 % Preprocessing class: FSMSSMSSSSSNFFN.
% 225.27/33.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 225.27/33.77 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 225.27/33.77 % Starting new_bool_3 with 300s (1) cores
% 225.27/33.77 % Starting new_bool_1 with 300s (1) cores
% 225.27/33.77 % Starting sh5l with 300s (1) cores
% 225.27/33.77 % new_bool_3 with pid 247669 completed with status 0
% 225.27/33.77 % Result found by new_bool_3
% 225.27/33.77 % Preprocessing class: FSMSSMSSSSSNFFN.
% 225.27/33.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 225.27/33.77 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 225.27/33.77 % Starting new_bool_3 with 300s (1) cores
% 225.27/33.77 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 225.27/33.77 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 225.27/33.77 % Search class: FHUSM-FFSF22-MFFFFFNN
% 225.27/33.77 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 225.27/33.77 % Starting SubtermCWHack with 31s (1) cores
% 225.27/33.77 % SubtermCWHack with pid 247677 completed with status 8
% 225.27/33.77 % Starting H----_042_B03_F1_AE_Q4_SP_S2S with 181s (1) cores
% 225.27/33.77 % H----_042_B03_F1_AE_Q4_SP_S2S with pid 247683 completed with status 0
% 225.27/33.77 % Result found by H----_042_B03_F1_AE_Q4_SP_S2S
% 225.27/33.77 % Preprocessing class: FSMSSMSSSSSNFFN.
% 225.27/33.77 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 225.27/33.77 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 225.27/33.77 % Starting new_bool_3 with 300s (1) cores
% 225.27/33.77 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 225.27/33.77 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 225.27/33.77 % Search class: FHUSM-FFSF22-MFFFFFNN
% 225.27/33.77 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 225.27/33.77 % Starting SubtermCWHack with 31s (1) cores
% 225.27/33.77 % SubtermCWHack with pid 247677 completed with status 8
% 225.27/33.77 % Starting H----_042_B03_F1_AE_Q4_SP_S2S with 181s (1) cores
% 225.27/33.77 % Preprocessing time : 0.002 s
% 225.27/33.77
% 225.27/33.77 % Proof found!
% 225.27/33.77 % SZS status Unsatisfiable
% 225.27/33.77 % SZS output start CNFRefutation
% See solution above
% 225.27/33.77 % Parsed axioms : 19
% 225.27/33.77 % Removed by relevancy pruning/SinE : 0
% 225.27/33.77 % Initial clauses : 19
% 225.27/33.78 % Removed in clause preprocessing : 0
% 225.27/33.78 % Initial clauses in saturation : 19
% 225.27/33.78 % Processed clauses : 4631
% 225.27/33.78 % ...of these trivial : 1090
% 225.27/33.78 % ...subsumed : 2807
% 225.27/33.78 % ...remaining for further processing : 734
% 225.27/33.78 % Other redundant clauses eliminated : 0
% 225.27/33.78 % Clauses deleted for lack of memory : 0
% 225.27/33.78 % Backward-subsumed : 1
% 225.27/33.78 % Backward-rewritten : 142
% 225.27/33.78 % Generated clauses : 60075
% 225.27/33.78 % ...of the previous two non-redundant : 31687
% 225.27/33.78 % ...aggressively subsumed : 0
% 225.27/33.78 % Contextual simplify-reflections : 0
% 225.27/33.78 % Paramodulations : 60047
% 225.27/33.78 % Factorizations : 0
% 225.27/33.78 % NegExts : 0
% 225.27/33.78 % Equation resolutions : 28
% 225.27/33.78 % Disequality decompositions : 0
% 225.27/33.78 % Total rewrite steps : 110515
% 225.27/33.78 % ...of those cached : 93457
% 225.27/33.78 % Propositional unsat checks : 0
% 225.27/33.78 % Propositional check models : 0
% 225.27/33.78 % Propositional check unsatisfiable : 0
% 225.27/33.78 % Propositional clauses : 0
% 225.27/33.78 % Propositional clauses after purity: 0
% 225.27/33.78 % Propositional unsat core size : 0
% 225.27/33.78 % Propositional preprocessing time : 0.000
% 225.27/33.78 % Propositional encoding time : 0.000
% 225.27/33.78 % Propositional solver time : 0.000
% 225.27/33.78 % Success case prop preproc time : 0.000
% 225.27/33.78 % Success case prop encoding time : 0.000
% 225.27/33.78 % Success case prop solver time : 0.000
% 225.27/33.78 % Current number of processed clauses : 591
% 225.27/33.78 % Positive orientable unit clauses : 246
% 225.27/33.78 % Positive unorientable unit clauses: 9
% 225.27/33.78 % Negative unit clauses : 1
% 225.27/33.78 % Non-unit-clauses : 335
% 225.27/33.78 % Current number of unprocessed clauses: 26628
% 225.27/33.78 % ...number of literals in the above : 37049
% 225.27/33.78 % Current number of archived formulas : 0
% 225.27/33.78 % Current number of archived clauses : 143
% 225.27/33.78 % Clause-clause subsumption calls (NU) : 14217
% 225.27/33.78 % Rec. Clause-clause subsumption calls : 14209
% 225.27/33.78 % Non-unit clause-clause subsumptions : 2146
% 225.27/33.78 % Unit Clause-clause subsumption calls : 617
% 225.27/33.78 % Rewrite failures with RHS unbound : 490
% 225.27/33.78 % BW rewrite match attempts : 3024
% 225.27/33.78 % BW rewrite match successes : 1192
% 225.27/33.78 % Condensation attempts : 0
% 225.27/33.78 % Condensation successes : 0
% 225.27/33.78 % Termbank termtop insertions : 658029
% 225.27/33.78 % Search garbage collected termcells : 12
% 225.27/33.78
% 225.27/33.78 % -------------------------------------------------
% 225.27/33.78 % User time : 31.186 s
% 225.27/33.78 % System time : 1.055 s
% 225.27/33.78 % Total time : 32.241 s
% 225.27/33.78 % Maximum resident set size: 3592 pages
% 225.27/33.78
% 225.27/33.78 % -------------------------------------------------
% 225.27/33.78 % User time : 31.188 s
% 225.27/33.78 % System time : 1.062 s
% 225.27/33.78 % Total time : 32.249 s
% 225.27/33.78 % Maximum resident set size: 4608 pages
% 225.27/33.78 % E exiting
%------------------------------------------------------------------------------