TSTP Solution File: LAT268-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT268-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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:26:36 EDT 2022
% Result : Unsatisfiable 0.71s 0.99s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : LAT268-2 : TPTP v8.1.0. Released v3.2.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n015.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 : Wed Jun 29 00:29:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/0.99 ============================== Prover9 ===============================
% 0.71/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.71/0.99 Process 31788 was started by sandbox2 on n015.cluster.edu,
% 0.71/0.99 Wed Jun 29 00:29:26 2022
% 0.71/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_31635_n015.cluster.edu".
% 0.71/0.99 ============================== end of head ===========================
% 0.71/0.99
% 0.71/0.99 ============================== INPUT =================================
% 0.71/0.99
% 0.71/0.99 % Reading from file /tmp/Prover9_31635_n015.cluster.edu
% 0.71/0.99
% 0.71/0.99 set(prolog_style_variables).
% 0.71/0.99 set(auto2).
% 0.71/0.99 % set(auto2) -> set(auto).
% 0.71/0.99 % set(auto) -> set(auto_inference).
% 0.71/0.99 % set(auto) -> set(auto_setup).
% 0.71/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.71/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/0.99 % set(auto) -> set(auto_limits).
% 0.71/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/0.99 % set(auto) -> set(auto_denials).
% 0.71/0.99 % set(auto) -> set(auto_process).
% 0.71/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.71/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.71/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.71/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.71/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.71/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.71/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.71/0.99 % set(auto2) -> assign(stats, some).
% 0.71/0.99 % set(auto2) -> clear(echo_input).
% 0.71/0.99 % set(auto2) -> set(quiet).
% 0.71/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.71/0.99 % set(auto2) -> clear(print_given).
% 0.71/0.99 assign(lrs_ticks,-1).
% 0.71/0.99 assign(sos_limit,10000).
% 0.71/0.99 assign(order,kbo).
% 0.71/0.99 set(lex_order_vars).
% 0.71/0.99 clear(print_given).
% 0.71/0.99
% 0.71/0.99 % formulas(sos). % not echoed (11 formulas)
% 0.71/0.99
% 0.71/0.99 ============================== end of input ==========================
% 0.71/0.99
% 0.71/0.99 % From the command line: assign(max_seconds, 300).
% 0.71/0.99
% 0.71/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/0.99
% 0.71/0.99 % Formulas that are not ordinary clauses:
% 0.71/0.99
% 0.71/0.99 ============================== end of process non-clausal formulas ===
% 0.71/0.99
% 0.71/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/0.99
% 0.71/0.99 ============================== PREDICATE ELIMINATION =================
% 0.71/0.99
% 0.71/0.99 ============================== end predicate elimination =============
% 0.71/0.99
% 0.71/0.99 Auto_denials:
% 0.71/0.99 % copying label cls_conjecture_2 to answer in negative clause
% 0.71/0.99
% 0.71/0.99 Term ordering decisions:
% 0.71/0.99
% 0.71/0.99 % Assigning unary symbol tc_set kb_weight 0 and highest precedence (21).
% 0.71/0.99 Function symbol KB weights: tc_Product__Type_Ounit=1. t_a=1. v_cl=1. c_Tarski_OCompleteLattice=1. c_Tarski_OPartialOrder=1. v_A=1. v_S=1. v_r=1. v_x=1. c_Tarski_Odual=1. tc_Tarski_Opotype_Opotype__ext__type=1. tc_prod=1. c_Tarski_Opotype_Oorder=1. c_Tarski_Opotype_Opset=1. c_Tarski_Olub=1. c_Tarski_Oglb=1. c_Pair=1. tc_set=0.
% 0.71/0.99
% 0.71/0.99 ============================== end of process initial clauses ========
% 0.71/0.99
% 0.71/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.71/0.99
% 0.71/0.99 ============================== end of clauses for search =============
% 0.71/0.99
% 0.71/0.99 ============================== SEARCH ================================
% 0.71/0.99
% 0.71/0.99 % Starting search at 0.01 seconds.
% 0.71/0.99
% 0.71/0.99 ============================== PROOF =================================
% 0.71/0.99 % SZS status Unsatisfiable
% 0.71/0.99 % SZS output start Refutation
% 0.71/0.99
% 0.71/0.99 % Proof 1 at 0.01 (+ 0.00) seconds: cls_conjecture_2.
% 0.71/0.99 % Length of proof is 16.
% 0.71/0.99 % Level of proof is 4.
% 0.71/0.99 % Maximum clause weight is 40.000.
% 0.71/0.99 % Given clauses 12.
% 0.71/0.99
% 0.71/0.99 1 c_in(v_x,v_S,t_a) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 0.71/0.99 2 c_lessequals(v_S,v_A,tc_set(t_a)) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.71/0.99 3 v_A = c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit) # label(cls_Tarski_OA_A_61_61_Apset_Acl_0) # label(axiom). [assumption].
% 0.71/0.99 4 c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit) = v_A. [copy(3),flip(a)].
% 0.71/0.99 5 v_r = c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit) # label(cls_Tarski_Or_A_61_61_Aorder_Acl_0) # label(axiom). [assumption].
% 0.71/0.99 6 c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)) # label(cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0) # label(axiom). [assumption].
% 0.71/0.99 7 c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)) # label(cls_Tarski_Odual_Acl_A_58_APartialOrder_0) # label(axiom). [assumption].
% 0.71/0.99 8 c_Tarski_Oglb(A,B,C) = c_Tarski_Olub(A,c_Tarski_Odual(B,C),C) # label(cls_Tarski_Oglb__dual__lub_0) # label(axiom). [assumption].
% 0.71/0.99 9 c_Tarski_Opotype_Opset(c_Tarski_Odual(A,B),B,tc_Product__Type_Ounit) = c_Tarski_Opotype_Opset(A,B,tc_Product__Type_Ounit) # label(cls_Tarski_Opset_A_Idual_Acl_J_A_61_61_Apset_Acl_0) # label(axiom). [assumption].
% 0.71/0.99 10 -c_in(c_Pair(c_Tarski_Oglb(v_S,v_cl,t_a),v_x,t_a,t_a),v_r,tc_prod(t_a,t_a)) # label(cls_conjecture_2) # label(negated_conjecture) # answer(cls_conjecture_2). [assumption].
% 0.71/0.99 11 -c_in(c_Pair(c_Tarski_Olub(v_S,c_Tarski_Odual(v_cl,t_a),t_a),v_x,t_a,t_a),c_Tarski_Opotype_Oorder(v_cl,t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)) # answer(cls_conjecture_2). [copy(10),rewrite([8(4),5(11)])].
% 0.71/0.99 12 -c_in(c_Pair(A,B,C,C),c_Tarski_Opotype_Oorder(c_Tarski_Odual(D,C),C,tc_Product__Type_Ounit),tc_prod(C,C)) | c_in(c_Pair(B,A,C,C),c_Tarski_Opotype_Oorder(D,C,tc_Product__Type_Ounit),tc_prod(C,C)) # label(cls_Tarski_O_Ix1_M_Ay1_J_A_58_Aorder_A_Idual_Acl_J_A_61_61_A_Iy1_M_Ax1_J_A_58_Aorder_Acl_0) # label(axiom). [assumption].
% 0.71/0.99 13 -c_in(A,B,C) | -c_in(D,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(C,tc_Product__Type_Ounit)) | -c_in(D,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(C,tc_Product__Type_Ounit)) | -c_lessequals(B,c_Tarski_Opotype_Opset(D,C,tc_Product__Type_Ounit),tc_set(C)) | c_in(c_Pair(A,c_Tarski_Olub(B,D,C),C,C),c_Tarski_Opotype_Oorder(D,C,tc_Product__Type_Ounit),tc_prod(C,C)) # label(cls_Tarski_OCL_Olub__upper_0) # label(axiom). [assumption].
% 0.71/0.99 14 -c_in(c_Pair(v_x,c_Tarski_Olub(v_S,c_Tarski_Odual(v_cl,t_a),t_a),t_a,t_a),c_Tarski_Opotype_Oorder(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_prod(t_a,t_a)) # answer(cls_conjecture_2). [ur(12,b,11,a)].
% 0.71/0.99 17 -c_lessequals(v_S,v_A,tc_set(t_a)) # answer(cls_conjecture_2). [ur(13,a,1,a,b,6,a,c,7,a,e,14,a),rewrite([9(7),4(5)])].
% 0.71/0.99 18 $F # answer(cls_conjecture_2). [resolve(17,a,2,a)].
% 0.71/0.99
% 0.71/0.99 % SZS output end Refutation
% 0.71/0.99 ============================== end of proof ==========================
% 0.71/0.99
% 0.71/0.99 ============================== STATISTICS ============================
% 0.71/0.99
% 0.71/0.99 Given=12. Generated=22. Kept=15. proofs=1.
% 0.71/0.99 Usable=12. Sos=2. Demods=4. Limbo=0, Disabled=11. Hints=0.
% 0.71/0.99 Megabytes=0.07.
% 0.71/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.71/0.99
% 0.71/0.99 ============================== end of statistics =====================
% 0.71/0.99
% 0.71/0.99 ============================== end of search =========================
% 0.71/0.99
% 0.71/0.99 THEOREM PROVED
% 0.71/0.99 % SZS status Unsatisfiable
% 0.71/0.99
% 0.71/0.99 Exiting with 1 proof.
% 0.71/0.99
% 0.71/0.99 Process 31788 exit (max_proofs) Wed Jun 29 00:29:26 2022
% 0.71/0.99 Prover9 interrupted
%------------------------------------------------------------------------------