%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT094-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 : 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.13s 0.47s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 2
% Syntax : Number of clauses : 27 ( 27 unt; 0 nHn; 4 RR)
% Number of literals : 27 ( 26 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 : 74 ( 12 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/sandbox2/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_wal_axioms_3,negated_conjecture,
join(a,a) != a,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_wal_axioms_3) ).
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,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_18,plain,
meet(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_13]),c_0_13]) ).
cnf(c_0_19,plain,
join(meet(X1,X1),join(X1,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_13]),c_0_13]),c_0_13]) ).
cnf(c_0_20,negated_conjecture,
join(a,a) != a,
inference(fof_simplification,[status(thm)],[prove_wal_axioms_3]) ).
cnf(c_0_21,plain,
join(join(meet(X1,X2),X1),X1) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_22,plain,
meet(join(X1,X1),X1) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_23,plain,
join(X1,join(X1,X1)) = X1,
inference(rw,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
join(a,a) != a,
c_0_20 ).
cnf(c_0_25,plain,
join(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23]),c_0_23]) ).
cnf(c_0_26,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LAT094-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n012.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Sun Sep 20 23:11:36 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.13/0.47 % Version: 3.5.1
% 0.13/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.47 % Starting new_bool_3 with 300s (1) cores
% 0.13/0.47 % Starting new_bool_1 with 300s (1) cores
% 0.13/0.47 % Starting sh5l with 300s (1) cores
% 0.13/0.47 % new_bool_1 with pid 1056312 completed with status 9
% 0.13/0.47 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1056310 completed with status 0
% 0.13/0.47 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.13/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.47 % No SInE strategy applied
% 0.13/0.47 % Search class: FUUPF-FFSF22-DFFFFFNN
% 0.13/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.13/0.47 % Starting G----_0008_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.13/0.47 % Starting new_bool_3 with 136s (1) cores
% 0.13/0.47 % Starting G----_0015_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.13/0.47 % G----_0008_C18_F1_SE_CS_SP_S0Y with pid 1056316 completed with status 0
% 0.13/0.47 % Result found by G----_0008_C18_F1_SE_CS_SP_S0Y
% 0.13/0.47 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.13/0.47 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.13/0.47 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.13/0.47 % No SInE strategy applied
% 0.13/0.47 % Search class: FUUPF-FFSF22-DFFFFFNN
% 0.13/0.47 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.13/0.47 % Starting SubtermCWHack with 136s (1) cores
% 0.13/0.47 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.13/0.47 % Starting G----_0008_C18_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.13/0.47 % Preprocessing time : 0.001 s
% 0.13/0.47
% 0.13/0.47 % Proof found!
% 0.13/0.47 % SZS status Unsatisfiable
% 0.13/0.47 % SZS output start CNFRefutation
% See solution above
% 0.13/0.47 % Parsed axioms : 2
% 0.13/0.47 % Removed by relevancy pruning/SinE : 0
% 0.13/0.47 % Initial clauses : 2
% 0.13/0.47 % Removed in clause preprocessing : 0
% 0.13/0.47 % Initial clauses in saturation : 2
% 0.13/0.47 % Processed clauses : 43
% 0.13/0.47 % ...of these trivial : 14
% 0.13/0.47 % ...subsumed : 0
% 0.13/0.47 % ...remaining for further processing : 29
% 0.13/0.47 % Other redundant clauses eliminated : 0
% 0.13/0.47 % Clauses deleted for lack of memory : 0
% 0.13/0.47 % Backward-subsumed : 0
% 0.13/0.47 % Backward-rewritten : 10
% 0.13/0.47 % Generated clauses : 1072
% 0.13/0.47 % ...of the previous two non-redundant : 934
% 0.13/0.47 % ...aggressively subsumed : 0
% 0.13/0.47 % Contextual simplify-reflections : 0
% 0.13/0.47 % Paramodulations : 1072
% 0.13/0.47 % Factorizations : 0
% 0.13/0.47 % NegExts : 0
% 0.13/0.47 % Equation resolutions : 0
% 0.13/0.47 % Disequality decompositions : 0
% 0.13/0.47 % Total rewrite steps : 1839
% 0.13/0.47 % ...of those cached : 1540
% 0.13/0.47 % Propositional unsat checks : 0
% 0.13/0.47 % Propositional check models : 0
% 0.13/0.47 % Propositional check unsatisfiable : 0
% 0.13/0.47 % Propositional clauses : 0
% 0.13/0.47 % Propositional clauses after purity: 0
% 0.13/0.47 % Propositional unsat core size : 0
% 0.13/0.47 % Propositional preprocessing time : 0.000
% 0.13/0.47 % Propositional encoding time : 0.000
% 0.13/0.47 % Propositional solver time : 0.000
% 0.13/0.47 % Success case prop preproc time : 0.000
% 0.13/0.47 % Success case prop encoding time : 0.000
% 0.13/0.47 % Success case prop solver time : 0.000
% 0.13/0.47 % Current number of processed clauses : 19
% 0.13/0.47 % Positive orientable unit clauses : 19
% 0.13/0.47 % Positive unorientable unit clauses: 0
% 0.13/0.47 % Negative unit clauses : 0
% 0.13/0.47 % Non-unit-clauses : 0
% 0.13/0.47 % Current number of unprocessed clauses: 893
% 0.13/0.47 % ...number of literals in the above : 893
% 0.13/0.47 % Current number of archived formulas : 0
% 0.13/0.47 % Current number of archived clauses : 10
% 0.13/0.47 % Clause-clause subsumption calls (NU) : 0
% 0.13/0.47 % Rec. Clause-clause subsumption calls : 0
% 0.13/0.47 % Non-unit clause-clause subsumptions : 0
% 0.13/0.47 % Unit Clause-clause subsumption calls : 0
% 0.13/0.47 % Rewrite failures with RHS unbound : 0
% 0.13/0.47 % BW rewrite match attempts : 109
% 0.13/0.47 % BW rewrite match successes : 8
% 0.13/0.47 % Condensation attempts : 0
% 0.13/0.47 % Condensation successes : 0
% 0.13/0.47 % Termbank termtop insertions : 151490
% 0.13/0.47 % Search garbage collected termcells : 2
% 0.13/0.47
% 0.13/0.47 % -------------------------------------------------
% 0.13/0.47 % User time : 0.037 s
% 0.13/0.47 % System time : 0.006 s
% 0.13/0.47 % Total time : 0.043 s
% 0.13/0.47 % Maximum resident set size: 3588 pages
% 0.13/0.47
% 0.13/0.47 % -------------------------------------------------
% 0.13/0.47 % User time : 0.175 s
% 0.13/0.47 % System time : 0.028 s
% 0.13/0.47 % Total time : 0.203 s
% 0.13/0.47 % Maximum resident set size: 4864 pages
% 0.13/0.47 % E exiting
%------------------------------------------------------------------------------