%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LAT234-1 : TPTP v9.3.1. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n013.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:48 PM UTC 2026
% Result : Unsatisfiable 1.04s 0.72s
% Output : CNFRefutation 1.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 13
% Syntax : Number of clauses : 48 ( 45 unt; 0 nHn; 15 RR)
% Number of literals : 54 ( 53 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 69 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',idempotence_of_join) ).
cnf(complement_join,axiom,
join(X1,complement(X1)) = one,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-4.ax',complement_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',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/Axioms/LAT001-0.ax',commutativity_of_join) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(equation_H32,axiom,
meet(X1,join(X2,meet(X1,meet(X3,X4)))) = meet(X1,join(X2,meet(X3,join(meet(X1,X4),meet(X2,X4))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',equation_H32) ).
cnf(complement_meet,axiom,
meet(X1,complement(X1)) = zero,
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-4.ax',complement_meet) ).
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(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,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
file('/export/starexec/sandbox/benchmark/Axioms/LAT001-4.ax',meet_join_complement) ).
cnf(c_0_13,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_14,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_15,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_16,axiom,
join(X1,complement(X1)) = one,
complement_join ).
cnf(c_0_17,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_18,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_19,hypothesis,
meet(b,a) = a,
prove_distributivity_hypothesis ).
cnf(c_0_20,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_21,plain,
join(X1,one) = one,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,hypothesis,
meet(a,b) = a,
inference(rw,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_24,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_25,plain,
join(X1,join(complement(X1),X2)) = join(one,X2),
inference(spm,[status(thm)],[c_0_13,c_0_16]) ).
cnf(c_0_26,plain,
join(one,X1) = one,
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
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_13,c_0_20]),c_0_13]) ).
cnf(c_0_28,hypothesis,
join(a,b) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_20]) ).
cnf(c_0_29,axiom,
meet(X1,join(X2,meet(X1,meet(X3,X4)))) = meet(X1,join(X2,meet(X3,join(meet(X1,X4),meet(X2,X4))))),
equation_H32 ).
cnf(c_0_30,plain,
meet(X1,one) = X1,
inference(spm,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_31,plain,
join(X1,join(complement(X1),X2)) = one,
inference(rw,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,hypothesis,
join(a,join(X1,b)) = join(X1,b),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_33,plain,
meet(X1,join(X2,meet(X3,join(X1,X2)))) = meet(X1,join(X2,meet(X1,X3))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_30]),c_0_30]) ).
cnf(c_0_34,hypothesis,
join(b,complement(a)) = one,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_20]) ).
cnf(c_0_35,axiom,
meet(X1,complement(X1)) = zero,
complement_meet ).
cnf(c_0_36,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_37,hypothesis,
meet(b,join(complement(a),meet(b,X1))) = meet(b,join(complement(a),X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_30]) ).
cnf(c_0_38,plain,
join(X1,zero) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_35]) ).
cnf(c_0_39,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
inference(fof_simplification,[status(thm)],[prove_distributivity]) ).
cnf(c_0_40,plain,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
inference(fof_simplification,[status(thm)],[meet_join_complement]) ).
cnf(c_0_41,hypothesis,
meet(a,meet(b,X1)) = meet(a,X1),
inference(spm,[status(thm)],[c_0_36,c_0_23]) ).
cnf(c_0_42,hypothesis,
meet(b,join(complement(a),complement(b))) = meet(b,complement(a)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_35]),c_0_38]) ).
cnf(c_0_43,negated_conjecture,
join(complement(b),complement(a)) != complement(a),
c_0_39 ).
cnf(c_0_44,plain,
( join(X1,X2) != one
| meet(X1,X2) != zero
| complement(X1) = X2 ),
c_0_40 ).
cnf(c_0_45,hypothesis,
meet(a,join(complement(a),complement(b))) = zero,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_41]),c_0_35]) ).
cnf(c_0_46,negated_conjecture,
join(complement(a),complement(b)) != complement(a),
inference(rw,[status(thm)],[c_0_43,c_0_20]) ).
cnf(c_0_47,hypothesis,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_31])]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT234-1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n013.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Sun Sep 20 23:21:36 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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
% 1.04/0.72 % Version: 3.5.1
% 1.04/0.72 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.04/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.04/0.72 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.04/0.72 % Starting new_bool_3 with 300s (1) cores
% 1.04/0.72 % Starting new_bool_1 with 300s (1) cores
% 1.04/0.72 % Starting sh5l with 300s (1) cores
% 1.04/0.72 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3615423 completed with status 0
% 1.04/0.72 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.04/0.72 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.04/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.04/0.72 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.04/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.04/0.72 % No SInE strategy applied
% 1.04/0.72 % Search class: FHUPM-FFSF21-MFFFFFNN
% 1.04/0.72 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.04/0.72 % Starting SubtermCWHack with 136s (1) cores
% 1.04/0.72 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.04/0.72 % Starting G-E--_303_C18_F1_URBAN_S0Y with 136s (1) cores
% 1.04/0.72 % Starting G----_X1276__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 1.04/0.72 % Starting new_bool_3 with 136s (1) cores
% 1.04/0.72 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3615429 completed with status 0
% 1.04/0.72 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.04/0.72 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.04/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.04/0.72 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.04/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.04/0.72 % No SInE strategy applied
% 1.04/0.72 % Search class: FHUPM-FFSF21-MFFFFFNN
% 1.04/0.72 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.04/0.72 % Starting SubtermCWHack with 136s (1) cores
% 1.04/0.72 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.04/0.72 % Preprocessing time : 0.001 s
% 1.04/0.72
% 1.04/0.72 % Proof found!
% 1.04/0.72 % SZS status Unsatisfiable
% 1.04/0.72 % SZS output start CNFRefutation
% See solution above
% 1.04/0.72 % Parsed axioms : 14
% 1.04/0.72 % Removed by relevancy pruning/SinE : 0
% 1.04/0.72 % Initial clauses : 14
% 1.04/0.72 % Removed in clause preprocessing : 0
% 1.04/0.72 % Initial clauses in saturation : 14
% 1.04/0.72 % Processed clauses : 1111
% 1.04/0.72 % ...of these trivial : 354
% 1.04/0.72 % ...subsumed : 527
% 1.04/0.72 % ...remaining for further processing : 230
% 1.04/0.72 % Other redundant clauses eliminated : 0
% 1.04/0.72 % Clauses deleted for lack of memory : 0
% 1.04/0.72 % Backward-subsumed : 34
% 1.04/0.72 % Backward-rewritten : 29
% 1.04/0.72 % Generated clauses : 15307
% 1.04/0.72 % ...of the previous two non-redundant : 9830
% 1.04/0.72 % ...aggressively subsumed : 0
% 1.04/0.72 % Contextual simplify-reflections : 3
% 1.04/0.72 % Paramodulations : 15306
% 1.04/0.72 % Factorizations : 0
% 1.04/0.72 % NegExts : 0
% 1.04/0.72 % Equation resolutions : 1
% 1.04/0.72 % Disequality decompositions : 0
% 1.04/0.72 % Total rewrite steps : 22608
% 1.04/0.72 % ...of those cached : 16508
% 1.04/0.72 % Propositional unsat checks : 0
% 1.04/0.72 % Propositional check models : 0
% 1.04/0.72 % Propositional check unsatisfiable : 0
% 1.04/0.72 % Propositional clauses : 0
% 1.04/0.72 % Propositional clauses after purity: 0
% 1.04/0.72 % Propositional unsat core size : 0
% 1.04/0.72 % Propositional preprocessing time : 0.000
% 1.04/0.72 % Propositional encoding time : 0.000
% 1.04/0.72 % Propositional solver time : 0.000
% 1.04/0.72 % Success case prop preproc time : 0.000
% 1.04/0.72 % Success case prop encoding time : 0.000
% 1.04/0.72 % Success case prop solver time : 0.000
% 1.04/0.72 % Current number of processed clauses : 167
% 1.04/0.72 % Positive orientable unit clauses : 120
% 1.04/0.72 % Positive unorientable unit clauses: 8
% 1.04/0.72 % Negative unit clauses : 7
% 1.04/0.72 % Non-unit-clauses : 32
% 1.04/0.72 % Current number of unprocessed clauses: 8578
% 1.04/0.72 % ...number of literals in the above : 12350
% 1.04/0.72 % Current number of archived formulas : 0
% 1.04/0.72 % Current number of archived clauses : 63
% 1.04/0.72 % Clause-clause subsumption calls (NU) : 1027
% 1.04/0.72 % Rec. Clause-clause subsumption calls : 846
% 1.04/0.72 % Non-unit clause-clause subsumptions : 253
% 1.04/0.72 % Unit Clause-clause subsumption calls : 108
% 1.04/0.72 % Rewrite failures with RHS unbound : 0
% 1.04/0.72 % BW rewrite match attempts : 701
% 1.04/0.72 % BW rewrite match successes : 163
% 1.04/0.72 % Condensation attempts : 0
% 1.04/0.72 % Condensation successes : 0
% 1.04/0.72 % Termbank termtop insertions : 203784
% 1.04/0.72 % Search garbage collected termcells : 8
% 1.04/0.72
% 1.04/0.72 % -------------------------------------------------
% 1.04/0.72 % User time : 0.230 s
% 1.04/0.72 % System time : 0.021 s
% 1.04/0.72 % Total time : 0.251 s
% 1.04/0.72 % Maximum resident set size: 3640 pages
% 1.04/0.72
% 1.04/0.72 % -------------------------------------------------
% 1.04/0.72 % User time : 1.119 s
% 1.04/0.72 % System time : 0.090 s
% 1.04/0.72 % Total time : 1.209 s
% 1.04/0.72 % Maximum resident set size: 4864 pages
% 1.04/0.72 % E exiting
%------------------------------------------------------------------------------