%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT007-1 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n006.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:01 PM UTC 2026
% Result : Unsatisfiable 1.69s 0.76s
% Output : CNFRefutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 3
% Syntax : Number of clauses : 44 ( 44 unt; 0 nHn; 6 RR)
% Number of literals : 44 ( 43 equ; 5 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 93 ( 12 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(distribution,axiom,
meet(X1,join(X2,X3)) = join(meet(X3,X1),meet(X2,X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',distribution) ).
cnf(absorption,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',absorption) ).
cnf(prove_associativity_of_join,negated_conjecture,
join(join(a,b),c) != join(a,join(b,c)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_associativity_of_join) ).
cnf(c_0_3,axiom,
meet(X1,join(X2,X3)) = join(meet(X3,X1),meet(X2,X1)),
distribution ).
cnf(c_0_4,axiom,
meet(X1,join(X1,X2)) = X1,
absorption ).
cnf(c_0_5,plain,
meet(join(X1,X2),join(X3,X1)) = join(X1,meet(X3,join(X1,X2))),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
meet(join(X1,X2),join(X1,X3)) = join(meet(X3,join(X1,X2)),X1),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_7,plain,
join(X1,join(meet(X2,join(X1,X2)),X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
cnf(c_0_8,plain,
join(X1,join(X1,X1)) = join(X1,X1),
inference(spm,[status(thm)],[c_0_7,c_0_4]) ).
cnf(c_0_9,plain,
join(join(meet(X1,join(X2,X2)),X2),X2) = join(X2,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_8]),c_0_6]),c_0_4]),c_0_6]) ).
cnf(c_0_10,plain,
join(join(X1,X1),X1) = join(X1,X1),
inference(spm,[status(thm)],[c_0_9,c_0_4]) ).
cnf(c_0_11,plain,
join(join(X1,X1),join(X1,X1)) = join(X1,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_10]),c_0_4]),c_0_8]) ).
cnf(c_0_12,plain,
meet(meet(X1,X2),meet(X2,join(X3,X1))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_4,c_0_3]) ).
cnf(c_0_13,plain,
meet(join(X1,X1),join(X2,X2)) = meet(X2,join(X1,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_3]),c_0_3]) ).
cnf(c_0_14,plain,
meet(meet(X1,X2),X2) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_4]) ).
cnf(c_0_15,plain,
join(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_13]),c_0_4]),c_0_4]) ).
cnf(c_0_16,plain,
meet(X1,join(meet(X2,X1),X3)) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_14]),c_0_3]) ).
cnf(c_0_17,plain,
join(meet(X1,X2),X2) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_15]),c_0_4]) ).
cnf(c_0_18,plain,
meet(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_4,c_0_15]) ).
cnf(c_0_19,plain,
meet(X1,join(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]) ).
cnf(c_0_20,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_4]) ).
cnf(c_0_21,plain,
join(join(meet(X1,join(X2,X3)),X2),meet(X4,join(X2,X1))) = meet(join(X2,X1),join(X4,join(X2,X3))),
inference(spm,[status(thm)],[c_0_3,c_0_6]) ).
cnf(c_0_22,plain,
join(X1,X2) = join(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_6]),c_0_19]) ).
cnf(c_0_23,plain,
join(join(X1,meet(X2,join(X1,X3))),meet(X4,join(X1,X2))) = meet(join(X1,X2),join(X4,join(X1,X3))),
inference(rw,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_24,plain,
join(X1,meet(X2,X1)) = X1,
inference(rw,[status(thm)],[c_0_17,c_0_22]) ).
cnf(c_0_25,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_15]),c_0_15]),c_0_15]) ).
cnf(c_0_26,plain,
meet(join(X1,X2),join(X2,X3)) = join(X2,meet(X3,join(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_19]),c_0_22]) ).
cnf(c_0_27,plain,
meet(X1,join(X2,join(X1,X3))) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_15]),c_0_4]),c_0_15]),c_0_24]) ).
cnf(c_0_28,plain,
join(X1,meet(X2,join(X3,X1))) = join(X1,meet(X3,join(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_25]),c_0_26]) ).
cnf(c_0_29,plain,
meet(X1,join(join(X1,X2),X3)) = X1,
inference(spm,[status(thm)],[c_0_27,c_0_22]) ).
cnf(c_0_30,plain,
join(X1,join(X2,meet(X1,join(X2,X3)))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_5]),c_0_29]) ).
cnf(c_0_31,plain,
join(join(X1,X2),join(X3,X1)) = join(join(X1,X2),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_5]),c_0_30]) ).
cnf(c_0_32,plain,
join(join(X1,X2),join(X1,X3)) = join(join(X1,X2),X3),
inference(spm,[status(thm)],[c_0_31,c_0_22]) ).
cnf(c_0_33,negated_conjecture,
join(join(a,b),c) != join(a,join(b,c)),
inference(fof_simplification,[status(thm)],[prove_associativity_of_join]) ).
cnf(c_0_34,plain,
join(join(X1,X2),X3) = join(join(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_32]),c_0_32]) ).
cnf(c_0_35,negated_conjecture,
join(join(a,b),c) != join(a,join(b,c)),
c_0_33 ).
cnf(c_0_36,plain,
join(join(X1,X2),X3) = join(X2,join(X1,X3)),
inference(spm,[status(thm)],[c_0_22,c_0_34]) ).
cnf(c_0_37,negated_conjecture,
join(c,join(a,b)) != join(a,join(b,c)),
inference(rw,[status(thm)],[c_0_35,c_0_22]) ).
cnf(c_0_38,plain,
join(X1,join(X2,X3)) = join(X3,join(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_36]),c_0_36]) ).
cnf(c_0_39,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_40,plain,
join(join(X1,X2),join(X2,X3)) = join(join(X2,X3),X1),
inference(spm,[status(thm)],[c_0_22,c_0_31]) ).
cnf(c_0_41,negated_conjecture,
join(b,join(a,c)) != join(a,join(b,c)),
inference(rw,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_42,plain,
join(X1,join(X2,X3)) = join(X3,join(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_39]),c_0_36]),c_0_40]),c_0_36]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT007-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n006.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:04:29 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 1.69/0.76 % Version: 3.5.1
% 1.69/0.76 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.69/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.69/0.76 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.69/0.76 % Starting new_bool_3 with 300s (1) cores
% 1.69/0.76 % Starting new_bool_1 with 300s (1) cores
% 1.69/0.76 % Starting sh5l with 300s (1) cores
% 1.69/0.76 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1448156 completed with status 0
% 1.69/0.76 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.69/0.76 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.69/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.69/0.76 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.69/0.76 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.69/0.76 % No SInE strategy applied
% 1.69/0.76 % Search class: FUUPS-FFSF22-SFFFFFNN
% 1.69/0.76 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.69/0.76 % Starting SubtermCWHack with 136s (1) cores
% 1.69/0.76 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.69/0.76 % Starting MinMin_p002000_rr with 136s (1) cores
% 1.69/0.76 % Starting new_bool_3 with 136s (1) cores
% 1.69/0.76 % Starting new_bool_1 with 136s (1) cores
% 1.69/0.76 % MinMin_p002000_rr with pid 1448163 completed with status 0
% 1.69/0.76 % Result found by MinMin_p002000_rr
% 1.69/0.76 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.69/0.76 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.69/0.76 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.69/0.76 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.69/0.76 % No SInE strategy applied
% 1.69/0.76 % Search class: FUUPS-FFSF22-SFFFFFNN
% 1.69/0.76 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.69/0.76 % Starting SubtermCWHack with 136s (1) cores
% 1.69/0.76 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.69/0.76 % Starting MinMin_p002000_rr with 136s (1) cores
% 1.69/0.76 % Preprocessing time : 0.001 s
% 1.69/0.76 % Presaturation interreduction done
% 1.69/0.76
% 1.69/0.76 % Proof found!
% 1.69/0.76 % SZS status Unsatisfiable
% 1.69/0.76 % SZS output start CNFRefutation
% See solution above
% 1.69/0.76 % Parsed axioms : 3
% 1.69/0.76 % Removed by relevancy pruning/SinE : 0
% 1.69/0.76 % Initial clauses : 3
% 1.69/0.76 % Removed in clause preprocessing : 0
% 1.69/0.76 % Initial clauses in saturation : 3
% 1.69/0.76 % Processed clauses : 587
% 1.69/0.76 % ...of these trivial : 307
% 1.69/0.76 % ...subsumed : 142
% 1.69/0.76 % ...remaining for further processing : 138
% 1.69/0.76 % Other redundant clauses eliminated : 0
% 1.69/0.76 % Clauses deleted for lack of memory : 0
% 1.69/0.76 % Backward-subsumed : 0
% 1.69/0.76 % Backward-rewritten : 49
% 1.69/0.76 % Generated clauses : 15437
% 1.69/0.76 % ...of the previous two non-redundant : 9831
% 1.69/0.76 % ...aggressively subsumed : 0
% 1.69/0.76 % Contextual simplify-reflections : 0
% 1.69/0.76 % Paramodulations : 15437
% 1.69/0.76 % Factorizations : 0
% 1.69/0.76 % NegExts : 0
% 1.69/0.76 % Equation resolutions : 0
% 1.69/0.76 % Disequality decompositions : 0
% 1.69/0.76 % Total rewrite steps : 13019
% 1.69/0.76 % ...of those cached : 9840
% 1.69/0.76 % Propositional unsat checks : 0
% 1.69/0.76 % Propositional check models : 0
% 1.69/0.76 % Propositional check unsatisfiable : 0
% 1.69/0.76 % Propositional clauses : 0
% 1.69/0.76 % Propositional clauses after purity: 0
% 1.69/0.76 % Propositional unsat core size : 0
% 1.69/0.76 % Propositional preprocessing time : 0.000
% 1.69/0.76 % Propositional encoding time : 0.000
% 1.69/0.76 % Propositional solver time : 0.000
% 1.69/0.76 % Success case prop preproc time : 0.000
% 1.69/0.76 % Success case prop encoding time : 0.000
% 1.69/0.76 % Success case prop solver time : 0.000
% 1.69/0.76 % Current number of processed clauses : 86
% 1.69/0.76 % Positive orientable unit clauses : 81
% 1.69/0.76 % Positive unorientable unit clauses: 5
% 1.69/0.76 % Negative unit clauses : 0
% 1.69/0.76 % Non-unit-clauses : 0
% 1.69/0.76 % Current number of unprocessed clauses: 9071
% 1.69/0.76 % ...number of literals in the above : 9071
% 1.69/0.76 % Current number of archived formulas : 0
% 1.69/0.76 % Current number of archived clauses : 52
% 1.69/0.76 % Clause-clause subsumption calls (NU) : 0
% 1.69/0.76 % Rec. Clause-clause subsumption calls : 0
% 1.69/0.76 % Non-unit clause-clause subsumptions : 0
% 1.69/0.76 % Unit Clause-clause subsumption calls : 106
% 1.69/0.76 % Rewrite failures with RHS unbound : 0
% 1.69/0.76 % BW rewrite match attempts : 604
% 1.69/0.76 % BW rewrite match successes : 245
% 1.69/0.76 % Condensation attempts : 0
% 1.69/0.76 % Condensation successes : 0
% 1.69/0.76 % Termbank termtop insertions : 145725
% 1.69/0.76 % Search garbage collected termcells : 2
% 1.69/0.76
% 1.69/0.76 % -------------------------------------------------
% 1.69/0.76 % User time : 0.146 s
% 1.69/0.76 % System time : 0.012 s
% 1.69/0.76 % Total time : 0.158 s
% 1.69/0.76 % Maximum resident set size: 3628 pages
% 1.69/0.76
% 1.69/0.76 % -------------------------------------------------
% 1.69/0.76 % User time : 1.014 s
% 1.69/0.76 % System time : 0.081 s
% 1.69/0.76 % Total time : 1.095 s
% 1.69/0.76 % Maximum resident set size: 4608 pages
% 1.69/0.76 % E exiting
%------------------------------------------------------------------------------