TSTP Solution File: LAT174-1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : LAT174-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:56 EDT 2023
% Result : Unsatisfiable 142.20s 18.50s
% Output : CNFRefutation 142.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 9
% Syntax : Number of clauses : 56 ( 56 unt; 0 nHn; 4 RR)
% Number of literals : 56 ( 55 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 : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 139 ( 22 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox/tmp/tmp.4d3JN3L8ae/E---3.1_25216.p',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox/tmp/tmp.4d3JN3L8ae/E---3.1_25216.p',idempotence_of_meet) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.4d3JN3L8ae/E---3.1_25216.p',absorption1) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.4d3JN3L8ae/E---3.1_25216.p',commutativity_of_join) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox/tmp/tmp.4d3JN3L8ae/E---3.1_25216.p',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox/tmp/tmp.4d3JN3L8ae/E---3.1_25216.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.4d3JN3L8ae/E---3.1_25216.p',associativity_of_join) ).
cnf(equation_H76_dual,axiom,
join(X1,meet(X2,join(X3,meet(X2,X4)))) = join(X1,meet(X2,join(X3,meet(X4,join(X1,X2))))),
file('/export/starexec/sandbox/tmp/tmp.4d3JN3L8ae/E---3.1_25216.p',equation_H76_dual) ).
cnf(prove_H6,negated_conjecture,
meet(a,join(b,meet(a,c))) != meet(a,join(meet(a,join(b,meet(a,c))),meet(c,join(a,b)))),
file('/export/starexec/sandbox/tmp/tmp.4d3JN3L8ae/E---3.1_25216.p',prove_H6) ).
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,meet(join(X1,X2),X3)) = meet(X1,X3),
inference(spm,[status(thm)],[c_0_9,c_0_11]) ).
cnf(c_0_23,plain,
meet(X1,join(X2,join(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_17,c_0_16]) ).
cnf(c_0_24,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_25,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_26,plain,
join(X1,join(X2,X3)) = join(X2,join(X3,X1)),
inference(spm,[status(thm)],[c_0_16,c_0_12]) ).
cnf(c_0_27,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_28,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_22]),c_0_12]) ).
cnf(c_0_29,plain,
meet(X1,meet(X2,join(X3,meet(X2,X1)))) = meet(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_9]) ).
cnf(c_0_30,plain,
meet(X1,join(meet(X1,X2),meet(X1,X3))) = join(meet(X1,X2),meet(X1,X3)),
inference(spm,[status(thm)],[c_0_25,c_0_13]) ).
cnf(c_0_31,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_26,c_0_27]),c_0_16]),c_0_27]) ).
cnf(c_0_32,plain,
join(meet(X1,X2),join(meet(X2,X1),X3)) = join(meet(X1,X2),X3),
inference(spm,[status(thm)],[c_0_16,c_0_24]) ).
cnf(c_0_33,plain,
join(X1,meet(X2,meet(X3,X1))) = X1,
inference(spm,[status(thm)],[c_0_21,c_0_9]) ).
cnf(c_0_34,plain,
meet(join(X1,X2),join(X2,X1)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_17,c_0_27]) ).
cnf(c_0_35,plain,
join(X1,join(X2,meet(X3,join(X1,X2)))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_16,c_0_21]) ).
cnf(c_0_36,plain,
join(X1,meet(join(X1,X2),join(X3,X1))) = meet(join(X1,X2),join(X3,X1)),
inference(spm,[status(thm)],[c_0_28,c_0_17]) ).
cnf(c_0_37,plain,
meet(X1,join(meet(X2,X3),meet(X2,X1))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_38,plain,
join(meet(X1,X2),X3) = join(X3,meet(X2,X1)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_24]) ).
cnf(c_0_39,plain,
join(X1,join(X2,meet(X3,join(X2,X1)))) = join(X1,X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_16]) ).
cnf(c_0_40,plain,
join(X1,meet(join(X1,X2),join(X1,X3))) = meet(join(X1,X2),join(X1,X3)),
inference(spm,[status(thm)],[c_0_28,c_0_11]) ).
cnf(c_0_41,plain,
join(X1,meet(join(X2,X3),join(X1,X2))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_42,plain,
meet(X1,join(meet(X1,X2),meet(X2,X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,plain,
join(X1,meet(join(X2,X3),join(X2,X1))) = join(X1,X2),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_44,plain,
join(X1,meet(join(X2,X3),join(X1,X3))) = join(X1,X3),
inference(spm,[status(thm)],[c_0_41,c_0_12]) ).
cnf(c_0_45,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_42,c_0_43]),c_0_12]) ).
cnf(c_0_46,axiom,
join(X1,meet(X2,join(X3,meet(X2,X4)))) = join(X1,meet(X2,join(X3,meet(X4,join(X1,X2))))),
equation_H76_dual ).
cnf(c_0_47,plain,
join(X1,meet(X2,join(X1,meet(X2,X3)))) = join(X1,meet(X2,X3)),
inference(spm,[status(thm)],[c_0_44,c_0_13]) ).
cnf(c_0_48,plain,
join(X1,meet(join(X2,X3),join(X3,X1))) = join(X1,X3),
inference(spm,[status(thm)],[c_0_43,c_0_12]) ).
cnf(c_0_49,plain,
meet(X1,join(X2,meet(X3,join(X2,X1)))) = meet(X1,join(X2,meet(X1,X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_50,negated_conjecture,
meet(a,join(b,meet(a,c))) != meet(a,join(meet(a,join(b,meet(a,c))),meet(c,join(a,b)))),
prove_H6 ).
cnf(c_0_51,plain,
meet(X1,join(X2,meet(X1,join(X3,X2)))) = meet(X1,join(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_48]),c_0_12]) ).
cnf(c_0_52,plain,
meet(X1,join(X2,meet(X3,join(X1,X2)))) = meet(X1,join(X2,meet(X1,X3))),
inference(spm,[status(thm)],[c_0_49,c_0_12]) ).
cnf(c_0_53,negated_conjecture,
meet(a,join(meet(c,join(a,b)),meet(a,join(b,meet(a,c))))) != meet(a,join(b,meet(a,c))),
inference(rw,[status(thm)],[c_0_50,c_0_12]) ).
cnf(c_0_54,plain,
meet(X1,join(meet(X2,join(X1,X3)),meet(X1,join(X3,meet(X1,X2))))) = meet(X1,join(X3,meet(X1,X2))),
inference(spm,[status(thm)],[c_0_51,c_0_52]) ).
cnf(c_0_55,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10 % Problem : LAT174-1 : TPTP v8.1.2. Released v3.1.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.10/0.31 % Computer : n017.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 2400
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Mon Oct 2 09:54:11 EDT 2023
% 0.10/0.31 % CPUTime :
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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.4d3JN3L8ae/E---3.1_25216.p
% 142.20/18.50 # Version: 3.1pre001
% 142.20/18.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 142.20/18.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 142.20/18.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 142.20/18.50 # Starting new_bool_3 with 300s (1) cores
% 142.20/18.50 # Starting new_bool_1 with 300s (1) cores
% 142.20/18.50 # Starting sh5l with 300s (1) cores
% 142.20/18.50 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 25294 completed with status 0
% 142.20/18.50 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 142.20/18.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 142.20/18.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 142.20/18.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 142.20/18.50 # No SInE strategy applied
% 142.20/18.50 # Search class: FUUPM-FFSF22-MFFFFFNN
% 142.20/18.50 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 142.20/18.50 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 142.20/18.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 142.20/18.50 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 142.20/18.50 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 142.20/18.50 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 142.20/18.50 # U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with pid 25303 completed with status 0
% 142.20/18.50 # Result found by U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN
% 142.20/18.50 # Preprocessing class: FSSSSMSSSSSNFFN.
% 142.20/18.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 142.20/18.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 142.20/18.50 # No SInE strategy applied
% 142.20/18.50 # Search class: FUUPM-FFSF22-MFFFFFNN
% 142.20/18.50 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 142.20/18.50 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 142.20/18.50 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 142.20/18.50 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 142.20/18.50 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 142.20/18.50 # Preprocessing time : 0.001 s
% 142.20/18.50 # Presaturation interreduction done
% 142.20/18.50
% 142.20/18.50 # Proof found!
% 142.20/18.50 # SZS status Unsatisfiable
% 142.20/18.50 # SZS output start CNFRefutation
% See solution above
% 142.20/18.50 # Parsed axioms : 10
% 142.20/18.50 # Removed by relevancy pruning/SinE : 0
% 142.20/18.50 # Initial clauses : 10
% 142.20/18.50 # Removed in clause preprocessing : 0
% 142.20/18.50 # Initial clauses in saturation : 10
% 142.20/18.50 # Processed clauses : 64272
% 142.20/18.50 # ...of these trivial : 31302
% 142.20/18.50 # ...subsumed : 32073
% 142.20/18.50 # ...remaining for further processing : 897
% 142.20/18.50 # Other redundant clauses eliminated : 0
% 142.20/18.50 # Clauses deleted for lack of memory : 0
% 142.20/18.50 # Backward-subsumed : 0
% 142.20/18.50 # Backward-rewritten : 5
% 142.20/18.50 # Generated clauses : 1125821
% 142.20/18.50 # ...of the previous two non-redundant : 695185
% 142.20/18.50 # ...aggressively subsumed : 0
% 142.20/18.50 # Contextual simplify-reflections : 0
% 142.20/18.50 # Paramodulations : 1125821
% 142.20/18.50 # Factorizations : 0
% 142.20/18.50 # NegExts : 0
% 142.20/18.50 # Equation resolutions : 0
% 142.20/18.50 # Total rewrite steps : 1907422
% 142.20/18.50 # Propositional unsat checks : 0
% 142.20/18.50 # Propositional check models : 0
% 142.20/18.50 # Propositional check unsatisfiable : 0
% 142.20/18.50 # Propositional clauses : 0
% 142.20/18.50 # Propositional clauses after purity: 0
% 142.20/18.50 # Propositional unsat core size : 0
% 142.20/18.50 # Propositional preprocessing time : 0.000
% 142.20/18.50 # Propositional encoding time : 0.000
% 142.20/18.50 # Propositional solver time : 0.000
% 142.20/18.50 # Success case prop preproc time : 0.000
% 142.20/18.50 # Success case prop encoding time : 0.000
% 142.20/18.50 # Success case prop solver time : 0.000
% 142.20/18.50 # Current number of processed clauses : 882
% 142.20/18.50 # Positive orientable unit clauses : 872
% 142.20/18.50 # Positive unorientable unit clauses: 10
% 142.20/18.50 # Negative unit clauses : 0
% 142.20/18.50 # Non-unit-clauses : 0
% 142.20/18.50 # Current number of unprocessed clauses: 630872
% 142.20/18.50 # ...number of literals in the above : 630872
% 142.20/18.50 # Current number of archived formulas : 0
% 142.20/18.50 # Current number of archived clauses : 15
% 142.20/18.50 # Clause-clause subsumption calls (NU) : 0
% 142.20/18.50 # Rec. Clause-clause subsumption calls : 0
% 142.20/18.50 # Non-unit clause-clause subsumptions : 0
% 142.20/18.50 # Unit Clause-clause subsumption calls : 68
% 142.20/18.50 # Rewrite failures with RHS unbound : 0
% 142.20/18.50 # BW rewrite match attempts : 34027
% 142.20/18.50 # BW rewrite match successes : 301
% 142.20/18.50 # Condensation attempts : 0
% 142.20/18.50 # Condensation successes : 0
% 142.20/18.50 # Termbank termtop insertions : 14887849
% 142.20/18.50
% 142.20/18.50 # -------------------------------------------------
% 142.20/18.50 # User time : 16.990 s
% 142.20/18.50 # System time : 0.619 s
% 142.20/18.50 # Total time : 17.610 s
% 142.20/18.50 # Maximum resident set size: 1516 pages
% 142.20/18.50
% 142.20/18.50 # -------------------------------------------------
% 142.20/18.50 # User time : 85.244 s
% 142.20/18.50 # System time : 2.751 s
% 142.20/18.50 # Total time : 87.995 s
% 142.20/18.50 # Maximum resident set size: 1676 pages
% 142.20/18.50 % E---3.1 exiting
% 142.20/18.51 % E---3.1 exiting
%------------------------------------------------------------------------------