%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT011-1 : TPTP v9.3.1. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n008.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.43s 0.55s
% Output : CNFRefutation 0.43s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 4 RR)
% Number of literals : 34 ( 33 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 66 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption2) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).
cnf(absorption2_2,axiom,
join(X1,meet2(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',absorption2_2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(commutativity_of_meet2,axiom,
meet2(X1,X2) = meet2(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_meet2) ).
cnf(absorption1_2,axiom,
meet2(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',absorption1_2) ).
cnf(prove_meets_are_same,negated_conjecture,
meet(a,b) != meet2(a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_meets_are_same) ).
cnf(associativity_of_meet2,axiom,
meet2(meet2(X1,X2),X3) = meet2(X1,meet2(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_meet2) ).
cnf(c_0_10,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_11,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_12,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_13,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_14,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_15,axiom,
join(X1,meet2(X1,X2)) = X1,
absorption2_2 ).
cnf(c_0_16,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_17,axiom,
meet2(X1,X2) = meet2(X2,X1),
commutativity_of_meet2 ).
cnf(c_0_18,plain,
join(meet(X1,X2),meet(X1,meet(X2,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_19,plain,
meet(X1,meet2(X1,X2)) = meet2(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
cnf(c_0_20,plain,
join(X1,meet2(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_21,axiom,
meet2(X1,join(X1,X2)) = X1,
absorption1_2 ).
cnf(c_0_22,plain,
join(meet(X1,X2),meet(X1,meet2(X2,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_23,plain,
meet(X1,meet2(X2,X1)) = meet2(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_20]),c_0_16]) ).
cnf(c_0_24,plain,
meet2(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_11]) ).
cnf(c_0_25,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_16]) ).
cnf(c_0_26,negated_conjecture,
meet(a,b) != meet2(a,b),
inference(fof_simplification,[status(thm)],[prove_meets_are_same]) ).
cnf(c_0_27,plain,
join(meet2(X1,X2),meet(X2,X1)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_11]) ).
cnf(c_0_28,axiom,
meet2(meet2(X1,X2),X3) = meet2(X1,meet2(X2,X3)),
associativity_of_meet2 ).
cnf(c_0_29,plain,
meet2(X1,meet(X1,X2)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_12]),c_0_17]) ).
cnf(c_0_30,plain,
meet2(X1,meet(X2,X1)) = meet(X2,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_17]) ).
cnf(c_0_31,negated_conjecture,
meet(a,b) != meet2(a,b),
c_0_26 ).
cnf(c_0_32,plain,
meet(X1,X2) = meet2(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_27]),c_0_28]),c_0_29]),c_0_30]) ).
cnf(c_0_33,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32]),c_0_17])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LAT011-1 : TPTP v9.3.1. Released v2.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.36 % Computer : n008.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:06:41 UTC 2026
% 0.08/0.37 % CPUTime :
% 0.08/0.37 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.43/0.55 % Version: 3.5.1
% 0.43/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.43/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.43/0.55 % Starting new_bool_3 with 300s (1) cores
% 0.43/0.55 % Starting new_bool_1 with 300s (1) cores
% 0.43/0.55 % Starting sh5l with 300s (1) cores
% 0.43/0.55 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3791849 completed with status 0
% 0.43/0.55 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.43/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.43/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.43/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.43/0.55 % No SInE strategy applied
% 0.43/0.55 % Search class: FUUPM-FFSF22-SFFFFFNN
% 0.43/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.43/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.43/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.43/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.43/0.55 % Starting new_bool_3 with 136s (1) cores
% 0.43/0.55 % Starting new_bool_1 with 136s (1) cores
% 0.43/0.55 % G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with pid 3791856 completed with status 0
% 0.43/0.55 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y
% 0.43/0.55 % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.43/0.55 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.43/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.43/0.55 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.43/0.55 % No SInE strategy applied
% 0.43/0.55 % Search class: FUUPM-FFSF22-SFFFFFNN
% 0.43/0.55 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.43/0.55 % Starting SubtermCWHack with 136s (1) cores
% 0.43/0.55 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.43/0.55 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 0.43/0.55 % Preprocessing time : 0.001 s
% 0.43/0.55 % Presaturation interreduction done
% 0.43/0.55
% 0.43/0.55 % Proof found!
% 0.43/0.55 % SZS status Unsatisfiable
% 0.43/0.55 % SZS output start CNFRefutation
% See solution above
% 0.43/0.55 % Parsed axioms : 14
% 0.43/0.55 % Removed by relevancy pruning/SinE : 0
% 0.43/0.55 % Initial clauses : 14
% 0.43/0.55 % Removed in clause preprocessing : 0
% 0.43/0.55 % Initial clauses in saturation : 14
% 0.43/0.55 % Processed clauses : 857
% 0.43/0.55 % ...of these trivial : 207
% 0.43/0.55 % ...subsumed : 474
% 0.43/0.55 % ...remaining for further processing : 176
% 0.43/0.55 % Other redundant clauses eliminated : 0
% 0.43/0.55 % Clauses deleted for lack of memory : 0
% 0.43/0.55 % Backward-subsumed : 0
% 0.43/0.55 % Backward-rewritten : 101
% 0.43/0.55 % Generated clauses : 15255
% 0.43/0.55 % ...of the previous two non-redundant : 8227
% 0.43/0.55 % ...aggressively subsumed : 0
% 0.43/0.55 % Contextual simplify-reflections : 0
% 0.43/0.55 % Paramodulations : 15255
% 0.43/0.55 % Factorizations : 0
% 0.43/0.55 % NegExts : 0
% 0.43/0.55 % Equation resolutions : 0
% 0.43/0.55 % Disequality decompositions : 0
% 0.43/0.55 % Total rewrite steps : 17940
% 0.43/0.55 % ...of those cached : 13508
% 0.43/0.55 % Propositional unsat checks : 0
% 0.43/0.55 % Propositional check models : 0
% 0.43/0.55 % Propositional check unsatisfiable : 0
% 0.43/0.55 % Propositional clauses : 0
% 0.43/0.55 % Propositional clauses after purity: 0
% 0.43/0.55 % Propositional unsat core size : 0
% 0.43/0.55 % Propositional preprocessing time : 0.000
% 0.43/0.55 % Propositional encoding time : 0.000
% 0.43/0.55 % Propositional solver time : 0.000
% 0.43/0.55 % Success case prop preproc time : 0.000
% 0.43/0.55 % Success case prop encoding time : 0.000
% 0.43/0.55 % Success case prop solver time : 0.000
% 0.43/0.55 % Current number of processed clauses : 61
% 0.43/0.55 % Positive orientable unit clauses : 54
% 0.43/0.55 % Positive unorientable unit clauses: 7
% 0.43/0.55 % Negative unit clauses : 0
% 0.43/0.55 % Non-unit-clauses : 0
% 0.43/0.55 % Current number of unprocessed clauses: 7368
% 0.43/0.55 % ...number of literals in the above : 7368
% 0.43/0.55 % Current number of archived formulas : 0
% 0.43/0.55 % Current number of archived clauses : 115
% 0.43/0.55 % Clause-clause subsumption calls (NU) : 0
% 0.43/0.55 % Rec. Clause-clause subsumption calls : 0
% 0.43/0.55 % Non-unit clause-clause subsumptions : 0
% 0.43/0.55 % Unit Clause-clause subsumption calls : 51
% 0.43/0.55 % Rewrite failures with RHS unbound : 0
% 0.43/0.55 % BW rewrite match attempts : 501
% 0.43/0.55 % BW rewrite match successes : 315
% 0.43/0.55 % Condensation attempts : 0
% 0.43/0.55 % Condensation successes : 0
% 0.43/0.55 % Termbank termtop insertions : 105426
% 0.43/0.55 % Search garbage collected termcells : 2
% 0.43/0.55
% 0.43/0.55 % -------------------------------------------------
% 0.43/0.55 % User time : 0.114 s
% 0.43/0.55 % System time : 0.010 s
% 0.43/0.55 % Total time : 0.124 s
% 0.43/0.55 % Maximum resident set size: 3636 pages
% 0.43/0.55
% 0.43/0.55 % -------------------------------------------------
% 0.43/0.55 % User time : 0.459 s
% 0.43/0.55 % System time : 0.044 s
% 0.43/0.55 % Total time : 0.503 s
% 0.43/0.55 % Maximum resident set size: 4608 pages
% 0.43/0.55 % E exiting
%------------------------------------------------------------------------------