TSTP Solution File: LAT005-3 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT005-3 : TPTP v8.1.2. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n027.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 4.26s 0.99s
% Output : CNFRefutation 4.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 16
% Syntax : Number of clauses : 68 ( 62 unt; 0 nHn; 22 RR)
% Number of literals : 74 ( 65 equ; 11 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 114 ( 14 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.TM2n2kkIBJ/E---3.1_9170.p',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.TM2n2kkIBJ/E---3.1_9170.p',commutativity_of_join) ).
cnf(modular,axiom,
( meet(X2,join(X1,X3)) = join(X1,meet(X3,X2))
| meet(X1,X2) != X1 ),
file('/export/starexec/sandbox2/tmp/tmp.TM2n2kkIBJ/E---3.1_9170.p',modular) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.TM2n2kkIBJ/E---3.1_9170.p',commutativity_of_meet) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.TM2n2kkIBJ/E---3.1_9170.p',absorption2) ).
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.TM2n2kkIBJ/E---3.1_9170.p',associativity_of_meet) ).
cnf(complement_join,axiom,
( join(X1,X2) = n1
| ~ complement(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.TM2n2kkIBJ/E---3.1_9170.p',complement_join) ).
cnf(complement_of_a_meet_b,hypothesis,
complement(r2,meet(a,b)),
file('/export/starexec/sandbox2/tmp/tmp.TM2n2kkIBJ/E---3.1_9170.p',complement_of_a_meet_b) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.TM2n2kkIBJ/E---3.1_9170.p',associativity_of_join) ).
cnf(x_meet_1,axiom,
meet(X1,n1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.TM2n2kkIBJ/E---3.1_9170.p',x_meet_1) ).
cnf(complement_meet,axiom,
( meet(X1,X2) = n0
| ~ complement(X1,X2) ),
file('/export/starexec/sandbox2/tmp/tmp.TM2n2kkIBJ/E---3.1_9170.p',complement_meet) ).
cnf(complement_of_a_join_b,hypothesis,
complement(r1,join(a,b)),
file('/export/starexec/sandbox2/tmp/tmp.TM2n2kkIBJ/E---3.1_9170.p',complement_of_a_join_b) ).
cnf(x_meet_0,axiom,
meet(X1,n0) = n0,
file('/export/starexec/sandbox2/tmp/tmp.TM2n2kkIBJ/E---3.1_9170.p',x_meet_0) ).
cnf(prove_lemma,negated_conjecture,
r1 != meet(join(r1,meet(r2,b)),join(r1,meet(r2,a))),
file('/export/starexec/sandbox2/tmp/tmp.TM2n2kkIBJ/E---3.1_9170.p',prove_lemma) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.TM2n2kkIBJ/E---3.1_9170.p',idempotence_of_meet) ).
cnf(x_join_0,axiom,
join(X1,n0) = X1,
file('/export/starexec/sandbox2/tmp/tmp.TM2n2kkIBJ/E---3.1_9170.p',x_join_0) ).
cnf(c_0_16,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_17,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_18,axiom,
( meet(X2,join(X1,X3)) = join(X1,meet(X3,X2))
| meet(X1,X2) != X1 ),
modular ).
cnf(c_0_19,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_21,plain,
join(X1,meet(X2,join(X3,X1))) = meet(join(X3,X1),join(X1,X2)),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_22,plain,
join(X1,meet(X2,join(X1,X3))) = meet(join(X1,X3),join(X1,X2)),
inference(spm,[status(thm)],[c_0_18,c_0_16]) ).
cnf(c_0_23,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_24,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_25,plain,
meet(join(X1,X2),join(X3,X1)) = join(X1,meet(X2,join(X3,X1))),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
meet(join(X1,X2),join(X1,X3)) = join(X1,meet(X2,join(X1,X3))),
inference(spm,[status(thm)],[c_0_20,c_0_22]) ).
cnf(c_0_27,plain,
meet(join(X1,X2),join(X2,X3)) = join(X2,meet(join(X1,X2),X3)),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_28,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_20]) ).
cnf(c_0_29,plain,
meet(X1,meet(X2,join(meet(X1,X2),X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_30,plain,
meet(X1,join(meet(X1,X2),X3)) = join(meet(X1,X2),meet(X3,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_23]),c_0_20]) ).
cnf(c_0_31,axiom,
( join(X1,X2) = n1
| ~ complement(X1,X2) ),
complement_join ).
cnf(c_0_32,hypothesis,
complement(r2,meet(a,b)),
complement_of_a_meet_b ).
cnf(c_0_33,plain,
join(X1,meet(join(X2,X1),X3)) = join(X1,meet(X2,join(X1,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_17]),c_0_27]) ).
cnf(c_0_34,plain,
join(meet(X1,X2),meet(X2,join(meet(X1,X2),X3))) = meet(X2,join(meet(X1,X2),X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_17]) ).
cnf(c_0_35,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_36,plain,
meet(X1,join(meet(X1,X2),X3)) = join(meet(X1,X2),meet(X1,X3)),
inference(spm,[status(thm)],[c_0_30,c_0_20]) ).
cnf(c_0_37,hypothesis,
join(meet(a,b),r2) = n1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_17]) ).
cnf(c_0_38,axiom,
meet(X1,n1) = X1,
x_meet_1 ).
cnf(c_0_39,axiom,
( meet(X1,X2) = n0
| ~ complement(X1,X2) ),
complement_meet ).
cnf(c_0_40,hypothesis,
complement(r1,join(a,b)),
complement_of_a_join_b ).
cnf(c_0_41,axiom,
meet(X1,n0) = n0,
x_meet_0 ).
cnf(c_0_42,plain,
meet(X1,join(meet(X2,X1),X3)) = join(meet(X2,X1),meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_28]),c_0_34]) ).
cnf(c_0_43,plain,
join(X1,join(meet(X2,X1),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_35,c_0_28]) ).
cnf(c_0_44,hypothesis,
join(meet(a,b),meet(a,r2)) = a,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_45,negated_conjecture,
r1 != meet(join(r1,meet(r2,b)),join(r1,meet(r2,a))),
prove_lemma ).
cnf(c_0_46,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_24,c_0_16]) ).
cnf(c_0_47,hypothesis,
meet(r1,join(a,b)) = n0,
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_48,plain,
meet(n0,X1) = n0,
inference(spm,[status(thm)],[c_0_41,c_0_20]) ).
cnf(c_0_49,plain,
meet(X1,join(X2,meet(X3,X1))) = join(meet(X3,X1),meet(X1,X2)),
inference(spm,[status(thm)],[c_0_42,c_0_17]) ).
cnf(c_0_50,hypothesis,
join(b,meet(a,r2)) = join(a,b),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_17]) ).
cnf(c_0_51,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_52,negated_conjecture,
meet(join(r1,meet(a,r2)),join(r1,meet(b,r2))) != r1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_20]),c_0_20]),c_0_20]) ).
cnf(c_0_53,plain,
meet(join(X1,X2),join(X3,X2)) = join(X2,meet(X1,join(X3,X2))),
inference(spm,[status(thm)],[c_0_25,c_0_17]) ).
cnf(c_0_54,plain,
meet(X1,meet(X2,join(X1,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_46,c_0_20]) ).
cnf(c_0_55,hypothesis,
meet(r1,meet(join(a,b),X1)) = n0,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_47]),c_0_48]) ).
cnf(c_0_56,hypothesis,
meet(join(a,b),r2) = join(meet(a,r2),meet(b,r2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_20]),c_0_20]) ).
cnf(c_0_57,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_24,c_0_51]) ).
cnf(c_0_58,negated_conjecture,
join(r1,meet(a,meet(r2,join(r1,meet(b,r2))))) != r1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_26]),c_0_24]) ).
cnf(c_0_59,plain,
meet(X1,join(X2,meet(X3,X1))) = join(meet(X3,X1),meet(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_28]),c_0_20]) ).
cnf(c_0_60,plain,
meet(X1,join(X2,meet(X3,join(X1,X2)))) = meet(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_54,c_0_25]) ).
cnf(c_0_61,hypothesis,
meet(r1,join(meet(a,r2),meet(b,r2))) = n0,
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,axiom,
join(X1,n0) = X1,
x_join_0 ).
cnf(c_0_63,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_57,c_0_20]) ).
cnf(c_0_64,hypothesis,
meet(a,meet(b,r2)) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_32]),c_0_20]),c_0_24]) ).
cnf(c_0_65,negated_conjecture,
join(r1,meet(a,join(meet(r1,r2),meet(b,r2)))) != r1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_17]) ).
cnf(c_0_66,hypothesis,
meet(a,join(meet(r1,r2),meet(b,r2))) = n0,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_62]),c_0_24]),c_0_63]),c_0_64]),c_0_24]),c_0_42]),c_0_20]),c_0_17]) ).
cnf(c_0_67,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_65,c_0_66]),c_0_62])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : LAT005-3 : TPTP v8.1.2. Released v1.0.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n027.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 2400
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon Oct 2 11:14:45 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.17/0.44 Running first-order theorem proving
% 0.17/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/tmp/tmp.TM2n2kkIBJ/E---3.1_9170.p
% 4.26/0.99 # Version: 3.1pre001
% 4.26/0.99 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.26/0.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.26/0.99 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.26/0.99 # Starting new_bool_3 with 300s (1) cores
% 4.26/0.99 # Starting new_bool_1 with 300s (1) cores
% 4.26/0.99 # Starting sh5l with 300s (1) cores
% 4.26/0.99 # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 9248 completed with status 0
% 4.26/0.99 # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 4.26/0.99 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.26/0.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.26/0.99 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.26/0.99 # No SInE strategy applied
% 4.26/0.99 # Search class: FHUSM-FFSF22-MFFFFFNN
% 4.26/0.99 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.26/0.99 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 811s (1) cores
% 4.26/0.99 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 4.26/0.99 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S4d with 136s (1) cores
% 4.26/0.99 # Starting new_bool_3 with 136s (1) cores
% 4.26/0.99 # Starting new_bool_1 with 136s (1) cores
% 4.26/0.99 # H----_042_B03_F1_AE_Q4_SP_S2S with pid 9252 completed with status 0
% 4.26/0.99 # Result found by H----_042_B03_F1_AE_Q4_SP_S2S
% 4.26/0.99 # Preprocessing class: FSMSSMSSSSSNFFN.
% 4.26/0.99 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.26/0.99 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.26/0.99 # No SInE strategy applied
% 4.26/0.99 # Search class: FHUSM-FFSF22-MFFFFFNN
% 4.26/0.99 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 4.26/0.99 # Starting H----_042_B03_F1_AE_Q4_SP_S2S with 811s (1) cores
% 4.26/0.99 # Preprocessing time : 0.001 s
% 4.26/0.99
% 4.26/0.99 # Proof found!
% 4.26/0.99 # SZS status Unsatisfiable
% 4.26/0.99 # SZS output start CNFRefutation
% See solution above
% 4.26/0.99 # Parsed axioms : 19
% 4.26/0.99 # Removed by relevancy pruning/SinE : 0
% 4.26/0.99 # Initial clauses : 19
% 4.26/0.99 # Removed in clause preprocessing : 0
% 4.26/0.99 # Initial clauses in saturation : 19
% 4.26/0.99 # Processed clauses : 4657
% 4.26/0.99 # ...of these trivial : 1099
% 4.26/0.99 # ...subsumed : 2819
% 4.26/0.99 # ...remaining for further processing : 739
% 4.26/0.99 # Other redundant clauses eliminated : 0
% 4.26/0.99 # Clauses deleted for lack of memory : 0
% 4.26/0.99 # Backward-subsumed : 2
% 4.26/0.99 # Backward-rewritten : 142
% 4.26/0.99 # Generated clauses : 60427
% 4.26/0.99 # ...of the previous two non-redundant : 31890
% 4.26/0.99 # ...aggressively subsumed : 0
% 4.26/0.99 # Contextual simplify-reflections : 0
% 4.26/0.99 # Paramodulations : 60399
% 4.26/0.99 # Factorizations : 0
% 4.26/0.99 # NegExts : 0
% 4.26/0.99 # Equation resolutions : 28
% 4.26/0.99 # Total rewrite steps : 111060
% 4.26/0.99 # Propositional unsat checks : 0
% 4.26/0.99 # Propositional check models : 0
% 4.26/0.99 # Propositional check unsatisfiable : 0
% 4.26/0.99 # Propositional clauses : 0
% 4.26/0.99 # Propositional clauses after purity: 0
% 4.26/0.99 # Propositional unsat core size : 0
% 4.26/0.99 # Propositional preprocessing time : 0.000
% 4.26/0.99 # Propositional encoding time : 0.000
% 4.26/0.99 # Propositional solver time : 0.000
% 4.26/0.99 # Success case prop preproc time : 0.000
% 4.26/0.99 # Success case prop encoding time : 0.000
% 4.26/0.99 # Success case prop solver time : 0.000
% 4.26/0.99 # Current number of processed clauses : 595
% 4.26/0.99 # Positive orientable unit clauses : 247
% 4.26/0.99 # Positive unorientable unit clauses: 9
% 4.26/0.99 # Negative unit clauses : 1
% 4.26/0.99 # Non-unit-clauses : 338
% 4.26/0.99 # Current number of unprocessed clauses: 26805
% 4.26/0.99 # ...number of literals in the above : 37281
% 4.26/0.99 # Current number of archived formulas : 0
% 4.26/0.99 # Current number of archived clauses : 144
% 4.26/0.99 # Clause-clause subsumption calls (NU) : 14280
% 4.26/0.99 # Rec. Clause-clause subsumption calls : 14272
% 4.26/0.99 # Non-unit clause-clause subsumptions : 2157
% 4.26/0.99 # Unit Clause-clause subsumption calls : 603
% 4.26/0.99 # Rewrite failures with RHS unbound : 496
% 4.26/0.99 # BW rewrite match attempts : 2996
% 4.26/0.99 # BW rewrite match successes : 1176
% 4.26/0.99 # Condensation attempts : 0
% 4.26/0.99 # Condensation successes : 0
% 4.26/0.99 # Termbank termtop insertions : 662213
% 4.26/0.99
% 4.26/0.99 # -------------------------------------------------
% 4.26/0.99 # User time : 0.508 s
% 4.26/0.99 # System time : 0.022 s
% 4.26/0.99 # Total time : 0.530 s
% 4.26/0.99 # Maximum resident set size: 1636 pages
% 4.26/0.99
% 4.26/0.99 # -------------------------------------------------
% 4.26/0.99 # User time : 2.587 s
% 4.26/0.99 # System time : 0.052 s
% 4.26/0.99 # Total time : 2.640 s
% 4.26/0.99 # Maximum resident set size: 1684 pages
% 4.26/0.99 % E---3.1 exiting
% 4.26/0.99 % E---3.1 exiting
%------------------------------------------------------------------------------