TSTP Solution File: LAT019-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT019-1 : TPTP v8.1.2. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:25 EDT 2023
% Result : Unsatisfiable 0.17s 0.50s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of clauses : 48 ( 48 unt; 0 nHn; 5 RR)
% Number of literals : 48 ( 47 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 111 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.muDIucpHVC/E---3.1_3562.p',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.muDIucpHVC/E---3.1_3562.p',idempotence_of_meet) ).
cnf(distributivity_law,hypothesis,
meet(X1,join(X2,X3)) = join(meet(X1,X2),meet(X1,X3)),
file('/export/starexec/sandbox2/tmp/tmp.muDIucpHVC/E---3.1_3562.p',distributivity_law) ).
cnf(quasi_lattice2,axiom,
meet(join(X1,meet(X2,X3)),join(X1,X2)) = join(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.muDIucpHVC/E---3.1_3562.p',quasi_lattice2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.muDIucpHVC/E---3.1_3562.p',commutativity_of_meet) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.muDIucpHVC/E---3.1_3562.p',commutativity_of_join) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.muDIucpHVC/E---3.1_3562.p',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.muDIucpHVC/E---3.1_3562.p',idempotence_of_join) ).
cnf(prove_distributivity_law_dual,negated_conjecture,
join(a,meet(b,c)) != meet(join(a,b),join(a,c)),
file('/export/starexec/sandbox2/tmp/tmp.muDIucpHVC/E---3.1_3562.p',prove_distributivity_law_dual) ).
cnf(c_0_9,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_10,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_11,hypothesis,
meet(X1,join(X2,X3)) = join(meet(X1,X2),meet(X1,X3)),
distributivity_law ).
cnf(c_0_12,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_13,axiom,
meet(join(X1,meet(X2,X3)),join(X1,X2)) = join(X1,meet(X2,X3)),
quasi_lattice2 ).
cnf(c_0_14,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_15,hypothesis,
meet(X1,join(X2,meet(X1,X3))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_11]) ).
cnf(c_0_16,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_17,plain,
meet(join(X1,X2),join(X1,meet(X2,X3))) = join(X1,meet(X2,X3)),
inference(rw,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_12,c_0_14]) ).
cnf(c_0_19,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_20,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_21,hypothesis,
meet(X1,join(X2,meet(X3,X1))) = meet(X1,join(X2,X3)),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_22,hypothesis,
meet(X1,join(X2,X1)) = join(X1,meet(X1,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_10]),c_0_16]) ).
cnf(c_0_23,plain,
meet(join(X1,X2),join(X1,meet(X3,X2))) = join(X1,meet(X3,X2)),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_16]),c_0_19]) ).
cnf(c_0_26,hypothesis,
join(X1,join(X2,meet(X2,X1))) = join(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_21]),c_0_10]),c_0_22]) ).
cnf(c_0_27,plain,
meet(join(X1,X2),join(meet(X2,X3),X1)) = join(meet(X2,X3),X1),
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_28,hypothesis,
meet(X1,join(meet(X1,X2),X3)) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_11]) ).
cnf(c_0_29,plain,
meet(join(X1,X2),join(X1,X3)) = join(X1,meet(X3,join(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_21]) ).
cnf(c_0_30,hypothesis,
join(X1,join(X2,meet(X1,X2))) = join(X2,X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
meet(join(X1,X2),join(X3,X1)) = join(X1,meet(join(X1,X2),X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_24]),c_0_28]),c_0_16]) ).
cnf(c_0_32,hypothesis,
meet(join(X1,X2),join(X2,X3)) = join(X2,meet(X3,join(X1,X2))),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_33,plain,
join(X1,meet(join(X1,X2),X3)) = join(X1,meet(X2,join(X3,X1))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_31]),c_0_32]) ).
cnf(c_0_34,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_14]),c_0_9]) ).
cnf(c_0_35,hypothesis,
join(meet(X1,X2),meet(X2,X3)) = meet(X2,join(X1,X3)),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_36,negated_conjecture,
join(a,meet(b,c)) != meet(join(a,b),join(a,c)),
prove_distributivity_law_dual ).
cnf(c_0_37,hypothesis,
meet(join(X1,X2),join(X3,X2)) = join(X2,meet(X3,join(X1,X2))),
inference(spm,[status(thm)],[c_0_32,c_0_16]) ).
cnf(c_0_38,plain,
meet(join(X1,X2),join(X3,X1)) = join(X1,meet(X2,join(X3,X1))),
inference(rw,[status(thm)],[c_0_31,c_0_33]) ).
cnf(c_0_39,plain,
join(X1,meet(X2,meet(join(X1,X2),X3))) = join(meet(X2,X3),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_31]),c_0_34]) ).
cnf(c_0_40,plain,
meet(X1,meet(X2,meet(X3,X1))) = meet(X2,meet(X3,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_41,hypothesis,
meet(X1,join(meet(X2,X1),X3)) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_18]),c_0_35]) ).
cnf(c_0_42,negated_conjecture,
join(a,meet(c,join(a,b))) != join(a,meet(b,c)),
inference(rw,[status(thm)],[c_0_36,c_0_29]) ).
cnf(c_0_43,hypothesis,
join(X1,meet(X2,join(X3,X1))) = join(X1,meet(X3,join(X1,X2))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_16]),c_0_38]) ).
cnf(c_0_44,plain,
join(X1,meet(X2,join(X3,X1))) = join(meet(X3,X2),X1),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_33]),c_0_41]),c_0_18]) ).
cnf(c_0_45,negated_conjecture,
join(a,meet(b,join(a,c))) != join(a,meet(b,c)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_43]),c_0_16]) ).
cnf(c_0_46,hypothesis,
join(X1,meet(X2,join(X1,X3))) = join(meet(X2,X3),X1),
inference(rw,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_45,c_0_46]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.11 % Problem : LAT019-1 : TPTP v8.1.2. Released v2.2.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n020.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 10:54:46 EDT 2023
% 0.11/0.33 % 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.muDIucpHVC/E---3.1_3562.p
% 0.17/0.50 # Version: 3.1pre001
% 0.17/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.17/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.17/0.50 # Starting sh5l with 300s (1) cores
% 0.17/0.50 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3640 completed with status 0
% 0.17/0.50 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 0.17/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.50 # No SInE strategy applied
% 0.17/0.50 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.17/0.50 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.50 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.17/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.50 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.50 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.50 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.17/0.50 # G-E--_300_C01_F1_SE_CS_SP_S0Y with pid 3652 completed with status 0
% 0.17/0.50 # Result found by G-E--_300_C01_F1_SE_CS_SP_S0Y
% 0.17/0.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.17/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.17/0.50 # No SInE strategy applied
% 0.17/0.50 # Search class: FUUPM-FFSF22-MFFFFFNN
% 0.17/0.50 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.50 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 0.17/0.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 0.17/0.50 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.50 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.17/0.50 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 0.17/0.50 # Preprocessing time : 0.001 s
% 0.17/0.50
% 0.17/0.50 # Proof found!
% 0.17/0.50 # SZS status Unsatisfiable
% 0.17/0.50 # SZS output start CNFRefutation
% See solution above
% 0.17/0.50 # Parsed axioms : 10
% 0.17/0.50 # Removed by relevancy pruning/SinE : 0
% 0.17/0.50 # Initial clauses : 10
% 0.17/0.50 # Removed in clause preprocessing : 0
% 0.17/0.50 # Initial clauses in saturation : 10
% 0.17/0.50 # Processed clauses : 390
% 0.17/0.50 # ...of these trivial : 134
% 0.17/0.50 # ...subsumed : 190
% 0.17/0.50 # ...remaining for further processing : 66
% 0.17/0.50 # Other redundant clauses eliminated : 0
% 0.17/0.50 # Clauses deleted for lack of memory : 0
% 0.17/0.50 # Backward-subsumed : 0
% 0.17/0.50 # Backward-rewritten : 21
% 0.17/0.50 # Generated clauses : 4158
% 0.17/0.50 # ...of the previous two non-redundant : 3406
% 0.17/0.50 # ...aggressively subsumed : 0
% 0.17/0.50 # Contextual simplify-reflections : 0
% 0.17/0.50 # Paramodulations : 4158
% 0.17/0.50 # Factorizations : 0
% 0.17/0.50 # NegExts : 0
% 0.17/0.50 # Equation resolutions : 0
% 0.17/0.50 # Total rewrite steps : 6319
% 0.17/0.50 # Propositional unsat checks : 0
% 0.17/0.50 # Propositional check models : 0
% 0.17/0.50 # Propositional check unsatisfiable : 0
% 0.17/0.50 # Propositional clauses : 0
% 0.17/0.50 # Propositional clauses after purity: 0
% 0.17/0.50 # Propositional unsat core size : 0
% 0.17/0.50 # Propositional preprocessing time : 0.000
% 0.17/0.50 # Propositional encoding time : 0.000
% 0.17/0.50 # Propositional solver time : 0.000
% 0.17/0.50 # Success case prop preproc time : 0.000
% 0.17/0.50 # Success case prop encoding time : 0.000
% 0.17/0.50 # Success case prop solver time : 0.000
% 0.17/0.50 # Current number of processed clauses : 45
% 0.17/0.50 # Positive orientable unit clauses : 37
% 0.17/0.50 # Positive unorientable unit clauses: 8
% 0.17/0.50 # Negative unit clauses : 0
% 0.17/0.50 # Non-unit-clauses : 0
% 0.17/0.50 # Current number of unprocessed clauses: 3018
% 0.17/0.50 # ...number of literals in the above : 3018
% 0.17/0.50 # Current number of archived formulas : 0
% 0.17/0.50 # Current number of archived clauses : 21
% 0.17/0.50 # Clause-clause subsumption calls (NU) : 0
% 0.17/0.50 # Rec. Clause-clause subsumption calls : 0
% 0.17/0.50 # Non-unit clause-clause subsumptions : 0
% 0.17/0.50 # Unit Clause-clause subsumption calls : 26
% 0.17/0.50 # Rewrite failures with RHS unbound : 0
% 0.17/0.50 # BW rewrite match attempts : 193
% 0.17/0.50 # BW rewrite match successes : 94
% 0.17/0.50 # Condensation attempts : 0
% 0.17/0.50 # Condensation successes : 0
% 0.17/0.50 # Termbank termtop insertions : 46021
% 0.17/0.50
% 0.17/0.50 # -------------------------------------------------
% 0.17/0.50 # User time : 0.042 s
% 0.17/0.50 # System time : 0.005 s
% 0.17/0.50 # Total time : 0.047 s
% 0.17/0.50 # Maximum resident set size: 1512 pages
% 0.17/0.50
% 0.17/0.50 # -------------------------------------------------
% 0.17/0.50 # User time : 0.220 s
% 0.17/0.50 # System time : 0.019 s
% 0.17/0.50 # Total time : 0.239 s
% 0.17/0.50 # Maximum resident set size: 1668 pages
% 0.17/0.50 % E---3.1 exiting
% 0.17/0.50 % E---3.1 exiting
%------------------------------------------------------------------------------