%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT223-10 : TPTP v9.3.1. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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:29 PM UTC 2026
% Result : Unsatisfiable 123.53s 18.74s
% Output : CNFRefutation 123.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 14
% Syntax : Number of clauses : 50 ( 50 unt; 0 nHn; 13 RR)
% Number of literals : 50 ( 49 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-4 aty)
% Number of variables : 72 ( 11 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',idempotence_of_join) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_meet) ).
cnf(prove_distributivity_hypothesis,hypothesis,
meet(b,a) = a,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_distributivity_hypothesis) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',commutativity_of_join) ).
cnf(equation_H7,axiom,
meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(X2,meet(X1,join(meet(X1,X2),meet(X3,join(X1,X2)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equation_H7) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',absorption1) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',complement_meet) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',associativity_of_meet) ).
cnf(prove_distributivity,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_distributivity) ).
cnf(meet_join_complement,axiom,
ifeq(join(X1,X2),one,ifeq(meet(X1,X2),zero,complement(X1),X2),X2) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',meet_join_complement) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(c_0_14,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_15,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_16,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_17,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_18,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_19,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_20,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_21,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_22,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_23,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_24,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_20,c_0_19]) ).
cnf(c_0_25,plain,
join(X1,join(complement(X1),X2)) = join(one,X2),
inference(spm,[status(thm)],[c_0_14,c_0_17]) ).
cnf(c_0_26,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_27,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_21]),c_0_14]) ).
cnf(c_0_28,hypothesis,
join(a,b) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21]) ).
cnf(c_0_29,axiom,
meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(X2,meet(X1,join(meet(X1,X2),meet(X3,join(X1,X2)))))),
equation_H7 ).
cnf(c_0_30,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,hypothesis,
join(a,join(X1,b)) = join(X1,b),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_32,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_33,plain,
meet(X1,join(X2,meet(X1,join(meet(X1,X2),meet(X3,join(X2,X1)))))) = meet(X1,join(X2,meet(X1,X3))),
inference(spm,[status(thm)],[c_0_29,c_0_21]) ).
cnf(c_0_34,hypothesis,
join(b,complement(a)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_21]) ).
cnf(c_0_35,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_32,c_0_17]) ).
cnf(c_0_36,hypothesis,
meet(complement(a),join(b,meet(complement(a),join(meet(b,complement(a)),X1)))) = meet(complement(a),join(b,meet(complement(a),X1))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_19]),c_0_35]) ).
cnf(c_0_37,hypothesis,
meet(complement(a),join(b,meet(complement(a),complement(meet(b,complement(a)))))) = complement(a),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_17]),c_0_35]),c_0_34]),c_0_35]) ).
cnf(c_0_38,hypothesis,
join(b,join(X1,complement(a))) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_34]),c_0_22]) ).
cnf(c_0_39,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_40,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_41,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
inference(fof_simplification,[status(thm)],[prove_distributivity]) ).
cnf(c_0_42,axiom,
ifeq(join(X1,X2),one,ifeq(meet(X1,X2),zero,complement(X1),X2),X2) = X2,
meet_join_complement ).
cnf(c_0_43,hypothesis,
join(b,meet(complement(a),complement(meet(b,complement(a))))) = one,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_37]),c_0_14]),c_0_38]) ).
cnf(c_0_44,plain,
meet(X1,meet(X2,complement(meet(X1,X2)))) = zero,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_45,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_46,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
c_0_41 ).
cnf(c_0_47,hypothesis,
meet(complement(a),complement(meet(b,complement(a)))) = complement(b),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44]),c_0_45]),c_0_45]) ).
cnf(c_0_48,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_46,c_0_21]) ).
cnf(c_0_49,hypothesis,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_47]),c_0_48]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT223-10 : TPTP v9.3.1. Released v7.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.37 % Computer : n009.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Sun Sep 20 23:21:27 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 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
% 123.53/18.74 % Version: 3.5.1
% 123.53/18.74 % Preprocessing class: FSSSSMSSSSSNFFN.
% 123.53/18.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 123.53/18.74 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 123.53/18.74 % Starting new_bool_3 with 300s (1) cores
% 123.53/18.74 % Starting new_bool_1 with 300s (1) cores
% 123.53/18.74 % Starting sh5l with 300s (1) cores
% 123.53/18.74 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 267808 completed with status 0
% 123.53/18.74 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 123.53/18.74 % Preprocessing class: FSSSSMSSSSSNFFN.
% 123.53/18.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 123.53/18.74 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 123.53/18.74 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 123.53/18.74 % No SInE strategy applied
% 123.53/18.74 % Search class: FUUPM-FFSF32-DFFFFFNN
% 123.53/18.74 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 123.53/18.74 % Starting SubtermCWHack with 136s (1) cores
% 123.53/18.74 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 123.53/18.74 % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 123.53/18.74 % Starting new_bool_3 with 136s (1) cores
% 123.53/18.74 % Starting new_bool_1 with 136s (1) cores
% 123.53/18.74 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 267814 completed with status 0
% 123.53/18.74 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 123.53/18.74 % Preprocessing class: FSSSSMSSSSSNFFN.
% 123.53/18.74 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 123.53/18.74 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 123.53/18.74 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 123.53/18.74 % No SInE strategy applied
% 123.53/18.74 % Search class: FUUPM-FFSF32-DFFFFFNN
% 123.53/18.74 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 123.53/18.74 % Starting SubtermCWHack with 136s (1) cores
% 123.53/18.74 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 123.53/18.74 % Preprocessing time : 0.002 s
% 123.53/18.74
% 123.53/18.74 % Proof found!
% 123.53/18.74 % SZS status Unsatisfiable
% 123.53/18.74 % SZS output start CNFRefutation
% See solution above
% 123.53/18.74 % Parsed axioms : 15
% 123.53/18.74 % Removed by relevancy pruning/SinE : 0
% 123.53/18.74 % Initial clauses : 15
% 123.53/18.74 % Removed in clause preprocessing : 0
% 123.53/18.74 % Initial clauses in saturation : 15
% 123.53/18.74 % Processed clauses : 5491
% 123.53/18.74 % ...of these trivial : 2805
% 123.53/18.74 % ...subsumed : 1780
% 123.53/18.74 % ...remaining for further processing : 906
% 123.53/18.74 % Other redundant clauses eliminated : 0
% 123.53/18.74 % Clauses deleted for lack of memory : 0
% 123.53/18.74 % Backward-subsumed : 0
% 123.53/18.74 % Backward-rewritten : 151
% 123.53/18.74 % Generated clauses : 374063
% 123.53/18.74 % ...of the previous two non-redundant : 241741
% 123.53/18.74 % ...aggressively subsumed : 0
% 123.53/18.74 % Contextual simplify-reflections : 0
% 123.53/18.74 % Paramodulations : 374063
% 123.53/18.74 % Factorizations : 0
% 123.53/18.74 % NegExts : 0
% 123.53/18.74 % Equation resolutions : 0
% 123.53/18.74 % Disequality decompositions : 0
% 123.53/18.74 % Total rewrite steps : 1094244
% 123.53/18.74 % ...of those cached : 932768
% 123.53/18.74 % Propositional unsat checks : 0
% 123.53/18.74 % Propositional check models : 0
% 123.53/18.74 % Propositional check unsatisfiable : 0
% 123.53/18.74 % Propositional clauses : 0
% 123.53/18.74 % Propositional clauses after purity: 0
% 123.53/18.74 % Propositional unsat core size : 0
% 123.53/18.74 % Propositional preprocessing time : 0.000
% 123.53/18.74 % Propositional encoding time : 0.000
% 123.53/18.74 % Propositional solver time : 0.000
% 123.53/18.74 % Success case prop preproc time : 0.000
% 123.53/18.74 % Success case prop encoding time : 0.000
% 123.53/18.74 % Success case prop solver time : 0.000
% 123.53/18.74 % Current number of processed clauses : 755
% 123.53/18.74 % Positive orientable unit clauses : 746
% 123.53/18.74 % Positive unorientable unit clauses: 8
% 123.53/18.74 % Negative unit clauses : 1
% 123.53/18.74 % Non-unit-clauses : 0
% 123.53/18.74 % Current number of unprocessed clauses: 235887
% 123.53/18.74 % ...number of literals in the above : 235887
% 123.53/18.74 % Current number of archived formulas : 0
% 123.53/18.74 % Current number of archived clauses : 151
% 123.53/18.74 % Clause-clause subsumption calls (NU) : 0
% 123.53/18.74 % Rec. Clause-clause subsumption calls : 0
% 123.53/18.74 % Non-unit clause-clause subsumptions : 0
% 123.53/18.74 % Unit Clause-clause subsumption calls : 124
% 123.53/18.74 % Rewrite failures with RHS unbound : 0
% 123.53/18.74 % BW rewrite match attempts : 10687
% 123.53/18.74 % BW rewrite match successes : 351
% 123.53/18.74 % Condensation attempts : 0
% 123.53/18.74 % Condensation successes : 0
% 123.53/18.74 % Termbank termtop insertions : 11727028
% 123.53/18.74 % Search garbage collected termcells : 2
% 123.53/18.74
% 123.53/18.74 % -------------------------------------------------
% 123.53/18.74 % User time : 16.785 s
% 123.53/18.74 % System time : 0.671 s
% 123.53/18.74 % Total time : 17.456 s
% 123.53/18.74 % Maximum resident set size: 3640 pages
% 123.53/18.74
% 123.53/18.74 % -------------------------------------------------
% 123.53/18.74 % User time : 85.332 s
% 123.53/18.74 % System time : 3.199 s
% 123.53/18.74 % Total time : 88.531 s
% 123.53/18.74 % Maximum resident set size: 4608 pages
% 123.53/18.74 % E exiting
%------------------------------------------------------------------------------