%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LAT043-1 : TPTP v9.3.1. Released v2.5.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:04:07 PM UTC 2026
% Result : Unsatisfiable 1.95s 0.73s
% Output : CNFRefutation 1.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 13
% Syntax : Number of clauses : 58 ( 58 unt; 0 nHn; 4 RR)
% Number of literals : 58 ( 57 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 : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 103 ( 13 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(invertability2,axiom,
meet(complement(X1),X1) = n0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',invertability2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_meet) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_join) ).
cnf(invertability1,axiom,
join(complement(X1),X1) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',invertability1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',commutativity_of_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption2) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',idempotence_of_meet) ).
cnf(distributivity,axiom,
meet(X1,join(X2,X3)) = join(meet(X1,X2),meet(X1,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distributivity) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/benchmark/Axioms/LAT001-0.ax',absorption1) ).
cnf(invertability3,axiom,
complement(complement(X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',invertability3) ).
cnf(prove_compatability_law,negated_conjecture,
complement(join(c,d)) != meet(complement(c),complement(d)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_compatability_law) ).
cnf(c_0_13,axiom,
meet(complement(X1),X1) = n0,
invertability2 ).
cnf(c_0_14,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_15,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_16,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_17,axiom,
join(complement(X1),X1) = n1,
invertability1 ).
cnf(c_0_18,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_19,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_20,plain,
meet(X1,complement(X1)) = n0,
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_21,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_22,plain,
join(X1,complement(X1)) = n1,
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_23,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_24,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_25,axiom,
meet(X1,join(X2,X3)) = join(meet(X1,X2),meet(X1,X3)),
distributivity ).
cnf(c_0_26,plain,
join(X1,n0) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_15,c_0_19]) ).
cnf(c_0_28,plain,
join(X1,n1) = n1,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_30,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,plain,
meet(X1,join(X2,complement(X1))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_26]) ).
cnf(c_0_32,axiom,
complement(complement(X1)) = X1,
invertability3 ).
cnf(c_0_33,plain,
join(n0,X1) = X1,
inference(spm,[status(thm)],[c_0_18,c_0_26]) ).
cnf(c_0_34,plain,
join(X1,complement(meet(X1,X2))) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_22]),c_0_28]) ).
cnf(c_0_35,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_18]) ).
cnf(c_0_36,plain,
join(X1,join(X2,meet(join(X1,X2),X3))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_15]) ).
cnf(c_0_37,plain,
meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_30]),c_0_25]) ).
cnf(c_0_38,plain,
meet(complement(X1),join(X2,X1)) = meet(complement(X1),X2),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,plain,
meet(X1,join(complement(X1),X2)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_20]),c_0_33]) ).
cnf(c_0_40,plain,
join(X1,complement(meet(X2,X1))) = n1,
inference(spm,[status(thm)],[c_0_34,c_0_14]) ).
cnf(c_0_41,plain,
meet(X1,n1) = X1,
inference(spm,[status(thm)],[c_0_29,c_0_22]) ).
cnf(c_0_42,plain,
join(X1,meet(join(X2,X1),X3)) = meet(join(X2,X1),join(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_14]),c_0_37]) ).
cnf(c_0_43,plain,
meet(join(X1,X2),complement(X2)) = meet(complement(X2),X1),
inference(spm,[status(thm)],[c_0_14,c_0_38]) ).
cnf(c_0_44,plain,
meet(X1,complement(meet(X2,complement(X1)))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_45,plain,
meet(X1,meet(X2,complement(meet(X1,X2)))) = n0,
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_46,plain,
join(X1,meet(complement(X1),X2)) = join(X2,X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_22]),c_0_41]) ).
cnf(c_0_47,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_19,c_0_14]) ).
cnf(c_0_48,plain,
meet(complement(X1),complement(meet(X2,X1))) = complement(X1),
inference(spm,[status(thm)],[c_0_44,c_0_32]) ).
cnf(c_0_49,plain,
meet(X1,join(X2,meet(X3,complement(meet(X1,X3))))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_45]),c_0_26]) ).
cnf(c_0_50,plain,
join(complement(X1),meet(X1,X2)) = join(X2,complement(X1)),
inference(spm,[status(thm)],[c_0_46,c_0_32]) ).
cnf(c_0_51,plain,
join(complement(X1),complement(meet(X2,X1))) = complement(meet(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_18]) ).
cnf(c_0_52,negated_conjecture,
complement(join(c,d)) != meet(complement(c),complement(d)),
inference(fof_simplification,[status(thm)],[prove_compatability_law]) ).
cnf(c_0_53,plain,
meet(X1,complement(meet(X1,X2))) = meet(X1,complement(X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_18]),c_0_51]) ).
cnf(c_0_54,plain,
meet(complement(X1),complement(join(X2,X1))) = complement(join(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_35]),c_0_14]) ).
cnf(c_0_55,negated_conjecture,
complement(join(c,d)) != meet(complement(c),complement(d)),
c_0_52 ).
cnf(c_0_56,plain,
meet(complement(X1),complement(X2)) = complement(join(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_38]),c_0_53]),c_0_54]) ).
cnf(c_0_57,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LAT043-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n007.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 20 23:06:05 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.44 Running first-order theorem proving
% 0.15/0.44 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
% 1.95/0.73 % Version: 3.5.1
% 1.95/0.73 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.95/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.95/0.73 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.95/0.73 % Starting new_bool_3 with 300s (1) cores
% 1.95/0.73 % Starting new_bool_1 with 300s (1) cores
% 1.95/0.73 % Starting sh5l with 300s (1) cores
% 1.95/0.73 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3783466 completed with status 0
% 1.95/0.73 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.95/0.73 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.95/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.95/0.73 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.95/0.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.95/0.73 % No SInE strategy applied
% 1.95/0.73 % Search class: FUUPM-FFSF21-SFFFFFNN
% 1.95/0.73 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.95/0.73 % Starting SubtermCWHack with 136s (1) cores
% 1.95/0.73 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.95/0.73 % Starting SAT001_MinMin_p005000_rr_RG with 136s (1) cores
% 1.95/0.73 % Starting new_bool_3 with 136s (1) cores
% 1.95/0.73 % Starting new_bool_1 with 136s (1) cores
% 1.95/0.73 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3783471 completed with status 0
% 1.95/0.73 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 1.95/0.73 % Preprocessing class: FSSSSMSSSSSNFFN.
% 1.95/0.73 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.95/0.73 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 1.95/0.73 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 1.95/0.73 % No SInE strategy applied
% 1.95/0.73 % Search class: FUUPM-FFSF21-SFFFFFNN
% 1.95/0.73 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 1.95/0.73 % Starting SubtermCWHack with 136s (1) cores
% 1.95/0.73 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 1.95/0.73 % Preprocessing time : 0.001 s
% 1.95/0.73
% 1.95/0.73 % Proof found!
% 1.95/0.73 % SZS status Unsatisfiable
% 1.95/0.73 % SZS output start CNFRefutation
% See solution above
% 1.95/0.73 % Parsed axioms : 13
% 1.95/0.73 % Removed by relevancy pruning/SinE : 0
% 1.95/0.73 % Initial clauses : 13
% 1.95/0.73 % Removed in clause preprocessing : 0
% 1.95/0.73 % Initial clauses in saturation : 13
% 1.95/0.73 % Processed clauses : 832
% 1.95/0.73 % ...of these trivial : 321
% 1.95/0.73 % ...subsumed : 347
% 1.95/0.73 % ...remaining for further processing : 164
% 1.95/0.73 % Other redundant clauses eliminated : 0
% 1.95/0.73 % Clauses deleted for lack of memory : 0
% 1.95/0.73 % Backward-subsumed : 0
% 1.95/0.73 % Backward-rewritten : 24
% 1.95/0.73 % Generated clauses : 18636
% 1.95/0.73 % ...of the previous two non-redundant : 10891
% 1.95/0.73 % ...aggressively subsumed : 0
% 1.95/0.73 % Contextual simplify-reflections : 0
% 1.95/0.73 % Paramodulations : 18636
% 1.95/0.73 % Factorizations : 0
% 1.95/0.73 % NegExts : 0
% 1.95/0.73 % Equation resolutions : 0
% 1.95/0.73 % Disequality decompositions : 0
% 1.95/0.73 % Total rewrite steps : 26713
% 1.95/0.73 % ...of those cached : 19978
% 1.95/0.73 % Propositional unsat checks : 0
% 1.95/0.73 % Propositional check models : 0
% 1.95/0.73 % Propositional check unsatisfiable : 0
% 1.95/0.73 % Propositional clauses : 0
% 1.95/0.73 % Propositional clauses after purity: 0
% 1.95/0.73 % Propositional unsat core size : 0
% 1.95/0.73 % Propositional preprocessing time : 0.000
% 1.95/0.73 % Propositional encoding time : 0.000
% 1.95/0.73 % Propositional solver time : 0.000
% 1.95/0.73 % Success case prop preproc time : 0.000
% 1.95/0.73 % Success case prop encoding time : 0.000
% 1.95/0.73 % Success case prop solver time : 0.000
% 1.95/0.73 % Current number of processed clauses : 140
% 1.95/0.73 % Positive orientable unit clauses : 132
% 1.95/0.73 % Positive unorientable unit clauses: 8
% 1.95/0.73 % Negative unit clauses : 0
% 1.95/0.73 % Non-unit-clauses : 0
% 1.95/0.73 % Current number of unprocessed clauses: 10004
% 1.95/0.73 % ...number of literals in the above : 10004
% 1.95/0.73 % Current number of archived formulas : 0
% 1.95/0.73 % Current number of archived clauses : 24
% 1.95/0.73 % Clause-clause subsumption calls (NU) : 0
% 1.95/0.73 % Rec. Clause-clause subsumption calls : 0
% 1.95/0.73 % Non-unit clause-clause subsumptions : 0
% 1.95/0.73 % Unit Clause-clause subsumption calls : 29
% 1.95/0.73 % Rewrite failures with RHS unbound : 0
% 1.95/0.73 % BW rewrite match attempts : 533
% 1.95/0.73 % BW rewrite match successes : 142
% 1.95/0.73 % Condensation attempts : 0
% 1.95/0.73 % Condensation successes : 0
% 1.95/0.73 % Termbank termtop insertions : 164179
% 1.95/0.73 % Search garbage collected termcells : 2
% 1.95/0.73
% 1.95/0.73 % -------------------------------------------------
% 1.95/0.73 % User time : 0.179 s
% 1.95/0.73 % System time : 0.013 s
% 1.95/0.73 % Total time : 0.192 s
% 1.95/0.73 % Maximum resident set size: 3636 pages
% 1.95/0.73
% 1.95/0.73 % -------------------------------------------------
% 1.95/0.73 % User time : 0.989 s
% 1.95/0.73 % System time : 0.057 s
% 1.95/0.73 % Total time : 1.047 s
% 1.95/0.73 % Maximum resident set size: 4864 pages
% 1.95/0.73 % E exiting
%------------------------------------------------------------------------------