TSTP Solution File: LAT037-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT037-1 : TPTP v8.1.0. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n004.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.82s 1.10s
% Output : Refutation 0.82s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT037-1 : TPTP v8.1.0. Released v2.4.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n004.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 30 13:04:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.82/1.10 ============================== Prover9 ===============================
% 0.82/1.10 Prover9 (32) version 2009-11A, November 2009.
% 0.82/1.10 Process 27917 was started by sandbox2 on n004.cluster.edu,
% 0.82/1.10 Thu Jun 30 13:04:53 2022
% 0.82/1.10 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_27762_n004.cluster.edu".
% 0.82/1.10 ============================== end of head ===========================
% 0.82/1.10
% 0.82/1.10 ============================== INPUT =================================
% 0.82/1.10
% 0.82/1.10 % Reading from file /tmp/Prover9_27762_n004.cluster.edu
% 0.82/1.10
% 0.82/1.10 set(prolog_style_variables).
% 0.82/1.10 set(auto2).
% 0.82/1.10 % set(auto2) -> set(auto).
% 0.82/1.10 % set(auto) -> set(auto_inference).
% 0.82/1.10 % set(auto) -> set(auto_setup).
% 0.82/1.10 % set(auto_setup) -> set(predicate_elim).
% 0.82/1.10 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.82/1.10 % set(auto) -> set(auto_limits).
% 0.82/1.10 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.82/1.10 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.82/1.10 % set(auto) -> set(auto_denials).
% 0.82/1.10 % set(auto) -> set(auto_process).
% 0.82/1.10 % set(auto2) -> assign(new_constants, 1).
% 0.82/1.10 % set(auto2) -> assign(fold_denial_max, 3).
% 0.82/1.10 % set(auto2) -> assign(max_weight, "200.000").
% 0.82/1.10 % set(auto2) -> assign(max_hours, 1).
% 0.82/1.10 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.82/1.10 % set(auto2) -> assign(max_seconds, 0).
% 0.82/1.10 % set(auto2) -> assign(max_minutes, 5).
% 0.82/1.10 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.82/1.10 % set(auto2) -> set(sort_initial_sos).
% 0.82/1.10 % set(auto2) -> assign(sos_limit, -1).
% 0.82/1.10 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.82/1.10 % set(auto2) -> assign(max_megs, 400).
% 0.82/1.10 % set(auto2) -> assign(stats, some).
% 0.82/1.10 % set(auto2) -> clear(echo_input).
% 0.82/1.10 % set(auto2) -> set(quiet).
% 0.82/1.10 % set(auto2) -> clear(print_initial_clauses).
% 0.82/1.10 % set(auto2) -> clear(print_given).
% 0.82/1.10 assign(lrs_ticks,-1).
% 0.82/1.10 assign(sos_limit,10000).
% 0.82/1.10 assign(order,kbo).
% 0.82/1.10 set(lex_order_vars).
% 0.82/1.10 clear(print_given).
% 0.82/1.10
% 0.82/1.10 % formulas(sos). % not echoed (20 formulas)
% 0.82/1.10
% 0.82/1.10 ============================== end of input ==========================
% 0.82/1.10
% 0.82/1.10 % From the command line: assign(max_seconds, 300).
% 0.82/1.10
% 0.82/1.10 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.82/1.10
% 0.82/1.10 % Formulas that are not ordinary clauses:
% 0.82/1.10
% 0.82/1.10 ============================== end of process non-clausal formulas ===
% 0.82/1.10
% 0.82/1.10 ============================== PROCESS INITIAL CLAUSES ===============
% 0.82/1.10
% 0.82/1.10 ============================== PREDICATE ELIMINATION =================
% 0.82/1.10
% 0.82/1.10 ============================== end predicate elimination =============
% 0.82/1.10
% 0.82/1.10 Auto_denials:
% 0.82/1.10 % copying label rhs to answer in negative clause
% 0.82/1.10
% 0.82/1.10 Term ordering decisions:
% 0.82/1.10 Function symbol KB weights: n0=1. n1=1. xx=1. yy=1. zz=1. meet=1. join=1.
% 0.82/1.10
% 0.82/1.10 ============================== end of process initial clauses ========
% 0.82/1.10
% 0.82/1.10 ============================== CLAUSES FOR SEARCH ====================
% 0.82/1.10
% 0.82/1.10 ============================== end of clauses for search =============
% 0.82/1.10
% 0.82/1.10 ============================== SEARCH ================================
% 0.82/1.10
% 0.82/1.10 % Starting search at 0.01 seconds.
% 0.82/1.10
% 0.82/1.10 ============================== PROOF =================================
% 0.82/1.10 % SZS status Unsatisfiable
% 0.82/1.10 % SZS output start Refutation
% 0.82/1.10
% 0.82/1.10 % Proof 1 at 0.13 (+ 0.01) seconds: rhs.
% 0.82/1.10 % Length of proof is 35.
% 0.82/1.10 % Level of proof is 8.
% 0.82/1.10 % Maximum clause weight is 17.000.
% 0.82/1.10 % Given clauses 78.
% 0.82/1.10
% 0.82/1.10 3 meet(A,n0) = n0 # label(x_meet_0) # label(axiom). [assumption].
% 0.82/1.10 4 join(A,n0) = A # label(x_join_0) # label(axiom). [assumption].
% 0.82/1.10 5 meet(A,n1) = A # label(x_meet_1) # label(axiom). [assumption].
% 0.82/1.10 6 join(A,n1) = n1 # label(x_join_1) # label(axiom). [assumption].
% 0.82/1.10 7 join(xx,yy) = n1 # label(lhs1) # label(axiom). [assumption].
% 0.82/1.10 8 join(xx,zz) = n1 # label(lhs2) # label(axiom). [assumption].
% 0.82/1.10 9 meet(xx,yy) = n0 # label(lhs3) # label(axiom). [assumption].
% 0.82/1.10 10 meet(xx,zz) = n0 # label(lhs4) # label(axiom). [assumption].
% 0.82/1.10 13 meet(A,B) = meet(B,A) # label(commutativity_of_meet) # label(axiom). [assumption].
% 0.82/1.10 14 join(A,B) = join(B,A) # label(commutativity_of_join) # label(axiom). [assumption].
% 0.82/1.10 17 join(join(A,B),C) = join(A,join(B,C)) # label(associativity_of_join) # label(axiom). [assumption].
% 0.82/1.10 18 join(A,join(B,C)) = join(C,join(A,B)). [copy(17),rewrite([14(2)]),flip(a)].
% 0.82/1.10 19 join(A,meet(B,C)) = meet(join(A,B),join(A,C)) # label(dist_join) # label(hypothesis). [assumption].
% 0.82/1.10 20 meet(join(A,B),join(A,C)) = join(A,meet(B,C)). [copy(19),flip(a)].
% 0.82/1.10 21 meet(A,join(B,C)) = join(meet(A,B),meet(A,C)) # label(dist_meet) # label(hypothesis). [assumption].
% 0.82/1.10 22 join(meet(A,B),meet(A,C)) = meet(A,join(B,C)). [copy(21),flip(a)].
% 0.82/1.10 23 yy != zz # label(rhs) # label(negated_conjecture) # answer(rhs). [assumption].
% 0.82/1.10 24 zz != yy # answer(rhs). [copy(23),flip(a)].
% 0.82/1.10 34 meet(n1,join(A,B)) = join(A,B). [para(5(a,1),20(a,2,2)),rewrite([6(3),13(3)])].
% 0.82/1.10 37 meet(join(A,B),join(B,C)) = join(B,meet(A,C)). [para(14(a,1),20(a,1,1))].
% 0.82/1.10 39 meet(join(A,join(B,C)),join(C,D)) = join(C,meet(D,join(A,B))). [para(18(a,2),20(a,1,1)),rewrite([13(6)])].
% 0.82/1.10 41 join(n0,meet(A,B)) = meet(A,B). [para(3(a,1),22(a,1,1)),rewrite([14(5),4(5)])].
% 0.82/1.10 44 join(meet(A,B),meet(B,C)) = meet(B,join(A,C)). [para(13(a,1),22(a,1,1))].
% 0.82/1.10 99 meet(A,join(B,A)) = A. [para(3(a,1),37(a,2,2)),rewrite([4(3),13(2),4(4)])].
% 0.82/1.10 102 join(zz,meet(A,xx)) = join(A,zz). [para(8(a,1),37(a,1,1)),rewrite([14(3),34(4),13(5)]),flip(a)].
% 0.82/1.10 119 meet(n1,yy) = yy. [para(7(a,1),99(a,1,2)),rewrite([13(3)])].
% 0.82/1.10 120 meet(n1,zz) = zz. [para(8(a,1),99(a,1,2)),rewrite([13(3)])].
% 0.82/1.10 124 join(n0,yy) = yy. [para(119(a,1),41(a,1,2)),rewrite([119(6)])].
% 0.82/1.10 126 join(n0,zz) = zz. [para(120(a,1),41(a,1,2)),rewrite([120(6)])].
% 0.82/1.10 169 join(yy,meet(A,join(B,xx))) = join(A,yy). [para(7(a,1),39(a,1,1,2)),rewrite([6(2),14(3),34(4)]),flip(a)].
% 0.82/1.10 193 meet(zz,join(A,xx)) = meet(A,zz). [para(10(a,1),44(a,1,1)),rewrite([13(3),41(4),14(5)]),flip(a)].
% 0.82/1.10 346 join(yy,meet(A,zz)) = join(yy,zz). [para(193(a,1),169(a,1,2)),rewrite([14(7)])].
% 0.82/1.10 356 join(yy,zz) = yy. [para(10(a,1),346(a,1,2)),rewrite([14(3),124(3)]),flip(a)].
% 0.82/1.10 372 zz = yy. [para(356(a,1),102(a,2)),rewrite([13(4),9(4),14(3),126(3)])].
% 0.82/1.10 373 $F # answer(rhs). [resolve(372,a,24,a)].
% 0.82/1.10
% 0.82/1.10 % SZS output end Refutation
% 0.82/1.10 ============================== end of proof ==========================
% 0.82/1.10
% 0.82/1.10 ============================== STATISTICS ============================
% 0.82/1.10
% 0.82/1.10 Given=78. Generated=3106. Kept=366. proofs=1.
% 0.82/1.10 Usable=67. Sos=205. Demods=261. Limbo=6, Disabled=107. Hints=0.
% 0.82/1.10 Megabytes=0.41.
% 0.82/1.10 User_CPU=0.13, System_CPU=0.01, Wall_clock=0.
% 0.82/1.10
% 0.82/1.10 ============================== end of statistics =====================
% 0.82/1.10
% 0.82/1.10 ============================== end of search =========================
% 0.82/1.10
% 0.82/1.10 THEOREM PROVED
% 0.82/1.10 % SZS status Unsatisfiable
% 0.82/1.10
% 0.82/1.10 Exiting with 1 proof.
% 0.82/1.10
% 0.82/1.10 Process 27917 exit (max_proofs) Thu Jun 30 13:04:53 2022
% 0.82/1.10 Prover9 interrupted
%------------------------------------------------------------------------------