%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT089-1 : TPTP v9.3.1. Released v2.6.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:17 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 6
% Syntax : Number of clauses : 46 ( 46 unt; 0 nHn; 4 RR)
% Number of literals : 46 ( 45 equ; 3 neg)
% Maximal clause size : 1 ( 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 : 89 ( 30 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_3,axiom,
join(meet(X1,X2),meet(X2,join(X1,X2))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wal_absorbtion_3) ).
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(prove_normal_axioms_2,negated_conjecture,
meet(b,a) != meet(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_normal_axioms_2) ).
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,plain,
join(join(meet(X1,X2),X1),X1) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
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,axiom,
join(meet(X1,X2),meet(X2,join(X1,X2))) = X2,
wal_absorbtion_3 ).
cnf(c_0_14,plain,
join(join(X1,X1),X1) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
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,axiom,
join(meet(X1,X1),meet(X2,join(X1,X1))) = X1,
wal_absorbtion_2 ).
cnf(c_0_17,plain,
join(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_12]) ).
cnf(c_0_18,plain,
join(X1,meet(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_12]),c_0_17]) ).
cnf(c_0_19,plain,
join(meet(X1,meet(X2,X1)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_18]),c_0_12]) ).
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_13]) ).
cnf(c_0_21,plain,
meet(meet(X1,meet(X2,X1)),X1) = meet(X1,meet(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_19]),c_0_17]) ).
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_11,c_0_20]),c_0_18]),c_0_18]) ).
cnf(c_0_23,plain,
meet(meet(X1,X2),X2) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22]),c_0_22]) ).
cnf(c_0_24,plain,
meet(meet(X1,join(X2,meet(X1,X1))),meet(X1,X1)) = meet(X1,X1),
inference(spm,[status(thm)],[c_0_6,c_0_16]) ).
cnf(c_0_25,plain,
meet(join(X1,X2),X1) = X1,
inference(rw,[status(thm)],[c_0_8,c_0_23]) ).
cnf(c_0_26,plain,
meet(meet(X1,join(X2,X1)),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_12]),c_0_12]),c_0_12]) ).
cnf(c_0_27,plain,
meet(X1,join(meet(X1,X2),X1)) = join(meet(X1,X2),X1),
inference(spm,[status(thm)],[c_0_25,c_0_11]) ).
cnf(c_0_28,plain,
meet(join(meet(X1,X2),X1),X1) = X1,
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_29,plain,
join(meet(X1,X2),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_28]),c_0_11]),c_0_28]),c_0_17]) ).
cnf(c_0_30,plain,
meet(meet(X1,X2),X1) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_29]),c_0_17]) ).
cnf(c_0_31,plain,
join(X1,meet(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_30]) ).
cnf(c_0_32,plain,
join(join(X1,X2),X1) = join(X1,X2),
inference(spm,[status(thm)],[c_0_31,c_0_25]) ).
cnf(c_0_33,plain,
join(join(meet(X1,X2),meet(X3,X2)),X2) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_22]) ).
cnf(c_0_34,plain,
join(X1,join(meet(X2,X1),meet(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_35,plain,
join(meet(X1,X2),X2) = X2,
inference(rw,[status(thm)],[c_0_19,c_0_22]) ).
cnf(c_0_36,plain,
meet(X1,join(X2,X1)) = X1,
inference(rw,[status(thm)],[c_0_26,c_0_30]) ).
cnf(c_0_37,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_38,plain,
join(X1,join(meet(X2,X1),meet(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_34,c_0_30]) ).
cnf(c_0_39,plain,
meet(X1,join(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_30,c_0_25]) ).
cnf(c_0_40,negated_conjecture,
meet(b,a) != meet(a,b),
inference(fof_simplification,[status(thm)],[prove_normal_axioms_2]) ).
cnf(c_0_41,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
join(meet(X1,X2),meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_43,negated_conjecture,
meet(b,a) != meet(a,b),
c_0_40 ).
cnf(c_0_44,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_42]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_44])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT089-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n009.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 23:11:12 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.42 Running first-order theorem proving
% 0.15/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
% 0.15/0.44 % Version: 3.5.1
% 0.15/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 255085 completed with status 0
% 0.15/0.44 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.15/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.44 % No SInE strategy applied
% 0.15/0.44 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.15/0.44 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.44 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.15/0.44 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.44 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.15/0.44 % E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with pid 255092 completed with status 0
% 0.15/0.44 % Result found by E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S
% 0.15/0.44 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.15/0.44 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.44 % No SInE strategy applied
% 0.15/0.44 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.15/0.44 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.44 % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.44 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.15/0.44 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.15/0.44 % Preprocessing time : 0.001 s
% 0.15/0.44 % Presaturation interreduction done
% 0.15/0.44
% 0.15/0.44 % Proof found!
% 0.15/0.44 % SZS status Unsatisfiable
% 0.15/0.44 % SZS output start CNFRefutation
% See solution above
% 0.15/0.44 % Parsed axioms : 6
% 0.15/0.44 % Removed by relevancy pruning/SinE : 0
% 0.15/0.44 % Initial clauses : 6
% 0.15/0.44 % Removed in clause preprocessing : 0
% 0.15/0.44 % Initial clauses in saturation : 6
% 0.15/0.44 % Processed clauses : 110
% 0.15/0.44 % ...of these trivial : 31
% 0.15/0.44 % ...subsumed : 0
% 0.15/0.44 % ...remaining for further processing : 79
% 0.15/0.44 % Other redundant clauses eliminated : 0
% 0.15/0.44 % Clauses deleted for lack of memory : 0
% 0.15/0.44 % Backward-subsumed : 0
% 0.15/0.44 % Backward-rewritten : 42
% 0.15/0.44 % Generated clauses : 1912
% 0.15/0.44 % ...of the previous two non-redundant : 730
% 0.15/0.44 % ...aggressively subsumed : 0
% 0.15/0.44 % Contextual simplify-reflections : 0
% 0.15/0.44 % Paramodulations : 1912
% 0.15/0.44 % Factorizations : 0
% 0.15/0.44 % NegExts : 0
% 0.15/0.44 % Equation resolutions : 0
% 0.15/0.44 % Disequality decompositions : 0
% 0.15/0.44 % Total rewrite steps : 2468
% 0.15/0.44 % ...of those cached : 2228
% 0.15/0.44 % Propositional unsat checks : 0
% 0.15/0.44 % Propositional check models : 0
% 0.15/0.44 % Propositional check unsatisfiable : 0
% 0.15/0.44 % Propositional clauses : 0
% 0.15/0.44 % Propositional clauses after purity: 0
% 0.15/0.44 % Propositional unsat core size : 0
% 0.15/0.44 % Propositional preprocessing time : 0.000
% 0.15/0.44 % Propositional encoding time : 0.000
% 0.15/0.44 % Propositional solver time : 0.000
% 0.15/0.44 % Success case prop preproc time : 0.000
% 0.15/0.44 % Success case prop encoding time : 0.000
% 0.15/0.44 % Success case prop solver time : 0.000
% 0.15/0.44 % Current number of processed clauses : 31
% 0.15/0.44 % Positive orientable unit clauses : 30
% 0.15/0.44 % Positive unorientable unit clauses: 1
% 0.15/0.44 % Negative unit clauses : 0
% 0.15/0.44 % Non-unit-clauses : 0
% 0.15/0.44 % Current number of unprocessed clauses: 531
% 0.15/0.44 % ...number of literals in the above : 531
% 0.15/0.44 % Current number of archived formulas : 0
% 0.15/0.44 % Current number of archived clauses : 48
% 0.15/0.44 % Clause-clause subsumption calls (NU) : 0
% 0.15/0.44 % Rec. Clause-clause subsumption calls : 0
% 0.15/0.44 % Non-unit clause-clause subsumptions : 0
% 0.15/0.44 % Unit Clause-clause subsumption calls : 18
% 0.15/0.44 % Rewrite failures with RHS unbound : 0
% 0.15/0.44 % BW rewrite match attempts : 207
% 0.15/0.44 % BW rewrite match successes : 85
% 0.15/0.44 % Condensation attempts : 0
% 0.15/0.44 % Condensation successes : 0
% 0.15/0.44 % Termbank termtop insertions : 15235
% 0.15/0.44 % Search garbage collected termcells : 2
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.007 s
% 0.15/0.44 % System time : 0.005 s
% 0.15/0.44 % Total time : 0.012 s
% 0.15/0.44 % Maximum resident set size: 3588 pages
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.048 s
% 0.15/0.44 % System time : 0.011 s
% 0.15/0.44 % Total time : 0.059 s
% 0.15/0.44 % Maximum resident set size: 4864 pages
% 0.15/0.44 % E exiting
%------------------------------------------------------------------------------