%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT027-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 : n018.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:05 PM UTC 2026
% Result : Unsatisfiable 6.15s 1.26s
% Output : CNFRefutation 6.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 5
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 5 RR)
% Number of literals : 38 ( 37 equ; 4 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 93 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wal_2,axiom,
join(join(meet(X1,X2),meet(X3,X2)),X2) = X2,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT005-0.ax',wal_2) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT005-0.ax',commutativity_of_join) ).
cnf(absorption,hypothesis,
meet(X1,join(X2,join(X1,X3))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',absorption) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT005-0.ax',idempotence_of_join) ).
cnf(prove_associativity_of_join,negated_conjecture,
join(join(a,b),c) != join(a,join(b,c)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_associativity_of_join) ).
cnf(c_0_5,axiom,
join(join(meet(X1,X2),meet(X3,X2)),X2) = X2,
wal_2 ).
cnf(c_0_6,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_7,plain,
join(X1,join(meet(X2,X1),meet(X3,X1))) = X1,
inference(rw,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,hypothesis,
meet(X1,join(X2,join(X1,X3))) = X1,
absorption ).
cnf(c_0_9,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_10,hypothesis,
join(join(X1,join(X2,X3)),join(X2,meet(X4,join(X1,join(X2,X3))))) = join(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_6]) ).
cnf(c_0_11,hypothesis,
meet(X1,join(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,hypothesis,
meet(X1,join(X2,join(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_13,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_9]) ).
cnf(c_0_14,hypothesis,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_15,hypothesis,
join(join(X1,X2),join(X2,join(X1,X3))) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_6]) ).
cnf(c_0_16,hypothesis,
join(join(X1,join(X2,X3)),join(X3,meet(X4,join(X1,join(X2,X3))))) = join(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_7,c_0_12]) ).
cnf(c_0_17,hypothesis,
meet(X1,join(join(X2,X1),X3)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_6]) ).
cnf(c_0_18,hypothesis,
join(X1,join(X2,join(X3,X1))) = join(X2,join(X3,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_12]),c_0_6]) ).
cnf(c_0_19,hypothesis,
join(join(X1,X2),join(X2,meet(X3,join(X1,X2)))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_7,c_0_14]) ).
cnf(c_0_20,hypothesis,
meet(join(X1,X2),join(X2,join(X1,X3))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_11,c_0_15]) ).
cnf(c_0_21,hypothesis,
join(join(X1,X2),join(X2,join(X3,X1))) = join(X2,join(X3,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_11]),c_0_6]) ).
cnf(c_0_22,hypothesis,
join(join(join(X1,X2),X3),join(X2,meet(X4,join(join(X1,X2),X3)))) = join(join(X1,X2),X3),
inference(spm,[status(thm)],[c_0_7,c_0_17]) ).
cnf(c_0_23,hypothesis,
join(join(X1,X2),join(X1,join(X3,X2))) = join(X1,join(X3,X2)),
inference(spm,[status(thm)],[c_0_15,c_0_18]) ).
cnf(c_0_24,hypothesis,
join(join(X1,X2),join(X1,X3)) = join(X3,join(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).
cnf(c_0_25,hypothesis,
join(X1,join(X2,join(X1,X3))) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_8]),c_0_6]) ).
cnf(c_0_26,hypothesis,
join(join(X1,X2),join(join(X3,X1),X2)) = join(join(X3,X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_14]),c_0_6]) ).
cnf(c_0_27,hypothesis,
join(join(X1,X2),join(X3,X2)) = join(X3,join(X1,X2)),
inference(rw,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_28,hypothesis,
join(join(X1,X2),join(X1,join(X2,X3))) = join(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_15,c_0_25]) ).
cnf(c_0_29,negated_conjecture,
join(join(a,b),c) != join(a,join(b,c)),
inference(fof_simplification,[status(thm)],[prove_associativity_of_join]) ).
cnf(c_0_30,hypothesis,
join(join(X1,X2),join(X2,X3)) = join(join(X1,X2),X3),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_31,hypothesis,
join(join(X1,X2),join(X3,X1)) = join(X3,join(X1,X2)),
inference(rw,[status(thm)],[c_0_28,c_0_24]) ).
cnf(c_0_32,negated_conjecture,
join(join(a,b),c) != join(a,join(b,c)),
c_0_29 ).
cnf(c_0_33,hypothesis,
join(join(X1,X2),join(join(X1,X3),X2)) = join(join(X1,X3),X2),
inference(spm,[status(thm)],[c_0_15,c_0_6]) ).
cnf(c_0_34,hypothesis,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_30]),c_0_31]) ).
cnf(c_0_35,negated_conjecture,
join(c,join(a,b)) != join(a,join(b,c)),
inference(rw,[status(thm)],[c_0_32,c_0_6]) ).
cnf(c_0_36,hypothesis,
join(X1,join(X2,X3)) = join(X2,join(X3,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_27]),c_0_24]),c_0_34]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_35,c_0_36]),c_0_6]),c_0_36]),c_0_6])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LAT027-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.09/0.37 % Computer : n018.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Sun Sep 20 23:09:30 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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
% 6.15/1.26 % Version: 3.5.1
% 6.15/1.26 % Preprocessing class: FSSSSMSSSSSNFFN.
% 6.15/1.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.15/1.26 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.15/1.26 % Starting new_bool_3 with 300s (1) cores
% 6.15/1.26 % Starting new_bool_1 with 300s (1) cores
% 6.15/1.26 % Starting sh5l with 300s (1) cores
% 6.15/1.26 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 394149 completed with status 0
% 6.15/1.26 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 6.15/1.26 % Preprocessing class: FSSSSMSSSSSNFFN.
% 6.15/1.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.15/1.26 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.15/1.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.15/1.26 % No SInE strategy applied
% 6.15/1.26 % Search class: FUUPM-FFSF22-MFFFFFNN
% 6.15/1.26 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 6.15/1.26 % Starting SubtermCWHack with 136s (1) cores
% 6.15/1.26 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 6.15/1.26 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 6.15/1.26 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 6.15/1.26 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 6.15/1.26 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 394155 completed with status 0
% 6.15/1.26 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 6.15/1.26 % Preprocessing class: FSSSSMSSSSSNFFN.
% 6.15/1.26 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.15/1.26 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 6.15/1.26 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 6.15/1.26 % No SInE strategy applied
% 6.15/1.26 % Search class: FUUPM-FFSF22-MFFFFFNN
% 6.15/1.26 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 6.15/1.26 % Starting SubtermCWHack with 136s (1) cores
% 6.15/1.26 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 6.15/1.26 % Preprocessing time : 0.002 s
% 6.15/1.26
% 6.15/1.26 % Proof found!
% 6.15/1.26 % SZS status Unsatisfiable
% 6.15/1.26 % SZS output start CNFRefutation
% See solution above
% 6.15/1.26 % Parsed axioms : 8
% 6.15/1.26 % Removed by relevancy pruning/SinE : 0
% 6.15/1.26 % Initial clauses : 8
% 6.15/1.26 % Removed in clause preprocessing : 0
% 6.15/1.26 % Initial clauses in saturation : 8
% 6.15/1.26 % Processed clauses : 1435
% 6.15/1.26 % ...of these trivial : 869
% 6.15/1.26 % ...subsumed : 304
% 6.15/1.26 % ...remaining for further processing : 262
% 6.15/1.26 % Other redundant clauses eliminated : 0
% 6.15/1.26 % Clauses deleted for lack of memory : 0
% 6.15/1.26 % Backward-subsumed : 0
% 6.15/1.26 % Backward-rewritten : 104
% 6.15/1.26 % Generated clauses : 87957
% 6.15/1.26 % ...of the previous two non-redundant : 43748
% 6.15/1.26 % ...aggressively subsumed : 0
% 6.15/1.26 % Contextual simplify-reflections : 0
% 6.15/1.26 % Paramodulations : 87957
% 6.15/1.26 % Factorizations : 0
% 6.15/1.26 % NegExts : 0
% 6.15/1.26 % Equation resolutions : 0
% 6.15/1.26 % Disequality decompositions : 0
% 6.15/1.26 % Total rewrite steps : 70928
% 6.15/1.26 % ...of those cached : 60936
% 6.15/1.26 % Propositional unsat checks : 0
% 6.15/1.26 % Propositional check models : 0
% 6.15/1.26 % Propositional check unsatisfiable : 0
% 6.15/1.26 % Propositional clauses : 0
% 6.15/1.26 % Propositional clauses after purity: 0
% 6.15/1.26 % Propositional unsat core size : 0
% 6.15/1.26 % Propositional preprocessing time : 0.000
% 6.15/1.26 % Propositional encoding time : 0.000
% 6.15/1.26 % Propositional solver time : 0.000
% 6.15/1.26 % Success case prop preproc time : 0.000
% 6.15/1.26 % Success case prop encoding time : 0.000
% 6.15/1.26 % Success case prop solver time : 0.000
% 6.15/1.26 % Current number of processed clauses : 158
% 6.15/1.26 % Positive orientable unit clauses : 155
% 6.15/1.26 % Positive unorientable unit clauses: 3
% 6.15/1.26 % Negative unit clauses : 0
% 6.15/1.26 % Non-unit-clauses : 0
% 6.15/1.26 % Current number of unprocessed clauses: 42267
% 6.15/1.26 % ...number of literals in the above : 42267
% 6.15/1.26 % Current number of archived formulas : 0
% 6.15/1.26 % Current number of archived clauses : 104
% 6.15/1.26 % Clause-clause subsumption calls (NU) : 0
% 6.15/1.26 % Rec. Clause-clause subsumption calls : 0
% 6.15/1.26 % Non-unit clause-clause subsumptions : 0
% 6.15/1.26 % Unit Clause-clause subsumption calls : 32
% 6.15/1.26 % Rewrite failures with RHS unbound : 0
% 6.15/1.26 % BW rewrite match attempts : 1694
% 6.15/1.26 % BW rewrite match successes : 212
% 6.15/1.26 % Condensation attempts : 0
% 6.15/1.26 % Condensation successes : 0
% 6.15/1.26 % Termbank termtop insertions : 802192
% 6.15/1.26 % Search garbage collected termcells : 2
% 6.15/1.26
% 6.15/1.26 % -------------------------------------------------
% 6.15/1.26 % User time : 0.758 s
% 6.15/1.26 % System time : 0.042 s
% 6.15/1.26 % Total time : 0.800 s
% 6.15/1.26 % Maximum resident set size: 3380 pages
% 6.15/1.26
% 6.15/1.26 % -------------------------------------------------
% 6.15/1.26 % User time : 3.843 s
% 6.15/1.26 % System time : 0.194 s
% 6.15/1.26 % Total time : 4.038 s
% 6.15/1.26 % Maximum resident set size: 4608 pages
% 6.15/1.26 % E exiting
%------------------------------------------------------------------------------