%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT006-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 : n007.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 0.14s 5.55s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 3
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 5 RR)
% Number of literals : 25 ( 24 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 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 : 50 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',absorption) ).
cnf(distribution,axiom,
meet(X1,join(X2,X3)) = join(meet(X3,X1),meet(X2,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distribution) ).
cnf(prove_associativity_of_meet,negated_conjecture,
meet(meet(a,b),c) != meet(a,meet(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_associativity_of_meet) ).
cnf(c_0_3,axiom,
meet(X1,join(X1,X2)) = X1,
absorption ).
cnf(c_0_4,axiom,
meet(X1,join(X2,X3)) = join(meet(X3,X1),meet(X2,X1)),
distribution ).
cnf(c_0_5,plain,
meet(meet(X1,X2),meet(X2,join(X3,X1))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_3,c_0_4]) ).
cnf(c_0_6,plain,
meet(meet(X1,X2),X2) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_5,c_0_3]) ).
cnf(c_0_7,plain,
meet(X1,join(meet(X2,X1),X3)) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_6]),c_0_4]) ).
cnf(c_0_8,plain,
meet(X1,join(X2,meet(X3,X1))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_6]),c_0_4]) ).
cnf(c_0_9,plain,
meet(X1,meet(X1,join(X2,X3))) = meet(X1,join(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_4]),c_0_8]) ).
cnf(c_0_10,plain,
meet(X1,join(X2,X1)) = meet(X1,X1),
inference(spm,[status(thm)],[c_0_9,c_0_3]) ).
cnf(c_0_11,plain,
meet(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_3,c_0_10]) ).
cnf(c_0_12,plain,
join(X1,meet(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_11]),c_0_10]),c_0_11]) ).
cnf(c_0_13,plain,
join(X1,X1) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_11]) ).
cnf(c_0_14,plain,
meet(X1,X2) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_13]),c_0_13]) ).
cnf(c_0_15,plain,
join(meet(X1,X2),meet(X3,X1)) = meet(X1,join(X3,X2)),
inference(spm,[status(thm)],[c_0_4,c_0_14]) ).
cnf(c_0_16,plain,
meet(X1,meet(X2,join(X3,X1))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_15]),c_0_12]) ).
cnf(c_0_17,plain,
meet(meet(X1,X2),meet(X3,X2)) = meet(meet(X1,X2),X3),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_18,negated_conjecture,
meet(meet(a,b),c) != meet(a,meet(b,c)),
inference(fof_simplification,[status(thm)],[prove_associativity_of_meet]) ).
cnf(c_0_19,plain,
meet(meet(X1,X2),X3) = meet(meet(X3,X2),X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_17]),c_0_17]) ).
cnf(c_0_20,negated_conjecture,
meet(meet(a,b),c) != meet(a,meet(b,c)),
c_0_18 ).
cnf(c_0_21,plain,
meet(meet(X1,X2),X3) = meet(X1,meet(X3,X2)),
inference(spm,[status(thm)],[c_0_14,c_0_19]) ).
cnf(c_0_22,negated_conjecture,
meet(c,meet(a,b)) != meet(a,meet(b,c)),
inference(rw,[status(thm)],[c_0_20,c_0_14]) ).
cnf(c_0_23,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_21]),c_0_21]) ).
cnf(c_0_24,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23]),c_0_14])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT006-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/5.41 % Computer : n007.cluster.edu
% 0.10/5.41 % Model : x86_64 x86_64
% 0.10/5.41 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.41 % Memory : 8046.5625MB
% 0.10/5.41 % OS : Linux 6.8.0-71-generic
% 0.10/5.41 % CPULimit : 300
% 0.10/5.41 % WCLimit : 300
% 0.10/5.41 % DateTime : Sun Sep 20 23:02:56 UTC 2026
% 0.10/5.41 % CPUTime :
% 0.10/5.41 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/5.45 Running first-order theorem proving
% 0.10/5.45 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/5.55 % Version: 3.5.1
% 0.14/5.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/5.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/5.55 % Starting new_bool_3 with 300s (1) cores
% 0.14/5.55 % Starting new_bool_1 with 300s (1) cores
% 0.14/5.55 % Starting sh5l with 300s (1) cores
% 0.14/5.55 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3778517 completed with status 0
% 0.14/5.55 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.14/5.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/5.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/5.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.55 % No SInE strategy applied
% 0.14/5.55 % Search class: FUUPS-FFSF22-SFFFFFNN
% 0.14/5.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.55 % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/5.55 % Starting MinMin_p002000_rr with 136s (1) cores
% 0.14/5.55 % Starting new_bool_3 with 136s (1) cores
% 0.14/5.55 % Starting new_bool_1 with 136s (1) cores
% 0.14/5.55 % MinMin_p002000_rr with pid 3778525 completed with status 0
% 0.14/5.55 % Result found by MinMin_p002000_rr
% 0.14/5.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.14/5.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/5.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.14/5.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.14/5.55 % No SInE strategy applied
% 0.14/5.55 % Search class: FUUPS-FFSF22-SFFFFFNN
% 0.14/5.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.14/5.55 % Starting SubtermCWHack with 136s (1) cores
% 0.14/5.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.14/5.55 % Starting MinMin_p002000_rr with 136s (1) cores
% 0.14/5.55 % Preprocessing time : 0.001 s
% 0.14/5.55 % Presaturation interreduction done
% 0.14/5.55
% 0.14/5.55 % Proof found!
% 0.14/5.55 % SZS status Unsatisfiable
% 0.14/5.55 % SZS output start CNFRefutation
% See solution above
% 0.14/5.55 % Parsed axioms : 3
% 0.14/5.55 % Removed by relevancy pruning/SinE : 0
% 0.14/5.55 % Initial clauses : 3
% 0.14/5.55 % Removed in clause preprocessing : 0
% 0.14/5.55 % Initial clauses in saturation : 3
% 0.14/5.55 % Processed clauses : 431
% 0.14/5.55 % ...of these trivial : 173
% 0.14/5.55 % ...subsumed : 161
% 0.14/5.55 % ...remaining for further processing : 97
% 0.14/5.55 % Other redundant clauses eliminated : 0
% 0.14/5.55 % Clauses deleted for lack of memory : 0
% 0.14/5.55 % Backward-subsumed : 0
% 0.14/5.55 % Backward-rewritten : 40
% 0.14/5.55 % Generated clauses : 8375
% 0.14/5.55 % ...of the previous two non-redundant : 5234
% 0.14/5.55 % ...aggressively subsumed : 0
% 0.14/5.55 % Contextual simplify-reflections : 0
% 0.14/5.55 % Paramodulations : 8375
% 0.14/5.55 % Factorizations : 0
% 0.14/5.55 % NegExts : 0
% 0.14/5.55 % Equation resolutions : 0
% 0.14/5.55 % Disequality decompositions : 0
% 0.14/5.55 % Total rewrite steps : 6025
% 0.14/5.55 % ...of those cached : 4476
% 0.14/5.55 % Propositional unsat checks : 0
% 0.14/5.55 % Propositional check models : 0
% 0.14/5.55 % Propositional check unsatisfiable : 0
% 0.14/5.55 % Propositional clauses : 0
% 0.14/5.55 % Propositional clauses after purity: 0
% 0.14/5.55 % Propositional unsat core size : 0
% 0.14/5.55 % Propositional preprocessing time : 0.000
% 0.14/5.55 % Propositional encoding time : 0.000
% 0.14/5.55 % Propositional solver time : 0.000
% 0.14/5.55 % Success case prop preproc time : 0.000
% 0.14/5.55 % Success case prop encoding time : 0.000
% 0.14/5.55 % Success case prop solver time : 0.000
% 0.14/5.55 % Current number of processed clauses : 54
% 0.14/5.55 % Positive orientable unit clauses : 51
% 0.14/5.55 % Positive unorientable unit clauses: 3
% 0.14/5.55 % Negative unit clauses : 0
% 0.14/5.55 % Non-unit-clauses : 0
% 0.14/5.55 % Current number of unprocessed clauses: 4744
% 0.14/5.55 % ...number of literals in the above : 4744
% 0.14/5.55 % Current number of archived formulas : 0
% 0.14/5.55 % Current number of archived clauses : 43
% 0.14/5.55 % Clause-clause subsumption calls (NU) : 0
% 0.14/5.55 % Rec. Clause-clause subsumption calls : 0
% 0.14/5.55 % Non-unit clause-clause subsumptions : 0
% 0.14/5.55 % Unit Clause-clause subsumption calls : 41
% 0.14/5.55 % Rewrite failures with RHS unbound : 0
% 0.14/5.55 % BW rewrite match attempts : 396
% 0.14/5.55 % BW rewrite match successes : 179
% 0.14/5.55 % Condensation attempts : 0
% 0.14/5.55 % Condensation successes : 0
% 0.14/5.55 % Termbank termtop insertions : 70547
% 0.14/5.55 % Search garbage collected termcells : 2
% 0.14/5.55
% 0.14/5.55 % -------------------------------------------------
% 0.14/5.55 % User time : 0.076 s
% 0.14/5.55 % System time : 0.005 s
% 0.14/5.55 % Total time : 0.082 s
% 0.14/5.55 % Maximum resident set size: 3628 pages
% 0.14/5.55
% 0.14/5.55 % -------------------------------------------------
% 0.14/5.55 % User time : 0.323 s
% 0.14/5.55 % System time : 0.030 s
% 0.14/5.55 % Total time : 0.353 s
% 0.14/5.55 % Maximum resident set size: 4608 pages
% 0.14/5.55 % E exiting
%------------------------------------------------------------------------------