%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LAT091-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 : 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:05:35 PM UTC 2026
% Result : Unsatisfiable 0.49s 0.66s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 6
% Syntax : Number of clauses : 45 ( 45 unt; 0 nHn; 4 RR)
% Number of literals : 45 ( 44 equ; 3 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 84 ( 27 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(wal_absorbtion_4,axiom,
meet(meet(join(X1,X2),join(X3,X1)),X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wal_absorbtion_4) ).
cnf(wal_absorbtion_5,axiom,
join(join(meet(X1,X2),meet(X3,X1)),X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wal_absorbtion_5) ).
cnf(wal_absorbtion_3,axiom,
join(meet(X1,X2),meet(X2,join(X1,X2))) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wal_absorbtion_3) ).
cnf(wal_absorbtion_1,axiom,
join(meet(X1,X2),meet(X1,join(X1,X2))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wal_absorbtion_1) ).
cnf(wal_absorbtion_2,axiom,
join(meet(X1,X1),meet(X2,join(X1,X1))) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',wal_absorbtion_2) ).
cnf(prove_normal_axioms_4,negated_conjecture,
join(b,a) != join(a,b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_normal_axioms_4) ).
cnf(c_0_6,axiom,
meet(meet(join(X1,X2),join(X3,X1)),X1) = X1,
wal_absorbtion_4 ).
cnf(c_0_7,axiom,
join(join(meet(X1,X2),meet(X3,X1)),X1) = X1,
wal_absorbtion_5 ).
cnf(c_0_8,axiom,
join(meet(X1,X2),meet(X2,join(X1,X2))) = X2,
wal_absorbtion_3 ).
cnf(c_0_9,plain,
meet(meet(join(X1,X2),X1),X1) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,axiom,
join(meet(X1,X2),meet(X1,join(X1,X2))) = X1,
wal_absorbtion_1 ).
cnf(c_0_11,plain,
join(X1,meet(X1,join(meet(join(X1,X2),X1),X1))) = X1,
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,plain,
meet(meet(X1,join(X2,meet(X1,X3))),meet(X1,X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_6,c_0_10]) ).
cnf(c_0_13,plain,
meet(meet(X1,X1),X1) = X1,
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_14,plain,
meet(meet(meet(X1,X1),join(X2,X1)),X1) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_15,plain,
join(join(meet(X1,X2),X1),X1) = X1,
inference(spm,[status(thm)],[c_0_7,c_0_6]) ).
cnf(c_0_16,plain,
meet(X1,X1) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_7]),c_0_13]) ).
cnf(c_0_17,plain,
join(join(X1,meet(X1,X1)),meet(X1,X1)) = meet(X1,X1),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_18,plain,
meet(join(X1,X1),X1) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_16]) ).
cnf(c_0_19,plain,
join(join(X1,X1),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_16]),c_0_16]),c_0_16]) ).
cnf(c_0_20,axiom,
join(meet(X1,X1),meet(X2,join(X1,X1))) = X1,
wal_absorbtion_2 ).
cnf(c_0_21,plain,
join(X1,X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_18]),c_0_19]),c_0_16]) ).
cnf(c_0_22,plain,
meet(meet(X1,join(X2,meet(X3,X1))),meet(X3,X1)) = meet(X3,X1),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_23,plain,
join(X1,meet(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_16]),c_0_21]) ).
cnf(c_0_24,plain,
join(meet(meet(X1,X2),meet(X1,join(X1,X2))),meet(meet(X1,X2),X1)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_10,c_0_10]) ).
cnf(c_0_25,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_16]) ).
cnf(c_0_26,plain,
meet(meet(X1,X2),X2) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_23]),c_0_16]),c_0_21]) ).
cnf(c_0_27,plain,
meet(join(X1,X2),X1) = X1,
inference(rw,[status(thm)],[c_0_9,c_0_26]) ).
cnf(c_0_28,plain,
meet(meet(X1,join(X2,X1)),X1) = X1,
inference(spm,[status(thm)],[c_0_6,c_0_11]) ).
cnf(c_0_29,plain,
meet(X1,join(meet(X1,X2),X1)) = join(meet(X1,X2),X1),
inference(spm,[status(thm)],[c_0_27,c_0_15]) ).
cnf(c_0_30,plain,
meet(join(meet(X1,X2),X1),X1) = X1,
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_31,plain,
join(meet(X1,X2),X1) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_30]),c_0_15]),c_0_30]),c_0_21]) ).
cnf(c_0_32,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_31,c_0_27]) ).
cnf(c_0_33,plain,
meet(X1,join(X1,X2)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_32]),c_0_21]) ).
cnf(c_0_34,plain,
join(join(X1,X2),X1) = join(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_33]) ).
cnf(c_0_35,plain,
join(join(meet(X1,X2),meet(X3,X2)),X2) = X2,
inference(spm,[status(thm)],[c_0_7,c_0_25]) ).
cnf(c_0_36,plain,
join(join(X1,meet(X1,join(X2,X1))),meet(X1,join(X2,X1))) = meet(X1,join(X2,X1)),
inference(spm,[status(thm)],[c_0_15,c_0_28]) ).
cnf(c_0_37,plain,
join(X1,meet(X1,X2)) = X1,
inference(spm,[status(thm)],[c_0_34,c_0_31]) ).
cnf(c_0_38,plain,
join(join(meet(X1,join(X2,X3)),X2),join(X2,X3)) = join(X2,X3),
inference(spm,[status(thm)],[c_0_35,c_0_33]) ).
cnf(c_0_39,plain,
meet(X1,join(X2,X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37]),c_0_37]) ).
cnf(c_0_40,negated_conjecture,
join(b,a) != join(a,b),
inference(fof_simplification,[status(thm)],[prove_normal_axioms_4]) ).
cnf(c_0_41,plain,
join(join(X1,X2),join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_42,negated_conjecture,
join(b,a) != join(a,b),
c_0_40 ).
cnf(c_0_43,plain,
join(X1,X2) = join(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_41]),c_0_41]) ).
cnf(c_0_44,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LAT091-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.09 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.48 % Computer : n007.cluster.edu
% 0.23/0.48 % Model : x86_64 x86_64
% 0.23/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.23/0.48 % Memory : 8046.5625MB
% 0.23/0.48 % OS : Linux 6.8.0-71-generic
% 0.23/0.48 % CPULimit : 300
% 0.23/0.48 % WCLimit : 300
% 0.23/0.48 % DateTime : Sun Sep 20 23:09:35 UTC 2026
% 0.23/0.49 % CPUTime :
% 0.23/0.49 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.27/0.59 Running first-order theorem proving
% 0.27/0.59 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.49/0.66 % Version: 3.5.1
% 0.49/0.66 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.49/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.66 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.49/0.66 % Starting new_bool_3 with 300s (1) cores
% 0.49/0.66 % Starting new_bool_1 with 300s (1) cores
% 0.49/0.66 % Starting sh5l with 300s (1) cores
% 0.49/0.66 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3787584 completed with status 0
% 0.49/0.66 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.49/0.66 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.49/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.66 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.49/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.49/0.66 % No SInE strategy applied
% 0.49/0.66 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.49/0.66 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.49/0.66 % Starting SubtermCWHack with 136s (1) cores
% 0.49/0.66 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.49/0.66 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 0.49/0.66 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.49/0.66 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.49/0.66 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3787589 completed with status 0
% 0.49/0.66 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.49/0.66 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.49/0.66 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.66 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.49/0.66 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.49/0.66 % No SInE strategy applied
% 0.49/0.66 % Search class: FUUPM-FFSF22-MFFFFFNN
% 0.49/0.66 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 0.49/0.66 % Starting SubtermCWHack with 136s (1) cores
% 0.49/0.66 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.49/0.66 % Preprocessing time : 0.001 s
% 0.49/0.66
% 0.49/0.66 % Proof found!
% 0.49/0.66 % SZS status Unsatisfiable
% 0.49/0.66 % SZS output start CNFRefutation
% See solution above
% 0.49/0.66 % Parsed axioms : 6
% 0.49/0.66 % Removed by relevancy pruning/SinE : 0
% 0.49/0.66 % Initial clauses : 6
% 0.49/0.66 % Removed in clause preprocessing : 0
% 0.49/0.66 % Initial clauses in saturation : 6
% 0.49/0.66 % Processed clauses : 130
% 0.49/0.66 % ...of these trivial : 43
% 0.49/0.66 % ...subsumed : 5
% 0.49/0.66 % ...remaining for further processing : 82
% 0.49/0.66 % Other redundant clauses eliminated : 0
% 0.49/0.66 % Clauses deleted for lack of memory : 0
% 0.49/0.66 % Backward-subsumed : 0
% 0.49/0.66 % Backward-rewritten : 60
% 0.49/0.66 % Generated clauses : 2412
% 0.49/0.66 % ...of the previous two non-redundant : 975
% 0.49/0.66 % ...aggressively subsumed : 0
% 0.49/0.66 % Contextual simplify-reflections : 0
% 0.49/0.66 % Paramodulations : 2412
% 0.49/0.66 % Factorizations : 0
% 0.49/0.66 % NegExts : 0
% 0.49/0.66 % Equation resolutions : 0
% 0.49/0.66 % Disequality decompositions : 0
% 0.49/0.66 % Total rewrite steps : 3300
% 0.49/0.66 % ...of those cached : 2891
% 0.49/0.66 % Propositional unsat checks : 0
% 0.49/0.66 % Propositional check models : 0
% 0.49/0.66 % Propositional check unsatisfiable : 0
% 0.49/0.66 % Propositional clauses : 0
% 0.49/0.66 % Propositional clauses after purity: 0
% 0.49/0.66 % Propositional unsat core size : 0
% 0.49/0.66 % Propositional preprocessing time : 0.000
% 0.49/0.66 % Propositional encoding time : 0.000
% 0.49/0.66 % Propositional solver time : 0.000
% 0.49/0.66 % Success case prop preproc time : 0.000
% 0.49/0.66 % Success case prop encoding time : 0.000
% 0.49/0.66 % Success case prop solver time : 0.000
% 0.49/0.66 % Current number of processed clauses : 22
% 0.49/0.66 % Positive orientable unit clauses : 20
% 0.49/0.66 % Positive unorientable unit clauses: 2
% 0.49/0.66 % Negative unit clauses : 0
% 0.49/0.66 % Non-unit-clauses : 0
% 0.49/0.66 % Current number of unprocessed clauses: 627
% 0.49/0.66 % ...number of literals in the above : 627
% 0.49/0.66 % Current number of archived formulas : 0
% 0.49/0.66 % Current number of archived clauses : 60
% 0.49/0.66 % Clause-clause subsumption calls (NU) : 0
% 0.49/0.66 % Rec. Clause-clause subsumption calls : 0
% 0.49/0.66 % Non-unit clause-clause subsumptions : 0
% 0.49/0.66 % Unit Clause-clause subsumption calls : 18
% 0.49/0.66 % Rewrite failures with RHS unbound : 0
% 0.49/0.66 % BW rewrite match attempts : 368
% 0.49/0.66 % BW rewrite match successes : 149
% 0.49/0.66 % Condensation attempts : 0
% 0.49/0.66 % Condensation successes : 0
% 0.49/0.66 % Termbank termtop insertions : 18851
% 0.49/0.66 % Search garbage collected termcells : 2
% 0.49/0.66
% 0.49/0.66 % -------------------------------------------------
% 0.49/0.66 % User time : 0.025 s
% 0.49/0.66 % System time : 0.003 s
% 0.49/0.66 % Total time : 0.029 s
% 0.49/0.66 % Maximum resident set size: 3632 pages
% 0.49/0.66
% 0.49/0.66 % -------------------------------------------------
% 0.49/0.66 % User time : 0.081 s
% 0.49/0.66 % System time : 0.018 s
% 0.49/0.66 % Total time : 0.100 s
% 0.49/0.66 % Maximum resident set size: 4608 pages
% 0.49/0.66 % E exiting
%------------------------------------------------------------------------------