TSTP Solution File: LAT005-4 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT005-4 : TPTP v8.1.2. Released v1.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 18:07:20 EDT 2023
% Result : Unsatisfiable 0.20s 0.68s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 14
% Syntax : Number of clauses : 69 ( 67 unt; 0 nHn; 27 RR)
% Number of literals : 71 ( 70 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 88 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.6Ts0RMuVyH/E---3.1_11387.p',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.6Ts0RMuVyH/E---3.1_11387.p',commutativity_of_join) ).
cnf(modular,axiom,
( meet(X2,join(X1,X3)) = join(X1,meet(X3,X2))
| meet(X1,X2) != X1 ),
file('/export/starexec/sandbox/tmp/tmp.6Ts0RMuVyH/E---3.1_11387.p',modular) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.6Ts0RMuVyH/E---3.1_11387.p',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.6Ts0RMuVyH/E---3.1_11387.p',commutativity_of_meet) ).
cnf(x_meet_0,axiom,
meet(X1,n0) = n0,
file('/export/starexec/sandbox/tmp/tmp.6Ts0RMuVyH/E---3.1_11387.p',x_meet_0) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.6Ts0RMuVyH/E---3.1_11387.p',associativity_of_join) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.6Ts0RMuVyH/E---3.1_11387.p',associativity_of_meet) ).
cnf(r1_complement_join_a_b_2,negated_conjecture,
meet(r1,join(a,b)) = n0,
file('/export/starexec/sandbox/tmp/tmp.6Ts0RMuVyH/E---3.1_11387.p',r1_complement_join_a_b_2) ).
cnf(define_a2,negated_conjecture,
join(r1,meet(b,r2)) = a2,
file('/export/starexec/sandbox/tmp/tmp.6Ts0RMuVyH/E---3.1_11387.p',define_a2) ).
cnf(x_join_0,axiom,
join(X1,n0) = X1,
file('/export/starexec/sandbox/tmp/tmp.6Ts0RMuVyH/E---3.1_11387.p',x_join_0) ).
cnf(define_b2,negated_conjecture,
join(r1,meet(a,r2)) = b2,
file('/export/starexec/sandbox/tmp/tmp.6Ts0RMuVyH/E---3.1_11387.p',define_b2) ).
cnf(r2_complement_meet_a_b_2,negated_conjecture,
meet(r2,meet(a,b)) = n0,
file('/export/starexec/sandbox/tmp/tmp.6Ts0RMuVyH/E---3.1_11387.p',r2_complement_meet_a_b_2) ).
cnf(prove_SAMs_lemma,negated_conjecture,
meet(a2,b2) != r1,
file('/export/starexec/sandbox/tmp/tmp.6Ts0RMuVyH/E---3.1_11387.p',prove_SAMs_lemma) ).
cnf(c_0_14,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_15,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_16,axiom,
( meet(X2,join(X1,X3)) = join(X1,meet(X3,X2))
| meet(X1,X2) != X1 ),
modular ).
cnf(c_0_17,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
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,plain,
join(X1,meet(X2,join(X3,X1))) = meet(join(X3,X1),join(X1,X2)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_21,axiom,
meet(X1,n0) = n0,
x_meet_0 ).
cnf(c_0_22,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
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,plain,
join(meet(X1,X2),meet(X3,X1)) = meet(X1,join(meet(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_20,c_0_18]) ).
cnf(c_0_25,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_26,negated_conjecture,
meet(r1,join(a,b)) = n0,
r1_complement_join_a_b_2 ).
cnf(c_0_27,plain,
meet(n0,X1) = n0,
inference(spm,[status(thm)],[c_0_21,c_0_19]) ).
cnf(c_0_28,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_22,c_0_18]) ).
cnf(c_0_29,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_14]),c_0_22]) ).
cnf(c_0_30,plain,
join(meet(X1,X2),meet(X3,X2)) = meet(X2,join(meet(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_31,plain,
join(meet(X1,X2),meet(X2,X3)) = meet(X2,join(meet(X2,X3),X1)),
inference(spm,[status(thm)],[c_0_15,c_0_24]) ).
cnf(c_0_32,negated_conjecture,
meet(r1,meet(join(a,b),X1)) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
cnf(c_0_33,plain,
join(X1,join(X2,meet(X1,X3))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_28]) ).
cnf(c_0_34,negated_conjecture,
join(r1,meet(b,r2)) = a2,
define_a2 ).
cnf(c_0_35,plain,
meet(X1,join(meet(X1,X2),X3)) = meet(X1,join(meet(X3,X1),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_19]),c_0_31]) ).
cnf(c_0_36,negated_conjecture,
meet(r1,meet(X1,join(a,b))) = n0,
inference(spm,[status(thm)],[c_0_32,c_0_19]) ).
cnf(c_0_37,axiom,
join(X1,n0) = X1,
x_join_0 ).
cnf(c_0_38,negated_conjecture,
join(b,a2) = join(b,r1),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,plain,
meet(X1,join(meet(X1,X2),X3)) = meet(X1,join(X2,meet(X3,X1))),
inference(spm,[status(thm)],[c_0_35,c_0_15]) ).
cnf(c_0_40,negated_conjecture,
meet(b,r1) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_17]),c_0_19]) ).
cnf(c_0_41,plain,
join(n0,X1) = X1,
inference(spm,[status(thm)],[c_0_37,c_0_15]) ).
cnf(c_0_42,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_19]),c_0_25]) ).
cnf(c_0_43,negated_conjecture,
meet(a2,join(b,r1)) = a2,
inference(spm,[status(thm)],[c_0_17,c_0_38]) ).
cnf(c_0_44,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_25,c_0_14]) ).
cnf(c_0_45,negated_conjecture,
meet(join(a,b),join(b,r1)) = b,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_26]),c_0_37]) ).
cnf(c_0_46,negated_conjecture,
meet(b,join(r1,meet(X1,b))) = meet(b,X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_47,negated_conjecture,
join(r1,meet(a,r2)) = b2,
define_b2 ).
cnf(c_0_48,negated_conjecture,
meet(a2,meet(X1,join(b,r1))) = meet(X1,a2),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_49,negated_conjecture,
meet(a,join(b,r1)) = meet(a,b),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_50,plain,
meet(X1,meet(X2,X3)) = meet(X3,meet(X1,X2)),
inference(spm,[status(thm)],[c_0_19,c_0_25]) ).
cnf(c_0_51,negated_conjecture,
meet(b,join(r1,meet(b,X1))) = meet(b,X1),
inference(spm,[status(thm)],[c_0_46,c_0_19]) ).
cnf(c_0_52,negated_conjecture,
meet(b,meet(r2,a2)) = meet(b,r2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_34]),c_0_25]) ).
cnf(c_0_53,plain,
meet(X1,meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_25]) ).
cnf(c_0_54,negated_conjecture,
meet(r2,meet(a,b)) = n0,
r2_complement_meet_a_b_2 ).
cnf(c_0_55,negated_conjecture,
join(a,b2) = join(a,r1),
inference(spm,[status(thm)],[c_0_33,c_0_47]) ).
cnf(c_0_56,negated_conjecture,
meet(r1,a2) = r1,
inference(spm,[status(thm)],[c_0_14,c_0_34]) ).
cnf(c_0_57,negated_conjecture,
meet(a,meet(b,a2)) = meet(a,a2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_19]),c_0_42]) ).
cnf(c_0_58,negated_conjecture,
meet(b,a2) = meet(b,r2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_34]) ).
cnf(c_0_59,negated_conjecture,
meet(a,meet(b,r2)) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_21]),c_0_25]) ).
cnf(c_0_60,negated_conjecture,
meet(b2,join(a,r1)) = b2,
inference(spm,[status(thm)],[c_0_17,c_0_55]) ).
cnf(c_0_61,negated_conjecture,
join(r1,meet(X1,a2)) = meet(a2,join(r1,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_56]) ).
cnf(c_0_62,negated_conjecture,
meet(a,a2) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_58]),c_0_59]) ).
cnf(c_0_63,negated_conjecture,
meet(a2,b2) != r1,
prove_SAMs_lemma ).
cnf(c_0_64,negated_conjecture,
meet(b2,meet(X1,join(a,r1))) = meet(X1,b2),
inference(spm,[status(thm)],[c_0_42,c_0_60]) ).
cnf(c_0_65,negated_conjecture,
meet(a2,join(a,r1)) = r1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_37]),c_0_15]) ).
cnf(c_0_66,negated_conjecture,
meet(r1,b2) = r1,
inference(spm,[status(thm)],[c_0_14,c_0_47]) ).
cnf(c_0_67,negated_conjecture,
meet(b2,a2) != r1,
inference(rw,[status(thm)],[c_0_63,c_0_19]) ).
cnf(c_0_68,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_65]),c_0_19]),c_0_66]),c_0_19]),c_0_67]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.13 % Problem : LAT005-4 : TPTP v8.1.2. Released v1.1.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n026.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 2400
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon Oct 2 10:42:29 EDT 2023
% 0.14/0.36 % CPUTime :
% 0.20/0.49 Running first-order theorem proving
% 0.20/0.49 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/tmp/tmp.6Ts0RMuVyH/E---3.1_11387.p
% 0.20/0.68 # Version: 3.1pre001
% 0.20/0.68 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.68 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.68 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.68 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.68 # Starting sh5l with 300s (1) cores
% 0.20/0.68 # sh5l with pid 11473 completed with status 0
% 0.20/0.68 # Result found by sh5l
% 0.20/0.68 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.68 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.68 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.68 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.68 # Starting sh5l with 300s (1) cores
% 0.20/0.68 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.68 # Search class: FHUPM-FFSM22-SFFFFFNN
% 0.20/0.68 # partial match(2): FHUSM-FFSF22-SFFFFFNN
% 0.20/0.68 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.68 # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.20/0.68 # G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with pid 11480 completed with status 0
% 0.20/0.68 # Result found by G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S
% 0.20/0.68 # Preprocessing class: FSMSSMSMSSSNFFN.
% 0.20/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.68 # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 0.20/0.68 # Starting new_bool_3 with 300s (1) cores
% 0.20/0.68 # Starting new_bool_1 with 300s (1) cores
% 0.20/0.68 # Starting sh5l with 300s (1) cores
% 0.20/0.68 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.20/0.68 # Search class: FHUPM-FFSM22-SFFFFFNN
% 0.20/0.68 # partial match(2): FHUSM-FFSF22-SFFFFFNN
% 0.20/0.68 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.68 # Starting G----_Y1346__C12_02_nc_F1_AE_CS_SP_S2S with 181s (1) cores
% 0.20/0.68 # Preprocessing time : 0.001 s
% 0.20/0.68 # Presaturation interreduction done
% 0.20/0.68
% 0.20/0.68 # Proof found!
% 0.20/0.68 # SZS status Unsatisfiable
% 0.20/0.68 # SZS output start CNFRefutation
% See solution above
% 0.20/0.68 # Parsed axioms : 20
% 0.20/0.68 # Removed by relevancy pruning/SinE : 0
% 0.20/0.68 # Initial clauses : 20
% 0.20/0.68 # Removed in clause preprocessing : 0
% 0.20/0.68 # Initial clauses in saturation : 20
% 0.20/0.68 # Processed clauses : 2186
% 0.20/0.68 # ...of these trivial : 1047
% 0.20/0.68 # ...subsumed : 633
% 0.20/0.68 # ...remaining for further processing : 506
% 0.20/0.68 # Other redundant clauses eliminated : 0
% 0.20/0.68 # Clauses deleted for lack of memory : 0
% 0.20/0.68 # Backward-subsumed : 1
% 0.20/0.68 # Backward-rewritten : 122
% 0.20/0.68 # Generated clauses : 30654
% 0.20/0.68 # ...of the previous two non-redundant : 14249
% 0.20/0.68 # ...aggressively subsumed : 0
% 0.20/0.68 # Contextual simplify-reflections : 0
% 0.20/0.68 # Paramodulations : 30654
% 0.20/0.68 # Factorizations : 0
% 0.20/0.68 # NegExts : 0
% 0.20/0.68 # Equation resolutions : 0
% 0.20/0.68 # Total rewrite steps : 52195
% 0.20/0.68 # Propositional unsat checks : 0
% 0.20/0.68 # Propositional check models : 0
% 0.20/0.68 # Propositional check unsatisfiable : 0
% 0.20/0.68 # Propositional clauses : 0
% 0.20/0.68 # Propositional clauses after purity: 0
% 0.20/0.68 # Propositional unsat core size : 0
% 0.20/0.68 # Propositional preprocessing time : 0.000
% 0.20/0.68 # Propositional encoding time : 0.000
% 0.20/0.68 # Propositional solver time : 0.000
% 0.20/0.68 # Success case prop preproc time : 0.000
% 0.20/0.68 # Success case prop encoding time : 0.000
% 0.20/0.68 # Success case prop solver time : 0.000
% 0.20/0.68 # Current number of processed clauses : 363
% 0.20/0.68 # Positive orientable unit clauses : 339
% 0.20/0.68 # Positive unorientable unit clauses: 6
% 0.20/0.68 # Negative unit clauses : 1
% 0.20/0.68 # Non-unit-clauses : 17
% 0.20/0.68 # Current number of unprocessed clauses: 11865
% 0.20/0.68 # ...number of literals in the above : 12596
% 0.20/0.68 # Current number of archived formulas : 0
% 0.20/0.68 # Current number of archived clauses : 143
% 0.20/0.68 # Clause-clause subsumption calls (NU) : 90
% 0.20/0.68 # Rec. Clause-clause subsumption calls : 90
% 0.20/0.68 # Non-unit clause-clause subsumptions : 18
% 0.20/0.68 # Unit Clause-clause subsumption calls : 117
% 0.20/0.68 # Rewrite failures with RHS unbound : 0
% 0.20/0.68 # BW rewrite match attempts : 1281
% 0.20/0.68 # BW rewrite match successes : 616
% 0.20/0.68 # Condensation attempts : 0
% 0.20/0.68 # Condensation successes : 0
% 0.20/0.68 # Termbank termtop insertions : 324358
% 0.20/0.68
% 0.20/0.68 # -------------------------------------------------
% 0.20/0.68 # User time : 0.169 s
% 0.20/0.68 # System time : 0.011 s
% 0.20/0.68 # Total time : 0.181 s
% 0.20/0.68 # Maximum resident set size: 1656 pages
% 0.20/0.68
% 0.20/0.68 # -------------------------------------------------
% 0.20/0.68 # User time : 0.171 s
% 0.20/0.68 # System time : 0.013 s
% 0.20/0.68 # Total time : 0.184 s
% 0.20/0.68 # Maximum resident set size: 1676 pages
% 0.20/0.68 % E---3.1 exiting
% 0.20/0.68 % E---3.1 exiting
%------------------------------------------------------------------------------