TSTP Solution File: LAT140-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT140-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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:53 EDT 2023
% Result : Unsatisfiable 97.31s 12.91s
% Output : CNFRefutation 97.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of clauses : 57 ( 57 unt; 0 nHn; 4 RR)
% Number of literals : 57 ( 56 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 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 : 138 ( 19 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.wsmcoWW0Aa/E---3.1_12967.p',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.wsmcoWW0Aa/E---3.1_12967.p',idempotence_of_meet) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.wsmcoWW0Aa/E---3.1_12967.p',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.wsmcoWW0Aa/E---3.1_12967.p',commutativity_of_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.wsmcoWW0Aa/E---3.1_12967.p',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.wsmcoWW0Aa/E---3.1_12967.p',commutativity_of_meet) ).
cnf(associativity_of_join,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.wsmcoWW0Aa/E---3.1_12967.p',associativity_of_join) ).
cnf(equation_H21,axiom,
join(meet(X1,X2),meet(X1,X3)) = meet(X1,join(meet(X2,join(X1,meet(X2,X3))),meet(X3,join(X1,X2)))),
file('/export/starexec/sandbox/tmp/tmp.wsmcoWW0Aa/E---3.1_12967.p',equation_H21) ).
cnf(prove_H2,negated_conjecture,
meet(a,join(b,meet(a,c))) != meet(a,join(b,meet(c,join(meet(a,join(b,c)),meet(b,c))))),
file('/export/starexec/sandbox/tmp/tmp.wsmcoWW0Aa/E---3.1_12967.p',prove_H2) ).
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,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_12,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_13,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_14,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_9,c_0_10]) ).
cnf(c_0_15,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_16,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_17,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_18,plain,
join(meet(X1,X2),meet(X1,meet(X2,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_13,c_0_9]) ).
cnf(c_0_19,plain,
meet(X1,meet(X2,X1)) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_14,c_0_15]) ).
cnf(c_0_20,plain,
join(X1,join(meet(X1,X2),X3)) = join(X1,X3),
inference(spm,[status(thm)],[c_0_16,c_0_13]) ).
cnf(c_0_21,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_15]) ).
cnf(c_0_22,plain,
meet(X1,join(X2,join(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_23,plain,
join(meet(X1,X2),meet(X2,X1)) = meet(X1,X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_10]),c_0_9]),c_0_19]),c_0_9]),c_0_19]) ).
cnf(c_0_24,plain,
meet(join(X1,X2),join(meet(X1,X3),X2)) = join(meet(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_20]),c_0_15]) ).
cnf(c_0_25,plain,
join(X1,join(X2,X3)) = join(X2,join(X3,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_26,plain,
join(X1,join(X2,X1)) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_11]),c_0_16]) ).
cnf(c_0_27,plain,
meet(X1,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_28,plain,
meet(X1,meet(X2,join(X3,meet(X2,X1)))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_9]) ).
cnf(c_0_29,plain,
meet(X1,join(meet(X1,X2),meet(X1,X3))) = join(meet(X1,X2),meet(X1,X3)),
inference(spm,[status(thm)],[c_0_24,c_0_13]) ).
cnf(c_0_30,plain,
join(X1,join(X2,X3)) = join(X3,join(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_16]),c_0_26]) ).
cnf(c_0_31,plain,
join(meet(X1,X2),join(meet(X2,X1),X3)) = join(meet(X1,X2),X3),
inference(spm,[status(thm)],[c_0_16,c_0_23]) ).
cnf(c_0_32,plain,
join(X1,meet(X2,meet(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_9]) ).
cnf(c_0_33,plain,
meet(join(X1,X2),join(X2,X1)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_26]) ).
cnf(c_0_34,plain,
join(meet(X1,X2),meet(join(X1,X3),X2)) = meet(join(X1,X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_27]),c_0_12]) ).
cnf(c_0_35,plain,
meet(X1,join(meet(X2,X3),meet(X2,X1))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_36,plain,
join(meet(X1,X2),X3) = join(X3,meet(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_23]) ).
cnf(c_0_37,plain,
join(X1,join(X2,meet(X3,join(X2,X1)))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_16]) ).
cnf(c_0_38,plain,
join(X1,meet(join(X1,X2),join(X1,X3))) = meet(join(X1,X2),join(X1,X3)),
inference(spm,[status(thm)],[c_0_34,c_0_11]) ).
cnf(c_0_39,plain,
meet(X1,join(meet(X1,X2),meet(X2,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_40,plain,
join(X1,meet(join(X2,X3),join(X2,X1))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,axiom,
join(meet(X1,X2),meet(X1,X3)) = meet(X1,join(meet(X2,join(X1,meet(X2,X3))),meet(X3,join(X1,X2)))),
equation_H21 ).
cnf(c_0_42,plain,
meet(X1,meet(X2,join(X1,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_27,c_0_15]) ).
cnf(c_0_43,plain,
meet(X1,join(X2,meet(X1,join(X2,X3)))) = meet(X1,join(X2,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_12]) ).
cnf(c_0_44,plain,
meet(X1,join(meet(X2,join(X1,X3)),meet(X3,join(X1,meet(X3,X2))))) = join(meet(X1,X3),meet(X1,X2)),
inference(rw,[status(thm)],[c_0_41,c_0_12]) ).
cnf(c_0_45,plain,
join(X1,join(X2,X3)) = join(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_12]),c_0_16]) ).
cnf(c_0_46,plain,
join(meet(X1,X2),meet(X2,join(X1,X3))) = meet(X2,join(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_42]),c_0_12]) ).
cnf(c_0_47,plain,
meet(X1,join(meet(X1,X2),meet(X3,join(X1,X2)))) = join(meet(X1,X2),meet(X1,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]),c_0_12]),c_0_46]) ).
cnf(c_0_48,negated_conjecture,
meet(a,join(b,meet(a,c))) != meet(a,join(b,meet(c,join(meet(a,join(b,c)),meet(b,c))))),
prove_H2 ).
cnf(c_0_49,plain,
meet(X1,join(meet(X1,X2),meet(X3,join(X2,X1)))) = join(meet(X1,X2),meet(X1,X3)),
inference(spm,[status(thm)],[c_0_47,c_0_12]) ).
cnf(c_0_50,negated_conjecture,
meet(a,join(b,meet(c,join(meet(b,c),meet(a,join(b,c)))))) != meet(a,join(b,meet(a,c))),
inference(rw,[status(thm)],[c_0_48,c_0_12]) ).
cnf(c_0_51,plain,
meet(X1,join(meet(X2,X1),meet(X3,join(X2,X1)))) = join(meet(X2,X1),meet(X1,X3)),
inference(spm,[status(thm)],[c_0_49,c_0_15]) ).
cnf(c_0_52,plain,
meet(X1,X2) = meet(X2,X1),
c_0_15 ).
cnf(c_0_53,plain,
join(X1,X2) = join(X2,X1),
c_0_12 ).
cnf(c_0_54,plain,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
c_0_9 ).
cnf(c_0_55,plain,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
c_0_16 ).
cnf(c_0_56,negated_conjecture,
$false,
inference(ar,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_20]),c_0_52,c_0_53,c_0_54,c_0_55]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.10 % Problem : LAT140-1 : TPTP v8.1.2. Released v3.1.0.
% 0.11/0.11 % Command : run_E %s %d THM
% 0.11/0.31 % Computer : n018.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 2400
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Mon Oct 2 10:27:38 EDT 2023
% 0.11/0.32 % CPUTime :
% 0.16/0.43 Running first-order theorem proving
% 0.16/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/tmp/tmp.wsmcoWW0Aa/E---3.1_12967.p
% 97.31/12.91 # Version: 3.1pre001
% 97.31/12.91 # Preprocessing class: FSSSSMSSSSSNFFN.
% 97.31/12.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 97.31/12.91 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 97.31/12.91 # Starting new_bool_3 with 300s (1) cores
% 97.31/12.91 # Starting new_bool_1 with 300s (1) cores
% 97.31/12.91 # Starting sh5l with 300s (1) cores
% 97.31/12.91 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 13049 completed with status 0
% 97.31/12.91 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 97.31/12.91 # Preprocessing class: FSSSSMSSSSSNFFN.
% 97.31/12.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 97.31/12.91 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 97.31/12.91 # No SInE strategy applied
% 97.31/12.91 # Search class: FUUPM-FFSF22-DFFFFFNN
% 97.31/12.91 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 97.31/12.91 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 374s (1) cores
% 97.31/12.91 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 97.31/12.91 # Starting new_bool_1 with 366s (1) cores
% 97.31/12.91 # Starting G-E--_303_C18_F1_URBAN_S0Y with 140s (1) cores
% 97.31/12.91 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 97.31/12.91 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 13059 completed with status 0
% 97.31/12.91 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 97.31/12.91 # Preprocessing class: FSSSSMSSSSSNFFN.
% 97.31/12.91 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 97.31/12.91 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 97.31/12.91 # No SInE strategy applied
% 97.31/12.91 # Search class: FUUPM-FFSF22-DFFFFFNN
% 97.31/12.91 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 97.31/12.91 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 374s (1) cores
% 97.31/12.91 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 97.31/12.91 # Starting new_bool_1 with 366s (1) cores
% 97.31/12.91 # Starting G-E--_303_C18_F1_URBAN_S0Y with 140s (1) cores
% 97.31/12.91 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 97.31/12.91 # Preprocessing time : 0.001 s
% 97.31/12.91 # Presaturation interreduction done
% 97.31/12.91
% 97.31/12.91 # Proof found!
% 97.31/12.91 # SZS status Unsatisfiable
% 97.31/12.91 # SZS output start CNFRefutation
% See solution above
% 97.31/12.91 # Parsed axioms : 10
% 97.31/12.91 # Removed by relevancy pruning/SinE : 0
% 97.31/12.91 # Initial clauses : 10
% 97.31/12.91 # Removed in clause preprocessing : 0
% 97.31/12.91 # Initial clauses in saturation : 10
% 97.31/12.91 # Processed clauses : 56062
% 97.31/12.91 # ...of these trivial : 27310
% 97.31/12.91 # ...subsumed : 27952
% 97.31/12.91 # ...remaining for further processing : 800
% 97.31/12.91 # Other redundant clauses eliminated : 0
% 97.31/12.91 # Clauses deleted for lack of memory : 0
% 97.31/12.91 # Backward-subsumed : 0
% 97.31/12.91 # Backward-rewritten : 3
% 97.31/12.91 # Generated clauses : 890075
% 97.31/12.91 # ...of the previous two non-redundant : 550524
% 97.31/12.91 # ...aggressively subsumed : 0
% 97.31/12.91 # Contextual simplify-reflections : 0
% 97.31/12.91 # Paramodulations : 890075
% 97.31/12.91 # Factorizations : 0
% 97.31/12.91 # NegExts : 0
% 97.31/12.91 # Equation resolutions : 0
% 97.31/12.91 # Total rewrite steps : 1408454
% 97.31/12.91 # Propositional unsat checks : 0
% 97.31/12.91 # Propositional check models : 0
% 97.31/12.91 # Propositional check unsatisfiable : 0
% 97.31/12.91 # Propositional clauses : 0
% 97.31/12.91 # Propositional clauses after purity: 0
% 97.31/12.91 # Propositional unsat core size : 0
% 97.31/12.91 # Propositional preprocessing time : 0.000
% 97.31/12.91 # Propositional encoding time : 0.000
% 97.31/12.91 # Propositional solver time : 0.000
% 97.31/12.91 # Success case prop preproc time : 0.000
% 97.31/12.91 # Success case prop encoding time : 0.000
% 97.31/12.91 # Success case prop solver time : 0.000
% 97.31/12.91 # Current number of processed clauses : 787
% 97.31/12.91 # Positive orientable unit clauses : 776
% 97.31/12.91 # Positive unorientable unit clauses: 10
% 97.31/12.91 # Negative unit clauses : 1
% 97.31/12.91 # Non-unit-clauses : 0
% 97.31/12.91 # Current number of unprocessed clauses: 494422
% 97.31/12.91 # ...number of literals in the above : 494422
% 97.31/12.91 # Current number of archived formulas : 0
% 97.31/12.91 # Current number of archived clauses : 13
% 97.31/12.91 # Clause-clause subsumption calls (NU) : 0
% 97.31/12.91 # Rec. Clause-clause subsumption calls : 0
% 97.31/12.91 # Non-unit clause-clause subsumptions : 0
% 97.31/12.91 # Unit Clause-clause subsumption calls : 66
% 97.31/12.91 # Rewrite failures with RHS unbound : 0
% 97.31/12.91 # BW rewrite match attempts : 23914
% 97.31/12.91 # BW rewrite match successes : 291
% 97.31/12.91 # Condensation attempts : 0
% 97.31/12.91 # Condensation successes : 0
% 97.31/12.91 # Termbank termtop insertions : 11029592
% 97.31/12.91
% 97.31/12.91 # -------------------------------------------------
% 97.31/12.91 # User time : 11.830 s
% 97.31/12.91 # System time : 0.383 s
% 97.31/12.91 # Total time : 12.213 s
% 97.31/12.91 # Maximum resident set size: 1528 pages
% 97.31/12.91
% 97.31/12.91 # -------------------------------------------------
% 97.31/12.91 # User time : 58.355 s
% 97.31/12.91 # System time : 1.583 s
% 97.31/12.91 # Total time : 59.939 s
% 97.31/12.91 # Maximum resident set size: 1676 pages
% 97.31/12.91 % E---3.1 exiting
% 97.31/12.91 % E---3.1 exiting
%------------------------------------------------------------------------------