TSTP Solution File: LAT143-1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : LAT143-1 : TPTP v8.1.2. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n006.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:09:56 EDT 2023
% Result : Unsatisfiable 80.66s 10.78s
% Output : CNFRefutation 80.66s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 41 ( 41 unt; 0 nHn; 5 RR)
% Number of literals : 41 ( 40 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 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 : 87 ( 8 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity_of_meet,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
file('/export/starexec/sandbox2/tmp/tmp.ifwwEEXxST/E---3.1_30382.p',associativity_of_meet) ).
cnf(idempotence_of_meet,axiom,
meet(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.ifwwEEXxST/E---3.1_30382.p',idempotence_of_meet) ).
cnf(absorption1,axiom,
meet(X1,join(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.ifwwEEXxST/E---3.1_30382.p',absorption1) ).
cnf(absorption2,axiom,
join(X1,meet(X1,X2)) = X1,
file('/export/starexec/sandbox2/tmp/tmp.ifwwEEXxST/E---3.1_30382.p',absorption2) ).
cnf(commutativity_of_meet,axiom,
meet(X1,X2) = meet(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.ifwwEEXxST/E---3.1_30382.p',commutativity_of_meet) ).
cnf(equation_H24,axiom,
join(meet(X1,X2),meet(X2,X3)) = join(meet(X1,X2),meet(X2,join(meet(X1,X2),meet(X3,join(X1,X2))))),
file('/export/starexec/sandbox2/tmp/tmp.ifwwEEXxST/E---3.1_30382.p',equation_H24) ).
cnf(commutativity_of_join,axiom,
join(X1,X2) = join(X2,X1),
file('/export/starexec/sandbox2/tmp/tmp.ifwwEEXxST/E---3.1_30382.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.ifwwEEXxST/E---3.1_30382.p',associativity_of_join) ).
cnf(idempotence_of_join,axiom,
join(X1,X1) = X1,
file('/export/starexec/sandbox2/tmp/tmp.ifwwEEXxST/E---3.1_30382.p',idempotence_of_join) ).
cnf(prove_H15,negated_conjecture,
meet(a,join(meet(a,b),meet(a,c))) != meet(a,join(meet(a,b),join(meet(a,c),meet(c,join(a,b))))),
file('/export/starexec/sandbox2/tmp/tmp.ifwwEEXxST/E---3.1_30382.p',prove_H15) ).
cnf(c_0_10,axiom,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
associativity_of_meet ).
cnf(c_0_11,axiom,
meet(X1,X1) = X1,
idempotence_of_meet ).
cnf(c_0_12,axiom,
meet(X1,join(X1,X2)) = X1,
absorption1 ).
cnf(c_0_13,axiom,
join(X1,meet(X1,X2)) = X1,
absorption2 ).
cnf(c_0_14,axiom,
meet(X1,X2) = meet(X2,X1),
commutativity_of_meet ).
cnf(c_0_15,axiom,
join(meet(X1,X2),meet(X2,X3)) = join(meet(X1,X2),meet(X2,join(meet(X1,X2),meet(X3,join(X1,X2))))),
equation_H24 ).
cnf(c_0_16,plain,
meet(X1,meet(X1,X2)) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_10,c_0_11]) ).
cnf(c_0_17,plain,
meet(X1,meet(X2,join(meet(X1,X2),X3))) = meet(X1,X2),
inference(spm,[status(thm)],[c_0_12,c_0_10]) ).
cnf(c_0_18,axiom,
join(X1,X2) = join(X2,X1),
commutativity_of_join ).
cnf(c_0_19,plain,
join(X1,meet(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_20,axiom,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
associativity_of_join ).
cnf(c_0_21,axiom,
join(X1,X1) = X1,
idempotence_of_join ).
cnf(c_0_22,negated_conjecture,
meet(a,join(meet(a,b),meet(a,c))) != meet(a,join(meet(a,b),join(meet(a,c),meet(c,join(a,b))))),
prove_H15 ).
cnf(c_0_23,plain,
join(meet(X1,X2),meet(X2,meet(join(meet(X1,X2),meet(X3,join(X1,X2))),join(meet(X1,X2),meet(X4,join(meet(X1,X2),meet(X2,X3))))))) = join(meet(X1,X2),meet(X2,meet(join(meet(X1,X2),meet(X3,join(X1,X2))),X4))),
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_15]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_10]),c_0_16]),c_0_17]),c_0_16]),c_0_17]),c_0_16]),c_0_17]) ).
cnf(c_0_24,plain,
meet(X1,join(X2,X1)) = X1,
inference(spm,[status(thm)],[c_0_12,c_0_18]) ).
cnf(c_0_25,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_19,c_0_17]),c_0_18]) ).
cnf(c_0_26,plain,
meet(X1,meet(X2,X3)) = meet(X2,meet(X1,X3)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_14]),c_0_10]) ).
cnf(c_0_27,plain,
join(X1,join(X1,X2)) = join(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_28,negated_conjecture,
meet(a,join(meet(b,a),join(meet(c,a),meet(c,join(b,a))))) != meet(a,join(meet(b,a),meet(c,a))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_14]),c_0_14]),c_0_14]),c_0_14]),c_0_18]) ).
cnf(c_0_29,plain,
meet(X1,join(meet(X2,X1),meet(X3,X1))) = join(meet(X2,X1),meet(X1,X3)),
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(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_11]),c_0_24]),c_0_18]),c_0_19]),c_0_18]),c_0_19]),c_0_16]),c_0_24]),c_0_18]),c_0_19]),c_0_16]),c_0_25]) ).
cnf(c_0_30,plain,
meet(X1,meet(X2,join(X3,X1))) = meet(X2,X1),
inference(spm,[status(thm)],[c_0_26,c_0_24]) ).
cnf(c_0_31,plain,
join(X1,join(X2,X1)) = join(X2,X1),
inference(spm,[status(thm)],[c_0_27,c_0_18]) ).
cnf(c_0_32,plain,
join(meet(X1,X2),join(meet(X2,join(meet(X1,X2),meet(X3,join(X1,X2)))),X4)) = join(meet(X1,X2),join(meet(X2,X3),X4)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_15]),c_0_20]) ).
cnf(c_0_33,negated_conjecture,
meet(a,join(meet(b,a),join(meet(c,a),meet(c,join(b,a))))) != join(meet(b,a),meet(c,a)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_29]),c_0_14]) ).
cnf(c_0_34,plain,
join(meet(X1,X2),meet(X1,join(X3,X2))) = meet(X1,join(X3,X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_30]),c_0_18]) ).
cnf(c_0_35,plain,
meet(X1,join(meet(X2,X1),meet(X3,join(X2,X1)))) = join(meet(X1,X3),meet(X2,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_31]),c_0_18]),c_0_25]) ).
cnf(c_0_36,plain,
meet(X1,X2) = meet(X2,X1),
c_0_14 ).
cnf(c_0_37,plain,
join(X1,X2) = join(X2,X1),
c_0_18 ).
cnf(c_0_38,plain,
meet(meet(X1,X2),X3) = meet(X1,meet(X2,X3)),
c_0_10 ).
cnf(c_0_39,plain,
join(join(X1,X2),X3) = join(X1,join(X2,X3)),
c_0_20 ).
cnf(c_0_40,negated_conjecture,
$false,
inference(ar,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_35]),c_0_14]),c_0_36,c_0_37,c_0_38,c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : LAT143-1 : TPTP v8.1.2. Released v3.1.0.
% 0.00/0.10 % Command : run_E %s %d THM
% 0.12/0.30 % Computer : n006.cluster.edu
% 0.12/0.30 % Model : x86_64 x86_64
% 0.12/0.30 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.30 % Memory : 8042.1875MB
% 0.12/0.30 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.30 % CPULimit : 2400
% 0.12/0.30 % WCLimit : 300
% 0.12/0.30 % DateTime : Mon Oct 2 10:53:40 EDT 2023
% 0.12/0.30 % CPUTime :
% 0.14/0.40 Running first-order model finding
% 0.14/0.40 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.ifwwEEXxST/E---3.1_30382.p
% 80.66/10.78 # Version: 3.1pre001
% 80.66/10.78 # Preprocessing class: FSSSSMSSSSSNFFN.
% 80.66/10.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 80.66/10.78 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 80.66/10.78 # Starting new_bool_3 with 300s (1) cores
% 80.66/10.78 # Starting new_bool_1 with 300s (1) cores
% 80.66/10.78 # Starting sh5l with 300s (1) cores
% 80.66/10.78 # G-E--_302_C18_F1_URBAN_RG_S04BN with pid 30465 completed with status 0
% 80.66/10.78 # Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 80.66/10.78 # Preprocessing class: FSSSSMSSSSSNFFN.
% 80.66/10.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 80.66/10.78 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 80.66/10.78 # No SInE strategy applied
% 80.66/10.78 # Search class: FUUPM-FFSF22-MFFFFFNN
% 80.66/10.78 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 80.66/10.78 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 80.66/10.78 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 80.66/10.78 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 80.66/10.78 # Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 80.66/10.78 # Starting G-E--_300_C01_F1_SE_CS_SP_S0Y with 136s (1) cores
% 80.66/10.78 # U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 30473 completed with status 0
% 80.66/10.78 # Result found by U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 80.66/10.78 # Preprocessing class: FSSSSMSSSSSNFFN.
% 80.66/10.78 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 80.66/10.78 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 80.66/10.78 # No SInE strategy applied
% 80.66/10.78 # Search class: FUUPM-FFSF22-MFFFFFNN
% 80.66/10.78 # Scheduled 9 strats onto 5 cores with 1500 seconds (1500 total)
% 80.66/10.78 # Starting G-E--_107_C37_F1_PI_AE_Q4_CS_SP_PS_S0Y with 406s (1) cores
% 80.66/10.78 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 80.66/10.78 # Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 80.66/10.78 # Preprocessing time : 0.001 s
% 80.66/10.78 # Presaturation interreduction done
% 80.66/10.78
% 80.66/10.78 # Proof found!
% 80.66/10.78 # SZS status Unsatisfiable
% 80.66/10.78 # SZS output start CNFRefutation
% See solution above
% 80.66/10.78 # Parsed axioms : 10
% 80.66/10.78 # Removed by relevancy pruning/SinE : 0
% 80.66/10.78 # Initial clauses : 10
% 80.66/10.78 # Removed in clause preprocessing : 0
% 80.66/10.78 # Initial clauses in saturation : 10
% 80.66/10.78 # Processed clauses : 8033
% 80.66/10.78 # ...of these trivial : 4441
% 80.66/10.78 # ...subsumed : 3193
% 80.66/10.78 # ...remaining for further processing : 399
% 80.66/10.78 # Other redundant clauses eliminated : 0
% 80.66/10.78 # Clauses deleted for lack of memory : 0
% 80.66/10.78 # Backward-subsumed : 0
% 80.66/10.78 # Backward-rewritten : 28
% 80.66/10.78 # Generated clauses : 293333
% 80.66/10.78 # ...of the previous two non-redundant : 230703
% 80.66/10.78 # ...aggressively subsumed : 0
% 80.66/10.78 # Contextual simplify-reflections : 0
% 80.66/10.78 # Paramodulations : 293333
% 80.66/10.78 # Factorizations : 0
% 80.66/10.78 # NegExts : 0
% 80.66/10.78 # Equation resolutions : 0
% 80.66/10.78 # Total rewrite steps : 1359333
% 80.66/10.78 # Propositional unsat checks : 0
% 80.66/10.78 # Propositional check models : 0
% 80.66/10.78 # Propositional check unsatisfiable : 0
% 80.66/10.78 # Propositional clauses : 0
% 80.66/10.78 # Propositional clauses after purity: 0
% 80.66/10.78 # Propositional unsat core size : 0
% 80.66/10.78 # Propositional preprocessing time : 0.000
% 80.66/10.78 # Propositional encoding time : 0.000
% 80.66/10.78 # Propositional solver time : 0.000
% 80.66/10.78 # Success case prop preproc time : 0.000
% 80.66/10.78 # Success case prop encoding time : 0.000
% 80.66/10.78 # Success case prop solver time : 0.000
% 80.66/10.78 # Current number of processed clauses : 361
% 80.66/10.78 # Positive orientable unit clauses : 352
% 80.66/10.78 # Positive unorientable unit clauses: 8
% 80.66/10.78 # Negative unit clauses : 1
% 80.66/10.78 # Non-unit-clauses : 0
% 80.66/10.78 # Current number of unprocessed clauses: 221883
% 80.66/10.78 # ...number of literals in the above : 221883
% 80.66/10.78 # Current number of archived formulas : 0
% 80.66/10.78 # Current number of archived clauses : 38
% 80.66/10.78 # Clause-clause subsumption calls (NU) : 0
% 80.66/10.78 # Rec. Clause-clause subsumption calls : 0
% 80.66/10.78 # Non-unit clause-clause subsumptions : 0
% 80.66/10.78 # Unit Clause-clause subsumption calls : 30
% 80.66/10.78 # Rewrite failures with RHS unbound : 0
% 80.66/10.78 # BW rewrite match attempts : 7053
% 80.66/10.78 # BW rewrite match successes : 127
% 80.66/10.78 # Condensation attempts : 0
% 80.66/10.78 # Condensation successes : 0
% 80.66/10.78 # Termbank termtop insertions : 13052377
% 80.66/10.78
% 80.66/10.78 # -------------------------------------------------
% 80.66/10.78 # User time : 9.766 s
% 80.66/10.78 # System time : 0.306 s
% 80.66/10.78 # Total time : 10.071 s
% 80.66/10.78 # Maximum resident set size: 1516 pages
% 80.66/10.78
% 80.66/10.78 # -------------------------------------------------
% 80.66/10.78 # User time : 48.309 s
% 80.66/10.78 # System time : 1.613 s
% 80.66/10.78 # Total time : 49.922 s
% 80.66/10.78 # Maximum resident set size: 1676 pages
% 80.66/10.78 % E---3.1 exiting
%------------------------------------------------------------------------------