%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LAT089-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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:05:34 PM UTC 2026
% Result : Unsatisfiable 0.14s 0.43s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 6
% Syntax : Number of clauses : 50 ( 50 unt; 0 nHn; 4 RR)
% Number of literals : 50 ( 49 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 : 97 ( 32 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wal_absorbtion_4,axiom,
meet(meet(join(X1,X2),join(X3,X1)),X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wal_absorbtion_4) ).
cnf(wal_absorbtion_5,axiom,
join(join(meet(X1,X2),meet(X3,X1)),X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wal_absorbtion_5) ).
cnf(wal_absorbtion_1,axiom,
join(meet(X1,X2),meet(X1,join(X1,X2))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wal_absorbtion_1) ).
cnf(wal_absorbtion_2,axiom,
join(meet(X1,X1),meet(X2,join(X1,X1))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wal_absorbtion_2) ).
cnf(wal_absorbtion_3,axiom,
join(meet(X1,X2),meet(X2,join(X1,X2))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',wal_absorbtion_3) ).
cnf(prove_normal_axioms_2,negated_conjecture,
meet(b,a) != meet(a,b),
file('/export/starexec/sandbox/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,axiom,
join(meet(X1,X1),meet(X2,join(X1,X1))) = X1,
wal_absorbtion_2 ).
cnf(c_0_11,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_12,axiom,
join(meet(X1,X2),meet(X2,join(X1,X2))) = X2,
wal_absorbtion_3 ).
cnf(c_0_13,plain,
join(meet(X1,X1),join(X1,X1)) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_6]) ).
cnf(c_0_14,plain,
meet(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_6]),c_0_6]) ).
cnf(c_0_15,plain,
join(X1,meet(X1,join(meet(join(X1,X2),X1),X1))) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_8]) ).
cnf(c_0_16,plain,
join(meet(meet(X1,X2),meet(X1,join(X1,X2))),meet(meet(X1,join(X1,X2)),X1)) = meet(X1,join(X1,X2)),
inference(spm,[status(thm)],[c_0_12,c_0_9]) ).
cnf(c_0_17,plain,
join(X1,join(X1,X1)) = X1,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
meet(meet(X1,join(X2,X1)),X1) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_15]) ).
cnf(c_0_19,plain,
join(X1,X1) = X1,
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_16,c_0_17]),c_0_14]),c_0_18]),c_0_14]),c_0_14]),c_0_14]) ).
cnf(c_0_20,plain,
join(join(meet(X1,X2),X1),X1) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_21,plain,
meet(meet(X1,meet(X2,X1)),meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_8,c_0_12]) ).
cnf(c_0_22,plain,
join(X1,meet(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_14]),c_0_19]) ).
cnf(c_0_23,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_24,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]),c_0_22]) ).
cnf(c_0_25,plain,
meet(meet(X1,X2),X2) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_22]),c_0_14]),c_0_19]) ).
cnf(c_0_26,plain,
join(X1,meet(X1,join(meet(X1,join(X2,X1)),X1))) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_27,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(rw,[status(thm)],[c_0_11,c_0_25]) ).
cnf(c_0_28,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_23,c_0_26]),c_0_27]),c_0_14]),c_0_18]),c_0_27]),c_0_18]),c_0_19]),c_0_27]) ).
cnf(c_0_29,plain,
join(meet(X1,join(X2,X1)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_28]),c_0_20]) ).
cnf(c_0_30,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_29]),c_0_18]),c_0_18]),c_0_19]) ).
cnf(c_0_31,plain,
join(join(X1,X2),X2) = join(X1,X2),
inference(spm,[status(thm)],[c_0_22,c_0_30]) ).
cnf(c_0_32,plain,
join(meet(X1,X2),X1) = X1,
inference(rw,[status(thm)],[c_0_20,c_0_31]) ).
cnf(c_0_33,plain,
meet(meet(X1,X2),X1) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_32]),c_0_19]) ).
cnf(c_0_34,plain,
join(X1,meet(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_22,c_0_33]) ).
cnf(c_0_35,plain,
meet(join(X1,X2),X1) = X1,
inference(rw,[status(thm)],[c_0_8,c_0_25]) ).
cnf(c_0_36,plain,
join(join(meet(X1,X2),meet(X3,X2)),X2) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_24]) ).
cnf(c_0_37,plain,
join(meet(X1,meet(X2,X1)),X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_22]),c_0_14]) ).
cnf(c_0_38,plain,
join(join(X1,X2),X1) = join(X1,X2),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
join(join(meet(X1,X2),meet(X2,X3)),X2) = X2,
inference(spm,[status(thm)],[c_0_36,c_0_33]) ).
cnf(c_0_40,plain,
join(meet(X1,X2),X2) = X2,
inference(rw,[status(thm)],[c_0_37,c_0_24]) ).
cnf(c_0_41,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_42,plain,
join(X1,join(meet(X2,X1),meet(X1,X3))) = X1,
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,plain,
meet(X1,join(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_33,c_0_35]) ).
cnf(c_0_44,negated_conjecture,
meet(b,a) != meet(a,b),
inference(fof_simplification,[status(thm)],[prove_normal_axioms_2]) ).
cnf(c_0_45,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_40,c_0_30]) ).
cnf(c_0_46,plain,
join(meet(X1,X2),meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_47,negated_conjecture,
meet(b,a) != meet(a,b),
c_0_44 ).
cnf(c_0_48,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_46]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]),
[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/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n009.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Sun Sep 20 23:11:12 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.41 Running first-order theorem proving
% 0.14/0.41 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.14/0.43 % Version: 3.5.1
% 0.14/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % Starting sh5l with 300s (1) cores
% 0.14/0.43 % new_bool_1 with pid 255056 completed with status 0
% 0.14/0.43 % Result found by new_bool_1
% 0.14/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.14/0.43 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.43 % SubtermCWHack with pid 255062 completed with status 0
% 0.14/0.43 % Result found by SubtermCWHack
% 0.14/0.43 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/0.43 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.43 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/0.43 % Starting new_bool_3 with 300s (1) cores
% 0.14/0.43 % Starting new_bool_1 with 300s (1) cores
% 0.14/0.43 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.14/0.43 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.14/0.43 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.14/0.43 % Scheduled 10 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.43 % Starting SubtermCWHack with 28s (1) cores
% 0.14/0.43 % Preprocessing time : 0.001 s
% 0.14/0.43
% 0.14/0.43 % Proof found!
% 0.14/0.43 % SZS status Unsatisfiable
% 0.14/0.43 % SZS output start CNFRefutation
% See solution above
% 0.14/0.43 % Parsed axioms : 6
% 0.14/0.43 % Removed by relevancy pruning/SinE : 0
% 0.14/0.43 % Initial clauses : 6
% 0.14/0.43 % Removed in clause preprocessing : 0
% 0.14/0.43 % Initial clauses in saturation : 6
% 0.14/0.43 % Processed clauses : 102
% 0.14/0.43 % ...of these trivial : 34
% 0.14/0.43 % ...subsumed : 0
% 0.14/0.43 % ...remaining for further processing : 68
% 0.14/0.43 % Other redundant clauses eliminated : 0
% 0.14/0.43 % Clauses deleted for lack of memory : 0
% 0.14/0.43 % Backward-subsumed : 0
% 0.14/0.43 % Backward-rewritten : 39
% 0.14/0.43 % Generated clauses : 1888
% 0.14/0.43 % ...of the previous two non-redundant : 785
% 0.14/0.43 % ...aggressively subsumed : 0
% 0.14/0.43 % Contextual simplify-reflections : 0
% 0.14/0.43 % Paramodulations : 1888
% 0.14/0.43 % Factorizations : 0
% 0.14/0.43 % NegExts : 0
% 0.14/0.43 % Equation resolutions : 0
% 0.14/0.43 % Disequality decompositions : 0
% 0.14/0.43 % Total rewrite steps : 2566
% 0.14/0.43 % ...of those cached : 2300
% 0.14/0.43 % Propositional unsat checks : 0
% 0.14/0.43 % Propositional check models : 0
% 0.14/0.43 % Propositional check unsatisfiable : 0
% 0.14/0.43 % Propositional clauses : 0
% 0.14/0.43 % Propositional clauses after purity: 0
% 0.14/0.43 % Propositional unsat core size : 0
% 0.14/0.43 % Propositional preprocessing time : 0.000
% 0.14/0.43 % Propositional encoding time : 0.000
% 0.14/0.43 % Propositional solver time : 0.000
% 0.14/0.43 % Success case prop preproc time : 0.000
% 0.14/0.43 % Success case prop encoding time : 0.000
% 0.14/0.43 % Success case prop solver time : 0.000
% 0.14/0.43 % Current number of processed clauses : 29
% 0.14/0.43 % Positive orientable unit clauses : 28
% 0.14/0.43 % Positive unorientable unit clauses: 1
% 0.14/0.43 % Negative unit clauses : 0
% 0.14/0.43 % Non-unit-clauses : 0
% 0.14/0.43 % Current number of unprocessed clauses: 620
% 0.14/0.43 % ...number of literals in the above : 620
% 0.14/0.43 % Current number of archived formulas : 0
% 0.14/0.43 % Current number of archived clauses : 39
% 0.14/0.43 % Clause-clause subsumption calls (NU) : 0
% 0.14/0.43 % Rec. Clause-clause subsumption calls : 0
% 0.14/0.43 % Non-unit clause-clause subsumptions : 0
% 0.14/0.43 % Unit Clause-clause subsumption calls : 16
% 0.14/0.43 % Rewrite failures with RHS unbound : 0
% 0.14/0.43 % BW rewrite match attempts : 243
% 0.14/0.43 % BW rewrite match successes : 89
% 0.14/0.43 % Condensation attempts : 0
% 0.14/0.43 % Condensation successes : 0
% 0.14/0.43 % Termbank termtop insertions : 15899
% 0.14/0.43 % Search garbage collected termcells : 2
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.011 s
% 0.14/0.43 % System time : 0.000 s
% 0.14/0.43 % Total time : 0.011 s
% 0.14/0.43 % Maximum resident set size: 3632 pages
% 0.14/0.43
% 0.14/0.43 % -------------------------------------------------
% 0.14/0.43 % User time : 0.012 s
% 0.14/0.43 % System time : 0.004 s
% 0.14/0.43 % Total time : 0.016 s
% 0.14/0.43 % Maximum resident set size: 4864 pages
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------