%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT233-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 : n026.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:30 PM UTC 2026
% Result : Unsatisfiable 161.03s 24.24s
% Output : CNFRefutation 161.03s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 13
% Syntax : Number of clauses : 49 ( 45 unt; 0 nHn; 17 RR)
% Number of literals : 56 ( 55 equ; 11 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 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 : 69 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
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(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(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption1) ).
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(equation_H24,axiom,
join(meet(X1,X2),meet(X2,X3)) = join(meet(X1,X2),meet(X2,join(meet(X1,X2),meet(X3,join(X1,X2))))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',equation_H24) ).
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(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(c_0_13,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_14,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_15,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_16,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_18,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_19,hypothesis,
join(b,a) = b,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_21,hypothesis,
join(b,join(a,X1)) = join(b,X1),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_23,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_20]) ).
cnf(c_0_24,hypothesis,
join(b,complement(a)) = join(b,one),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_23,c_0_22]) ).
cnf(c_0_26,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_27,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_28,axiom,
join(meet(X1,X2),meet(X2,X3)) = join(meet(X1,X2),meet(X2,join(meet(X1,X2),meet(X3,join(X1,X2))))),
equation_H24 ).
cnf(c_0_29,hypothesis,
join(b,complement(a)) = one,
inference(rw,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_30,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_22]) ).
cnf(c_0_31,plain,
meet(X1,meet(X2,join(meet(X1,X2),X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_33,hypothesis,
join(meet(b,complement(a)),meet(complement(a),join(meet(b,complement(a)),X1))) = join(meet(b,complement(a)),meet(complement(a),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_34,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_16,c_0_31]),c_0_32]) ).
cnf(c_0_35,plain,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
inference(fof_simplification,[status(thm)],[meet_join_complement]) ).
cnf(c_0_36,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_37,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_18,c_0_13]) ).
cnf(c_0_38,hypothesis,
join(meet(b,complement(a)),meet(complement(a),X1)) = meet(complement(a),join(meet(b,complement(a)),X1)),
inference(rw,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
c_0_35 ).
cnf(c_0_40,plain,
meet(X1,meet(X2,complement(meet(X1,X2)))) = zero,
inference(spm,[status(thm)],[c_0_36,c_0_27]) ).
cnf(c_0_41,hypothesis,
join(b,meet(complement(a),join(meet(b,complement(a)),X1))) = join(b,meet(complement(a),X1)),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
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(X2,meet(X1,complement(meet(X2,X1)))) != one
| meet(X1,complement(meet(X2,X1))) = complement(X2) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,hypothesis,
join(b,meet(complement(a),complement(meet(b,complement(a))))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_22]),c_0_30]),c_0_24]),c_0_25]) ).
cnf(c_0_45,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
c_0_42 ).
cnf(c_0_46,hypothesis,
meet(complement(a),complement(meet(b,complement(a)))) = complement(b),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_45,c_0_32]) ).
cnf(c_0_48,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_46]),c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT233-1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.44 % Computer : n026.cluster.edu
% 0.18/0.44 % Model : x86_64 x86_64
% 0.18/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.44 % Memory : 8046.5625MB
% 0.18/0.44 % OS : Linux 6.8.0-71-generic
% 0.18/0.44 % CPULimit : 300
% 0.18/0.44 % WCLimit : 300
% 0.18/0.44 % DateTime : Sun Sep 20 23:24:51 UTC 2026
% 0.18/0.45 % CPUTime :
% 0.18/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.50 Running first-order theorem proving
% 0.18/0.51 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
% 161.03/24.24 % Version: 3.5.1
% 161.03/24.24 % Preprocessing class: FSSSSMSSSSSNFFN.
% 161.03/24.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 161.03/24.24 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 161.03/24.24 % Starting new_bool_3 with 300s (1) cores
% 161.03/24.24 % Starting new_bool_1 with 300s (1) cores
% 161.03/24.24 % Starting sh5l with 300s (1) cores
% 161.03/24.24 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 812021 completed with status 0
% 161.03/24.24 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 161.03/24.24 % Preprocessing class: FSSSSMSSSSSNFFN.
% 161.03/24.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 161.03/24.24 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 161.03/24.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 161.03/24.24 % No SInE strategy applied
% 161.03/24.24 % Search class: FHUPM-FFSF21-MFFFFFNN
% 161.03/24.24 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 161.03/24.24 % Starting SubtermCWHack with 136s (1) cores
% 161.03/24.24 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 161.03/24.24 % Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 161.03/24.24 % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 161.03/24.24 % Starting new_bool_3 with 136s (1) cores
% 161.03/24.24 % G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with pid 812030 completed with status 0
% 161.03/24.24 % Result found by G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S
% 161.03/24.24 % Preprocessing class: FSSSSMSSSSSNFFN.
% 161.03/24.24 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 161.03/24.24 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 161.03/24.24 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 161.03/24.24 % No SInE strategy applied
% 161.03/24.24 % Search class: FHUPM-FFSF21-MFFFFFNN
% 161.03/24.24 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 161.03/24.24 % Starting SubtermCWHack with 136s (1) cores
% 161.03/24.24 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 161.03/24.24 % Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 161.03/24.24 % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 161.03/24.24 % Preprocessing time : 0.002 s
% 161.03/24.24 % Presaturation interreduction done
% 161.03/24.24
% 161.03/24.24 % Proof found!
% 161.03/24.24 % SZS status Unsatisfiable
% 161.03/24.24 % SZS output start CNFRefutation
% See solution above
% 161.03/24.24 % Parsed axioms : 14
% 161.03/24.24 % Removed by relevancy pruning/SinE : 0
% 161.03/24.24 % Initial clauses : 14
% 161.03/24.24 % Removed in clause preprocessing : 0
% 161.03/24.24 % Initial clauses in saturation : 14
% 161.03/24.24 % Processed clauses : 33393
% 161.03/24.24 % ...of these trivial : 16828
% 161.03/24.24 % ...subsumed : 14801
% 161.03/24.24 % ...remaining for further processing : 1764
% 161.03/24.24 % Other redundant clauses eliminated : 0
% 161.03/24.24 % Clauses deleted for lack of memory : 0
% 161.03/24.24 % Backward-subsumed : 19
% 161.03/24.24 % Backward-rewritten : 231
% 161.03/24.24 % Generated clauses : 1319786
% 161.03/24.24 % ...of the previous two non-redundant : 645350
% 161.03/24.24 % ...aggressively subsumed : 0
% 161.03/24.24 % Contextual simplify-reflections : 0
% 161.03/24.24 % Paramodulations : 1319768
% 161.03/24.24 % Factorizations : 0
% 161.03/24.24 % NegExts : 0
% 161.03/24.24 % Equation resolutions : 18
% 161.03/24.24 % Disequality decompositions : 0
% 161.03/24.24 % Total rewrite steps : 6718888
% 161.03/24.24 % ...of those cached : 6094036
% 161.03/24.24 % Propositional unsat checks : 0
% 161.03/24.24 % Propositional check models : 0
% 161.03/24.24 % Propositional check unsatisfiable : 0
% 161.03/24.24 % Propositional clauses : 0
% 161.03/24.24 % Propositional clauses after purity: 0
% 161.03/24.24 % Propositional unsat core size : 0
% 161.03/24.24 % Propositional preprocessing time : 0.000
% 161.03/24.24 % Propositional encoding time : 0.000
% 161.03/24.24 % Propositional solver time : 0.000
% 161.03/24.24 % Success case prop preproc time : 0.000
% 161.03/24.24 % Success case prop encoding time : 0.000
% 161.03/24.24 % Success case prop solver time : 0.000
% 161.03/24.24 % Current number of processed clauses : 1500
% 161.03/24.24 % Positive orientable unit clauses : 1340
% 161.03/24.24 % Positive unorientable unit clauses: 10
% 161.03/24.24 % Negative unit clauses : 1
% 161.03/24.24 % Non-unit-clauses : 149
% 161.03/24.24 % Current number of unprocessed clauses: 610412
% 161.03/24.24 % ...number of literals in the above : 642773
% 161.03/24.24 % Current number of archived formulas : 0
% 161.03/24.24 % Current number of archived clauses : 264
% 161.03/24.24 % Clause-clause subsumption calls (NU) : 21562
% 161.03/24.24 % Rec. Clause-clause subsumption calls : 21562
% 161.03/24.24 % Non-unit clause-clause subsumptions : 7054
% 161.03/24.24 % Unit Clause-clause subsumption calls : 652
% 161.03/24.24 % Rewrite failures with RHS unbound : 0
% 161.03/24.24 % BW rewrite match attempts : 26718
% 161.03/24.24 % BW rewrite match successes : 2324
% 161.03/24.24 % Condensation attempts : 0
% 161.03/24.24 % Condensation successes : 0
% 161.03/24.24 % Termbank termtop insertions : 40409321
% 161.03/24.24 % Search garbage collected termcells : 8
% 161.03/24.24
% 161.03/24.24 % -------------------------------------------------
% 161.03/24.24 % User time : 21.755 s
% 161.03/24.24 % System time : 0.667 s
% 161.03/24.24 % Total time : 22.422 s
% 161.03/24.24 % Maximum resident set size: 3640 pages
% 161.03/24.24
% 161.03/24.24 % -------------------------------------------------
% 161.03/24.24 % User time : 111.096 s
% 161.03/24.24 % System time : 3.509 s
% 161.03/24.24 % Total time : 114.605 s
% 161.03/24.24 % Maximum resident set size: 4864 pages
% 161.03/24.24 % E exiting
%------------------------------------------------------------------------------