TSTP Solution File: LAT038-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT038-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% 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 : 300s
% WCLimit : 600s
% DateTime : Sun Jul 17 06:25:14 EDT 2022
% Result : Unsatisfiable 0.89s 1.16s
% Output : Refutation 0.89s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : LAT038-1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 29 15:25:23 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.89/1.16 ============================== Prover9 ===============================
% 0.89/1.16 Prover9 (32) version 2009-11A, November 2009.
% 0.89/1.16 Process 12793 was started by sandbox on n006.cluster.edu,
% 0.89/1.16 Wed Jun 29 15:25:24 2022
% 0.89/1.16 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12639_n006.cluster.edu".
% 0.89/1.16 ============================== end of head ===========================
% 0.89/1.16
% 0.89/1.16 ============================== INPUT =================================
% 0.89/1.16
% 0.89/1.16 % Reading from file /tmp/Prover9_12639_n006.cluster.edu
% 0.89/1.16
% 0.89/1.16 set(prolog_style_variables).
% 0.89/1.16 set(auto2).
% 0.89/1.16 % set(auto2) -> set(auto).
% 0.89/1.16 % set(auto) -> set(auto_inference).
% 0.89/1.16 % set(auto) -> set(auto_setup).
% 0.89/1.16 % set(auto_setup) -> set(predicate_elim).
% 0.89/1.16 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.89/1.16 % set(auto) -> set(auto_limits).
% 0.89/1.16 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.89/1.16 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.89/1.16 % set(auto) -> set(auto_denials).
% 0.89/1.16 % set(auto) -> set(auto_process).
% 0.89/1.16 % set(auto2) -> assign(new_constants, 1).
% 0.89/1.16 % set(auto2) -> assign(fold_denial_max, 3).
% 0.89/1.16 % set(auto2) -> assign(max_weight, "200.000").
% 0.89/1.16 % set(auto2) -> assign(max_hours, 1).
% 0.89/1.16 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.89/1.16 % set(auto2) -> assign(max_seconds, 0).
% 0.89/1.16 % set(auto2) -> assign(max_minutes, 5).
% 0.89/1.16 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.89/1.16 % set(auto2) -> set(sort_initial_sos).
% 0.89/1.16 % set(auto2) -> assign(sos_limit, -1).
% 0.89/1.16 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.89/1.16 % set(auto2) -> assign(max_megs, 400).
% 0.89/1.16 % set(auto2) -> assign(stats, some).
% 0.89/1.16 % set(auto2) -> clear(echo_input).
% 0.89/1.16 % set(auto2) -> set(quiet).
% 0.89/1.16 % set(auto2) -> clear(print_initial_clauses).
% 0.89/1.16 % set(auto2) -> clear(print_given).
% 0.89/1.16 assign(lrs_ticks,-1).
% 0.89/1.16 assign(sos_limit,10000).
% 0.89/1.16 assign(order,kbo).
% 0.89/1.16 set(lex_order_vars).
% 0.89/1.16 clear(print_given).
% 0.89/1.16
% 0.89/1.16 % formulas(sos). % not echoed (17 formulas)
% 0.89/1.16
% 0.89/1.16 ============================== end of input ==========================
% 0.89/1.16
% 0.89/1.16 % From the command line: assign(max_seconds, 300).
% 0.89/1.16
% 0.89/1.16 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.89/1.16
% 0.89/1.16 % Formulas that are not ordinary clauses:
% 0.89/1.16
% 0.89/1.16 ============================== end of process non-clausal formulas ===
% 0.89/1.16
% 0.89/1.16 ============================== PROCESS INITIAL CLAUSES ===============
% 0.89/1.16
% 0.89/1.16 ============================== PREDICATE ELIMINATION =================
% 0.89/1.16
% 0.89/1.16 ============================== end predicate elimination =============
% 0.89/1.16
% 0.89/1.16 Auto_denials:
% 0.89/1.16 % copying label rhs to answer in negative clause
% 0.89/1.16
% 0.89/1.16 Term ordering decisions:
% 0.89/1.16 Function symbol KB weights: dd=1. bb=1. n0=1. aa=1. cc=1. join=1. meet=1. f=1.
% 0.89/1.16
% 0.89/1.16 ============================== end of process initial clauses ========
% 0.89/1.16
% 0.89/1.16 ============================== CLAUSES FOR SEARCH ====================
% 0.89/1.16
% 0.89/1.16 ============================== end of clauses for search =============
% 0.89/1.16
% 0.89/1.16 ============================== SEARCH ================================
% 0.89/1.16
% 0.89/1.16 % Starting search at 0.01 seconds.
% 0.89/1.16
% 0.89/1.16 ============================== PROOF =================================
% 0.89/1.16 % SZS status Unsatisfiable
% 0.89/1.16 % SZS output start Refutation
% 0.89/1.16
% 0.89/1.16 % Proof 1 at 0.11 (+ 0.01) seconds: rhs.
% 0.89/1.16 % Length of proof is 31.
% 0.89/1.16 % Level of proof is 9.
% 0.89/1.16 % Maximum clause weight is 17.000.
% 0.89/1.16 % Given clauses 51.
% 0.89/1.16
% 0.89/1.16 2 join(A,A) = A # label(idempotence_of_join) # label(axiom). [assumption].
% 0.89/1.16 5 meet(A,join(A,B)) = A # label(absorption1) # label(axiom). [assumption].
% 0.89/1.16 6 join(A,meet(A,B)) = A # label(absorption2) # label(axiom). [assumption].
% 0.89/1.16 7 meet(A,B) = meet(B,A) # label(commutativity_of_meet) # label(axiom). [assumption].
% 0.89/1.16 8 join(A,B) = join(B,A) # label(commutativity_of_join) # label(axiom). [assumption].
% 0.89/1.16 11 join(join(A,B),C) = join(A,join(B,C)) # label(associativity_of_join) # label(axiom). [assumption].
% 0.89/1.16 12 join(A,join(B,C)) = join(C,join(A,B)). [copy(11),rewrite([8(2)]),flip(a)].
% 0.89/1.16 13 f(join(aa,bb),dd) = f(join(cc,bb),dd) # label(lhs1) # label(hypothesis). [assumption].
% 0.89/1.16 14 f(join(bb,cc),dd) = f(join(bb,aa),dd). [copy(13),rewrite([8(3),8(8)]),flip(a)].
% 0.89/1.16 15 join(A,meet(B,C)) = meet(join(A,B),join(A,C)) # label(dist_join) # label(hypothesis). [assumption].
% 0.89/1.16 16 meet(join(A,B),join(A,C)) = join(A,meet(B,C)). [copy(15),flip(a)].
% 0.89/1.16 19 f(join(A,B),C) = join(f(A,C),f(B,C)) # label(f_on_left_join) # label(axiom). [assumption].
% 0.89/1.16 20 join(f(A,B),f(C,B)) = f(join(A,C),B). [copy(19),flip(a)].
% 0.89/1.16 23 meet(f(aa,dd),f(bb,dd)) = meet(f(cc,dd),f(bb,dd)) # label(lhs2) # label(hypothesis). [assumption].
% 0.89/1.16 24 meet(f(bb,dd),f(cc,dd)) = meet(f(bb,dd),f(aa,dd)). [copy(23),rewrite([7(7),7(14)]),flip(a)].
% 0.89/1.16 25 f(aa,dd) != f(cc,dd) # label(rhs) # label(negated_conjecture) # answer(rhs). [assumption].
% 0.89/1.16 26 f(cc,dd) != f(aa,dd) # answer(rhs). [copy(25),flip(a)].
% 0.89/1.16 27 f(cc,dd) = c_0. [new_symbol(26)].
% 0.89/1.16 28 f(aa,dd) != c_0 # answer(rhs). [back_rewrite(26),rewrite([27(3)]),flip(a)].
% 0.89/1.16 29 meet(f(bb,dd),f(aa,dd)) = meet(c_0,f(bb,dd)). [back_rewrite(24),rewrite([27(6),7(5)]),flip(a)].
% 0.89/1.16 35 meet(join(A,B),join(B,C)) = join(B,meet(A,C)). [para(8(a,1),16(a,1,1))].
% 0.89/1.16 36 meet(join(A,join(B,C)),join(B,D)) = join(B,meet(D,join(A,C))). [para(12(a,1),16(a,1,1)),rewrite([8(5),7(6)])].
% 0.89/1.16 51 f(join(bb,aa),dd) = join(c_0,f(bb,dd)). [para(14(a,1),20(a,2)),rewrite([27(6),8(5)]),flip(a)].
% 0.89/1.16 74 meet(A,join(B,A)) = join(A,meet(B,A)). [para(2(a,1),35(a,1,2)),rewrite([7(2)])].
% 0.89/1.16 107 meet(A,join(B,join(A,C))) = A. [para(2(a,1),36(a,1,2)),rewrite([7(3),6(6)])].
% 0.89/1.16 108 join(A,meet(meet(A,B),join(C,D))) = A. [para(6(a,1),36(a,1,2)),rewrite([7(3),107(3)]),flip(a)].
% 0.89/1.16 136 join(A,meet(B,meet(meet(A,C),join(D,E)))) = A. [para(108(a,1),16(a,1,1)),rewrite([5(2),7(4)]),flip(a)].
% 0.89/1.16 141 join(A,meet(B,A)) = A. [para(108(a,1),35(a,1,2)),rewrite([7(2),74(2),136(7)])].
% 0.89/1.16 146 join(f(aa,dd),meet(c_0,f(bb,dd))) = f(aa,dd). [para(29(a,1),141(a,1,2))].
% 0.89/1.16 322 f(aa,dd) = c_0. [para(146(a,1),16(a,2)),rewrite([8(5),8(12),20(12),51(10),7(11),16(11),29(8),6(7)]),flip(a)].
% 0.89/1.16 323 $F # answer(rhs). [resolve(322,a,28,a)].
% 0.89/1.16
% 0.89/1.16 % SZS output end Refutation
% 0.89/1.16 ============================== end of proof ==========================
% 0.89/1.16
% 0.89/1.16 ============================== STATISTICS ============================
% 0.89/1.16
% 0.89/1.16 Given=51. Generated=2125. Kept=313. proofs=1.
% 0.89/1.16 Usable=45. Sos=176. Demods=219. Limbo=0, Disabled=108. Hints=0.
% 0.89/1.16 Megabytes=0.39.
% 0.89/1.16 User_CPU=0.11, System_CPU=0.01, Wall_clock=0.
% 0.89/1.16
% 0.89/1.16 ============================== end of statistics =====================
% 0.89/1.16
% 0.89/1.16 ============================== end of search =========================
% 0.89/1.16
% 0.89/1.16 THEOREM PROVED
% 0.89/1.16 % SZS status Unsatisfiable
% 0.89/1.16
% 0.89/1.16 Exiting with 1 proof.
% 0.89/1.16
% 0.89/1.16 Process 12793 exit (max_proofs) Wed Jun 29 15:25:24 2022
% 0.89/1.16 Prover9 interrupted
%------------------------------------------------------------------------------