%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT092-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 : n012.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.08s 0.45s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 2
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 4 RR)
% Number of literals : 22 ( 21 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 13 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 1 con; 0-2 aty)
% Number of variables : 68 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)),meet(join(meet(X2,meet(meet(join(X2,X4),join(X5,X2)),X2)),meet(X6,join(X2,meet(meet(join(X2,X4),join(X5,X2)),X2)))),join(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_wal_axioms_1,negated_conjecture,
meet(a,a) != a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_wal_axioms_1) ).
cnf(c_0_2,axiom,
join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)),meet(join(meet(X2,meet(meet(join(X2,X4),join(X5,X2)),X2)),meet(X6,join(X2,meet(meet(join(X2,X4),join(X5,X2)),X2)))),join(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
single_axiom ).
cnf(c_0_3,plain,
join(meet(join(meet(X1,join(meet(X2,X3),meet(X3,join(X2,X3)))),meet(join(meet(X2,X3),meet(X3,join(X2,X3))),join(X1,join(meet(X2,X3),meet(X3,join(X2,X3)))))),X4),meet(join(meet(X1,join(join(meet(join(meet(X2,X3),meet(X3,join(X2,X3))),X5),meet(X6,join(meet(X2,X3),meet(X3,join(X2,X3))))),join(meet(X2,X3),meet(X3,join(X2,X3))))),meet(X3,join(X1,join(join(meet(join(meet(X2,X3),meet(X3,join(X2,X3))),X5),meet(X6,join(meet(X2,X3),meet(X3,join(X2,X3))))),join(meet(X2,X3),meet(X3,join(X2,X3))))))),join(join(meet(X1,join(meet(X2,X3),meet(X3,join(X2,X3)))),meet(join(meet(X2,X3),meet(X3,join(X2,X3))),join(X1,join(meet(X2,X3),meet(X3,join(X2,X3)))))),X4))) = join(meet(X2,X3),meet(X3,join(X2,X3))),
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)),meet(join(meet(X6,join(join(meet(X2,X7),meet(X8,X2)),X2)),meet(join(meet(X2,meet(meet(join(X2,X7),join(X8,X2)),X2)),meet(X9,join(X2,meet(meet(join(X2,X7),join(X8,X2)),X2)))),join(X6,join(join(meet(X2,X7),meet(X8,X2)),X2)))),join(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_2]) ).
cnf(c_0_5,plain,
join(meet(join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X2),meet(X2,join(join(meet(X1,X2),meet(X2,join(X1,X2))),X2))),X3),meet(X2,join(join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X2),meet(X2,join(join(meet(X1,X2),meet(X2,join(X1,X2))),X2))),X3))) = X2,
inference(spm,[status(thm)],[c_0_4,c_0_2]) ).
cnf(c_0_6,plain,
join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(join(meet(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)),meet(X2,join(X1,join(join(meet(X2,X4),meet(X5,X2)),X2)))),join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
inference(spm,[status(thm)],[c_0_3,c_0_5]) ).
cnf(c_0_7,plain,
join(meet(X1,X2),meet(X1,join(X1,X2))) = X1,
inference(spm,[status(thm)],[c_0_5,c_0_5]) ).
cnf(c_0_8,plain,
join(meet(X1,join(join(meet(X2,X3),meet(X4,X2)),X2)),meet(X2,join(X1,join(join(meet(X2,X3),meet(X4,X2)),X2)))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_6]),c_0_6]),c_0_6]),c_0_7]) ).
cnf(c_0_9,plain,
join(meet(join(meet(X1,X2),meet(X2,join(X1,X2))),X3),meet(X2,join(join(meet(X1,X2),meet(X2,join(X1,X2))),X3))) = X2,
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_10,plain,
join(meet(X1,join(join(meet(X2,X3),meet(X4,X2)),X2)),meet(join(meet(X2,meet(meet(join(X2,X3),join(X4,X2)),X2)),meet(X5,join(X2,meet(meet(join(X2,X3),join(X4,X2)),X2)))),join(X1,join(join(meet(X2,X3),meet(X4,X2)),X2)))) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_2]),c_0_2]),c_0_7]) ).
cnf(c_0_11,plain,
join(meet(X1,meet(meet(join(X1,X2),join(X3,X1)),X1)),meet(X4,join(X1,meet(meet(join(X1,X2),join(X3,X1)),X1)))) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_12,plain,
join(meet(X1,X2),meet(X2,join(X1,X2))) = X2,
inference(spm,[status(thm)],[c_0_2,c_0_11]) ).
cnf(c_0_13,plain,
meet(meet(join(X1,X2),join(X3,X1)),X1) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
join(meet(X1,X1),meet(X2,join(X1,X1))) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_13]) ).
cnf(c_0_15,plain,
join(join(meet(X1,X2),meet(X3,X1)),X1) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_14]) ).
cnf(c_0_16,plain,
meet(meet(join(X1,X2),X1),X1) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_17,negated_conjecture,
meet(a,a) != a,
inference(fof_simplification,[status(thm)],[prove_wal_axioms_1]) ).
cnf(c_0_18,plain,
meet(meet(X1,meet(X1,X2)),meet(X1,X2)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_2]),c_0_12]),c_0_12]),c_0_12]) ).
cnf(c_0_19,negated_conjecture,
meet(a,a) != a,
c_0_17 ).
cnf(c_0_20,plain,
meet(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_13]),c_0_13]) ).
cnf(c_0_21,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LAT092-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n012.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sun Sep 20 23:11:06 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.40 Running first-order theorem proving
% 0.08/0.40 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.08/0.45 % Version: 3.5.1
% 0.08/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/0.45 % Starting new_bool_3 with 300s (1) cores
% 0.08/0.45 % Starting new_bool_1 with 300s (1) cores
% 0.08/0.45 % Starting sh5l with 300s (1) cores
% 0.08/0.45 % new_bool_1 with pid 1055476 completed with status 9
% 0.08/0.45 % new_bool_3 with pid 1055475 completed with status 9
% 0.08/0.45 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1055474 completed with status 0
% 0.08/0.45 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.08/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.45 % No SInE strategy applied
% 0.08/0.45 % Search class: FUUPF-FFSF22-DFFFFFNN
% 0.08/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.08/0.45 % Starting G----_0008_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.08/0.45 % Starting new_bool_3 with 136s (1) cores
% 0.08/0.45 % Starting G----_0015_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.08/0.45 % G----_0008_C18_F1_SE_CS_SP_S0Y with pid 1055481 completed with status 0
% 0.08/0.45 % Result found by G----_0008_C18_F1_SE_CS_SP_S0Y
% 0.08/0.45 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.08/0.45 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.08/0.45 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.45 % No SInE strategy applied
% 0.08/0.45 % Search class: FUUPF-FFSF22-DFFFFFNN
% 0.08/0.45 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.45 % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.45 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.08/0.45 % Starting G----_0008_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.08/0.45 % Preprocessing time : 0.001 s
% 0.08/0.45
% 0.08/0.45 % Proof found!
% 0.08/0.45 % SZS status Unsatisfiable
% 0.08/0.45 % SZS output start CNFRefutation
% See solution above
% 0.08/0.45 % Parsed axioms : 2
% 0.08/0.45 % Removed by relevancy pruning/SinE : 0
% 0.08/0.45 % Initial clauses : 2
% 0.08/0.45 % Removed in clause preprocessing : 0
% 0.08/0.45 % Initial clauses in saturation : 2
% 0.08/0.45 % Processed clauses : 37
% 0.08/0.45 % ...of these trivial : 11
% 0.08/0.45 % ...subsumed : 0
% 0.08/0.45 % ...remaining for further processing : 26
% 0.08/0.45 % Other redundant clauses eliminated : 0
% 0.08/0.45 % Clauses deleted for lack of memory : 0
% 0.08/0.45 % Backward-subsumed : 0
% 0.08/0.45 % Backward-rewritten : 8
% 0.08/0.45 % Generated clauses : 973
% 0.08/0.45 % ...of the previous two non-redundant : 844
% 0.08/0.45 % ...aggressively subsumed : 0
% 0.08/0.45 % Contextual simplify-reflections : 0
% 0.08/0.45 % Paramodulations : 973
% 0.08/0.45 % Factorizations : 0
% 0.08/0.45 % NegExts : 0
% 0.08/0.45 % Equation resolutions : 0
% 0.08/0.45 % Disequality decompositions : 0
% 0.08/0.45 % Total rewrite steps : 1364
% 0.08/0.45 % ...of those cached : 1105
% 0.08/0.45 % Propositional unsat checks : 0
% 0.08/0.45 % Propositional check models : 0
% 0.08/0.45 % Propositional check unsatisfiable : 0
% 0.08/0.45 % Propositional clauses : 0
% 0.08/0.45 % Propositional clauses after purity: 0
% 0.08/0.45 % Propositional unsat core size : 0
% 0.08/0.45 % Propositional preprocessing time : 0.000
% 0.08/0.45 % Propositional encoding time : 0.000
% 0.08/0.45 % Propositional solver time : 0.000
% 0.08/0.45 % Success case prop preproc time : 0.000
% 0.08/0.45 % Success case prop encoding time : 0.000
% 0.08/0.45 % Success case prop solver time : 0.000
% 0.08/0.45 % Current number of processed clauses : 18
% 0.08/0.45 % Positive orientable unit clauses : 18
% 0.08/0.45 % Positive unorientable unit clauses: 0
% 0.08/0.45 % Negative unit clauses : 0
% 0.08/0.45 % Non-unit-clauses : 0
% 0.08/0.45 % Current number of unprocessed clauses: 807
% 0.08/0.45 % ...number of literals in the above : 807
% 0.08/0.45 % Current number of archived formulas : 0
% 0.08/0.45 % Current number of archived clauses : 8
% 0.08/0.45 % Clause-clause subsumption calls (NU) : 0
% 0.08/0.45 % Rec. Clause-clause subsumption calls : 0
% 0.08/0.45 % Non-unit clause-clause subsumptions : 0
% 0.08/0.45 % Unit Clause-clause subsumption calls : 0
% 0.08/0.45 % Rewrite failures with RHS unbound : 0
% 0.08/0.45 % BW rewrite match attempts : 82
% 0.08/0.45 % BW rewrite match successes : 7
% 0.08/0.45 % Condensation attempts : 0
% 0.08/0.45 % Condensation successes : 0
% 0.08/0.45 % Termbank termtop insertions : 147950
% 0.08/0.45 % Search garbage collected termcells : 2
% 0.08/0.45
% 0.08/0.45 % -------------------------------------------------
% 0.08/0.45 % User time : 0.033 s
% 0.08/0.45 % System time : 0.006 s
% 0.08/0.45 % Total time : 0.039 s
% 0.08/0.45 % Maximum resident set size: 3640 pages
% 0.08/0.45
% 0.08/0.45 % -------------------------------------------------
% 0.08/0.45 % User time : 0.224 s
% 0.08/0.45 % System time : 0.032 s
% 0.08/0.45 % Total time : 0.256 s
% 0.08/0.45 % Maximum resident set size: 4864 pages
% 0.08/0.45 % E exiting
%------------------------------------------------------------------------------