%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT029-1 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n004.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:05 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.85s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 24
% Number of leaves : 6
% Syntax : Number of clauses : 58 ( 54 unt; 0 nHn; 6 RR)
% Number of literals : 68 ( 67 equ; 15 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 113 ( 39 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wal_absorbtion_4,axiom,
meet(meet(join(X1,X2),join(X3,X1)),X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wal_absorbtion_4) ).
cnf(wal_absorbtion_5,axiom,
join(join(meet(X1,X2),meet(X3,X1)),X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wal_absorbtion_5) ).
cnf(wal_absorbtion_1,axiom,
join(meet(X1,X2),meet(X1,join(X1,X2))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wal_absorbtion_1) ).
cnf(wal_absorbtion_2,axiom,
join(meet(X1,X1),meet(X2,join(X1,X1))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wal_absorbtion_2) ).
cnf(wal_absorbtion_3,axiom,
join(meet(X1,X2),meet(X2,join(X1,X2))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wal_absorbtion_3) ).
cnf(prove_normal_axioms,negated_conjecture,
( join(b,a) != join(a,b)
| join(a,a) != a
| meet(b,a) != meet(a,b)
| meet(a,a) != a ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_normal_axioms) ).
cnf(c_0_6,axiom,
meet(meet(join(X1,X2),join(X3,X1)),X1) = X1,
wal_absorbtion_4 ).
cnf(c_0_7,axiom,
join(join(meet(X1,X2),meet(X3,X1)),X1) = X1,
wal_absorbtion_5 ).
cnf(c_0_8,plain,
meet(meet(join(X1,X2),X1),X1) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_9,axiom,
join(meet(X1,X2),meet(X1,join(X1,X2))) = X1,
wal_absorbtion_1 ).
cnf(c_0_10,plain,
meet(meet(X1,meet(X1,X2)),meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_11,axiom,
join(meet(X1,X1),meet(X2,join(X1,X1))) = X1,
wal_absorbtion_2 ).
cnf(c_0_12,plain,
meet(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_6]),c_0_6]) ).
cnf(c_0_13,plain,
join(meet(X1,X1),join(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_6]) ).
cnf(c_0_14,plain,
join(join(meet(X1,X2),X1),X1) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_15,plain,
meet(join(X1,X1),X1) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_12]) ).
cnf(c_0_16,plain,
join(X1,join(X1,X1)) = X1,
inference(rw,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_17,plain,
join(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]),c_0_16]) ).
cnf(c_0_18,axiom,
join(meet(X1,X2),meet(X2,join(X1,X2))) = X2,
wal_absorbtion_3 ).
cnf(c_0_19,plain,
join(X1,meet(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_12]),c_0_17]) ).
cnf(c_0_20,plain,
meet(meet(X1,meet(X2,X1)),meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_8,c_0_18]) ).
cnf(c_0_21,plain,
join(meet(X1,meet(X2,X1)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_19]),c_0_12]) ).
cnf(c_0_22,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_19]),c_0_19]) ).
cnf(c_0_23,plain,
join(X1,meet(X1,join(meet(join(X1,X2),X1),X1))) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_8]) ).
cnf(c_0_24,plain,
join(meet(X1,X2),X2) = X2,
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
meet(meet(X1,join(X2,X1)),X1) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_23]) ).
cnf(c_0_26,plain,
meet(meet(X1,X2),X2) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_24]),c_0_17]) ).
cnf(c_0_27,plain,
join(meet(meet(X1,X2),meet(X1,join(X1,X2))),meet(meet(X1,X2),X1)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_9]) ).
cnf(c_0_28,plain,
join(X1,meet(X1,join(meet(X1,join(X2,X1)),X1))) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_25]) ).
cnf(c_0_29,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(rw,[status(thm)],[c_0_10,c_0_26]) ).
cnf(c_0_30,plain,
meet(X1,join(meet(X1,join(X2,X1)),X1)) = X1,
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_27,c_0_28]),c_0_29]),c_0_12]),c_0_25]),c_0_29]),c_0_25]),c_0_17]),c_0_29]) ).
cnf(c_0_31,plain,
join(meet(X1,join(X2,X1)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_30]),c_0_14]) ).
cnf(c_0_32,plain,
meet(X1,join(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_31]),c_0_25]),c_0_25]),c_0_17]) ).
cnf(c_0_33,plain,
join(join(X1,X2),X2) = join(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_32]) ).
cnf(c_0_34,plain,
join(meet(X1,X2),X1) = X1,
inference(rw,[status(thm)],[c_0_14,c_0_33]) ).
cnf(c_0_35,plain,
meet(meet(X1,X2),X1) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_34]),c_0_17]) ).
cnf(c_0_36,plain,
join(X1,meet(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_35]) ).
cnf(c_0_37,plain,
meet(join(X1,X2),X1) = X1,
inference(rw,[status(thm)],[c_0_8,c_0_26]) ).
cnf(c_0_38,plain,
join(join(meet(X1,X2),meet(X3,X2)),X2) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_22]) ).
cnf(c_0_39,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_24,c_0_32]) ).
cnf(c_0_40,plain,
join(join(X1,X2),X1) = join(X1,X2),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_41,plain,
join(join(meet(X1,X2),meet(X2,X3)),X2) = X2,
inference(spm,[status(thm)],[c_0_38,c_0_35]) ).
cnf(c_0_42,plain,
meet(meet(join(X1,X2),join(X3,X2)),X2) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( join(b,a) != join(a,b)
| join(a,a) != a
| meet(b,a) != meet(a,b)
| meet(a,a) != a ),
inference(fof_simplification,[status(thm)],[prove_normal_axioms]) ).
cnf(c_0_44,plain,
meet(meet(X1,join(X2,join(meet(X1,X3),meet(X4,X1)))),join(meet(X1,X3),meet(X4,X1))) = join(meet(X1,X3),meet(X4,X1)),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_45,plain,
join(X1,join(meet(X2,X1),meet(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,plain,
meet(X1,join(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_35,c_0_37]) ).
cnf(c_0_47,plain,
meet(X1,meet(join(X2,X1),join(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_35,c_0_42]) ).
cnf(c_0_48,negated_conjecture,
( join(b,a) != join(a,b)
| join(a,a) != a
| meet(b,a) != meet(a,b)
| meet(a,a) != a ),
c_0_43 ).
cnf(c_0_49,plain,
join(meet(X1,X2),meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).
cnf(c_0_50,plain,
join(join(X1,meet(X2,meet(join(X1,X3),join(X4,X1)))),meet(join(X1,X3),join(X4,X1))) = meet(join(X1,X3),join(X4,X1)),
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_51,plain,
meet(X1,meet(join(X2,X1),join(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_47,c_0_40]) ).
cnf(c_0_52,negated_conjecture,
( join(b,a) != join(a,b)
| meet(b,a) != meet(a,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_12])]),c_0_17])]) ).
cnf(c_0_53,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_49]),c_0_49]) ).
cnf(c_0_54,plain,
meet(join(X1,X2),join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_36]) ).
cnf(c_0_55,negated_conjecture,
join(b,a) != join(a,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53])]) ).
cnf(c_0_56,plain,
join(X1,X2) = join(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_54]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.44 % Problem : LAT029-1 : TPTP v9.3.1. Released v2.2.0.
% 0.02/0.46 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.77 % Computer : n004.cluster.edu
% 0.11/0.77 % Model : x86_64 x86_64
% 0.11/0.77 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.77 % Memory : 8046.5625MB
% 0.11/0.77 % OS : Linux 6.8.0-71-generic
% 0.11/0.77 % CPULimit : 300
% 0.11/0.77 % WCLimit : 300
% 0.11/0.77 % DateTime : Sun Sep 20 23:07:24 UTC 2026
% 0.11/0.78 % CPUTime :
% 0.11/0.78 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.14/0.82 Running first-order theorem proving
% 0.14/0.82 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.14/0.85 % Version: 3.5.1
% 0.14/0.85 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.85 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.85 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.85 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.85 % Starting sh5l with 300s (1) cores
% 0.14/0.85 % sh5l with pid 1688915 completed with status 0
% 0.14/0.85 % Result found by sh5l
% 0.14/0.85 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.85 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.85 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.85 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.85 % Starting sh5l with 300s (1) cores
% 0.14/0.85 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.85 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.85 % Search class: FUHPM-FFSF22-MFFFFFNN
% 0.14/0.85 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.85 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.85 % SubtermCWHack with pid 1688917 completed with status 0
% 0.14/0.85 % Result found by SubtermCWHack
% 0.14/0.85 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.85 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.85 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.85 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.85 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.85 % Starting sh5l with 300s (1) cores
% 0.14/0.85 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.14/0.85 % SinE strategy is gf500_gu_R04_F100_L20000
% 0.14/0.85 % Search class: FUHPM-FFSF22-MFFFFFNN
% 0.14/0.85 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.85 % Starting SubtermCWHack with 31s (1) cores
% 0.14/0.85 % Preprocessing time : 0.001 s
% 0.14/0.85
% 0.14/0.85 % Proof found!
% 0.14/0.85 % SZS status Unsatisfiable
% 0.14/0.85 % SZS output start CNFRefutation
% See solution above
% 0.14/0.85 % Parsed axioms : 6
% 0.14/0.85 % Removed by relevancy pruning/SinE : 0
% 0.14/0.85 % Initial clauses : 6
% 0.14/0.85 % Removed in clause preprocessing : 0
% 0.14/0.85 % Initial clauses in saturation : 6
% 0.14/0.85 % Processed clauses : 112
% 0.14/0.85 % ...of these trivial : 38
% 0.14/0.85 % ...subsumed : 0
% 0.14/0.85 % ...remaining for further processing : 74
% 0.14/0.85 % Other redundant clauses eliminated : 0
% 0.14/0.85 % Clauses deleted for lack of memory : 0
% 0.14/0.85 % Backward-subsumed : 0
% 0.14/0.85 % Backward-rewritten : 52
% 0.14/0.85 % Generated clauses : 2088
% 0.14/0.85 % ...of the previous two non-redundant : 812
% 0.14/0.85 % ...aggressively subsumed : 0
% 0.14/0.85 % Contextual simplify-reflections : 0
% 0.14/0.85 % Paramodulations : 2088
% 0.14/0.85 % Factorizations : 0
% 0.14/0.85 % NegExts : 0
% 0.14/0.85 % Equation resolutions : 0
% 0.14/0.85 % Disequality decompositions : 0
% 0.14/0.85 % Total rewrite steps : 2997
% 0.14/0.85 % ...of those cached : 2663
% 0.14/0.85 % Propositional unsat checks : 0
% 0.14/0.85 % Propositional check models : 0
% 0.14/0.85 % Propositional check unsatisfiable : 0
% 0.14/0.85 % Propositional clauses : 0
% 0.14/0.85 % Propositional clauses after purity: 0
% 0.14/0.85 % Propositional unsat core size : 0
% 0.14/0.85 % Propositional preprocessing time : 0.000
% 0.14/0.85 % Propositional encoding time : 0.000
% 0.14/0.85 % Propositional solver time : 0.000
% 0.14/0.85 % Success case prop preproc time : 0.000
% 0.14/0.85 % Success case prop encoding time : 0.000
% 0.14/0.85 % Success case prop solver time : 0.000
% 0.14/0.85 % Current number of processed clauses : 22
% 0.14/0.85 % Positive orientable unit clauses : 20
% 0.14/0.85 % Positive unorientable unit clauses: 2
% 0.14/0.85 % Negative unit clauses : 0
% 0.14/0.85 % Non-unit-clauses : 0
% 0.14/0.85 % Current number of unprocessed clauses: 397
% 0.14/0.85 % ...number of literals in the above : 397
% 0.14/0.85 % Current number of archived formulas : 0
% 0.14/0.85 % Current number of archived clauses : 52
% 0.14/0.85 % Clause-clause subsumption calls (NU) : 0
% 0.14/0.85 % Rec. Clause-clause subsumption calls : 0
% 0.14/0.85 % Non-unit clause-clause subsumptions : 0
% 0.14/0.85 % Unit Clause-clause subsumption calls : 27
% 0.14/0.85 % Rewrite failures with RHS unbound : 0
% 0.14/0.85 % BW rewrite match attempts : 317
% 0.14/0.85 % BW rewrite match successes : 159
% 0.14/0.85 % Condensation attempts : 0
% 0.14/0.85 % Condensation successes : 0
% 0.14/0.85 % Termbank termtop insertions : 16749
% 0.14/0.85 % Search garbage collected termcells : 11
% 0.14/0.85
% 0.14/0.85 % -------------------------------------------------
% 0.14/0.85 % User time : 0.016 s
% 0.14/0.85 % System time : 0.003 s
% 0.14/0.85 % Total time : 0.019 s
% 0.14/0.85 % Maximum resident set size: 3632 pages
% 0.14/0.85
% 0.14/0.85 % -------------------------------------------------
% 0.14/0.85 % User time : 0.016 s
% 0.14/0.85 % System time : 0.009 s
% 0.14/0.85 % Total time : 0.025 s
% 0.14/0.85 % Maximum resident set size: 4608 pages
% 0.14/0.85 % E exiting
%------------------------------------------------------------------------------