TSTP Solution File: LAT268-10 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT268-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:35 EDT 2022
% Result : Unsatisfiable 0.67s 0.98s
% Output : Refutation 0.67s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : LAT268-10 : TPTP v8.1.0. Released v7.5.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.33 % Computer : n027.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Wed Jun 29 19:50:05 EDT 2022
% 0.11/0.34 % CPUTime :
% 0.67/0.98 ============================== Prover9 ===============================
% 0.67/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.67/0.98 Process 6896 was started by sandbox on n027.cluster.edu,
% 0.67/0.98 Wed Jun 29 19:50:06 2022
% 0.67/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_6743_n027.cluster.edu".
% 0.67/0.98 ============================== end of head ===========================
% 0.67/0.98
% 0.67/0.98 ============================== INPUT =================================
% 0.67/0.98
% 0.67/0.98 % Reading from file /tmp/Prover9_6743_n027.cluster.edu
% 0.67/0.98
% 0.67/0.98 set(prolog_style_variables).
% 0.67/0.98 set(auto2).
% 0.67/0.98 % set(auto2) -> set(auto).
% 0.67/0.98 % set(auto) -> set(auto_inference).
% 0.67/0.98 % set(auto) -> set(auto_setup).
% 0.67/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.67/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.67/0.98 % set(auto) -> set(auto_limits).
% 0.67/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.67/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.67/0.98 % set(auto) -> set(auto_denials).
% 0.67/0.98 % set(auto) -> set(auto_process).
% 0.67/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.67/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.67/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.67/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.67/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.67/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.67/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.67/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.67/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.67/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.67/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.67/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.67/0.98 % set(auto2) -> assign(stats, some).
% 0.67/0.98 % set(auto2) -> clear(echo_input).
% 0.67/0.98 % set(auto2) -> set(quiet).
% 0.67/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.67/0.98 % set(auto2) -> clear(print_given).
% 0.67/0.98 assign(lrs_ticks,-1).
% 0.67/0.98 assign(sos_limit,10000).
% 0.67/0.98 assign(order,kbo).
% 0.67/0.98 set(lex_order_vars).
% 0.67/0.98 clear(print_given).
% 0.67/0.98
% 0.67/0.98 % formulas(sos). % not echoed (12 formulas)
% 0.67/0.98
% 0.67/0.98 ============================== end of input ==========================
% 0.67/0.98
% 0.67/0.98 % From the command line: assign(max_seconds, 300).
% 0.67/0.98
% 0.67/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.67/0.98
% 0.67/0.98 % Formulas that are not ordinary clauses:
% 0.67/0.98
% 0.67/0.98 ============================== end of process non-clausal formulas ===
% 0.67/0.98
% 0.67/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.67/0.98
% 0.67/0.98 ============================== PREDICATE ELIMINATION =================
% 0.67/0.98
% 0.67/0.98 ============================== end predicate elimination =============
% 0.67/0.98
% 0.67/0.98 Auto_denials:
% 0.67/0.98 % copying label cls_conjecture_2 to answer in negative clause
% 0.67/0.98
% 0.67/0.98 Term ordering decisions:
% 0.67/0.98
% 0.67/0.98 % Assigning unary symbol tc_set kb_weight 0 and highest precedence (23).
% 0.67/0.98 Function symbol KB weights: true=1. 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_in=1. c_Tarski_Opotype_Oorder=1. c_Tarski_Opotype_Opset=1. c_Tarski_Olub=1. c_lessequals=1. c_Tarski_Oglb=1. ifeq=1. c_Pair=1. tc_set=0.
% 0.67/0.98
% 0.67/0.98 ============================== end of process initial clauses ========
% 0.67/0.98
% 0.67/0.98 ============================== CLAUSES FOR SEARCH ====================
% 0.67/0.98
% 0.67/0.98 ============================== end of clauses for search =============
% 0.67/0.98
% 0.67/0.98 ============================== SEARCH ================================
% 0.67/0.98
% 0.67/0.98 % Starting search at 0.01 seconds.
% 0.67/0.98
% 0.67/0.98 ============================== PROOF =================================
% 0.67/0.98 % SZS status Unsatisfiable
% 0.67/0.98 % SZS output start Refutation
% 0.67/0.98
% 0.67/0.98 % Proof 1 at 0.01 (+ 0.00) seconds: cls_conjecture_2.
% 0.67/0.98 % Length of proof is 24.
% 0.67/0.98 % Level of proof is 6.
% 0.67/0.98 % Maximum clause weight is 81.000.
% 0.67/0.98 % Given clauses 16.
% 0.67/0.98
% 0.67/0.98 1 c_in(v_x,v_S,t_a) = true # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 0.67/0.98 2 true = c_in(v_x,v_S,t_a). [copy(1),flip(a)].
% 0.67/0.98 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.67/0.98 4 c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit) = v_A. [copy(3),flip(a)].
% 0.67/0.98 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.67/0.98 6 ifeq(A,A,B,C) = B # label(ifeq_axiom) # label(axiom). [assumption].
% 0.67/0.98 7 c_lessequals(v_S,v_A,tc_set(t_a)) = true # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.67/0.98 8 c_lessequals(v_S,v_A,tc_set(t_a)) = c_in(v_x,v_S,t_a). [copy(7),rewrite([2(6)])].
% 0.67/0.98 9 c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)) = true # label(cls_Tarski_Odual_Acl_A_58_ACompleteLattice_0) # label(axiom). [assumption].
% 0.67/0.98 10 c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)) = c_in(v_x,v_S,t_a). [copy(9),rewrite([2(9)])].
% 0.67/0.98 11 c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)) = true # label(cls_Tarski_Odual_Acl_A_58_APartialOrder_0) # label(axiom). [assumption].
% 0.67/0.98 12 c_in(c_Tarski_Odual(v_cl,t_a),c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(t_a,tc_Product__Type_Ounit)) = c_in(v_x,v_S,t_a). [copy(11),rewrite([2(9)])].
% 0.67/0.98 13 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.67/0.98 14 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.67/0.98 15 ifeq(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)),true,c_in(c_Pair(B,A,C,C),c_Tarski_Opotype_Oorder(D,C,tc_Product__Type_Ounit),tc_prod(C,C)),true) = true # 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.67/0.98 16 ifeq(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(v_x,v_S,t_a),c_in(c_Pair(B,A,C,C),c_Tarski_Opotype_Oorder(D,C,tc_Product__Type_Ounit),tc_prod(C,C)),c_in(v_x,v_S,t_a)) = c_in(v_x,v_S,t_a). [copy(15),rewrite([2(7),2(16),2(21)])].
% 0.67/0.98 17 ifeq(c_lessequals(A,c_Tarski_Opotype_Opset(B,C,tc_Product__Type_Ounit),tc_set(C)),true,ifeq(c_in(B,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(C,tc_Product__Type_Ounit)),true,ifeq(c_in(B,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(C,tc_Product__Type_Ounit)),true,ifeq(c_in(D,A,C),true,c_in(c_Pair(D,c_Tarski_Olub(A,B,C),C,C),c_Tarski_Opotype_Oorder(B,C,tc_Product__Type_Ounit),tc_prod(C,C)),true),true),true),true) = true # label(cls_Tarski_OCL_Olub__upper_0) # label(axiom). [assumption].
% 0.67/0.98 18 ifeq(c_lessequals(A,c_Tarski_Opotype_Opset(B,C,tc_Product__Type_Ounit),tc_set(C)),c_in(v_x,v_S,t_a),ifeq(c_in(B,c_Tarski_OCompleteLattice,tc_Tarski_Opotype_Opotype__ext__type(C,tc_Product__Type_Ounit)),c_in(v_x,v_S,t_a),ifeq(c_in(B,c_Tarski_OPartialOrder,tc_Tarski_Opotype_Opotype__ext__type(C,tc_Product__Type_Ounit)),c_in(v_x,v_S,t_a),ifeq(c_in(D,A,C),c_in(v_x,v_S,t_a),c_in(c_Pair(D,c_Tarski_Olub(A,B,C),C,C),c_Tarski_Opotype_Oorder(B,C,tc_Product__Type_Ounit),tc_prod(C,C)),c_in(v_x,v_S,t_a)),c_in(v_x,v_S,t_a)),c_in(v_x,v_S,t_a)),c_in(v_x,v_S,t_a)) = c_in(v_x,v_S,t_a). [copy(17),rewrite([2(5),2(13),2(21),2(26),2(36),2(41),2(46),2(51),2(56)])].
% 0.67/0.98 19 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)) != true # label(cls_conjecture_2) # label(negated_conjecture) # answer(cls_conjecture_2). [assumption].
% 0.67/0.98 20 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)) != c_in(v_x,v_S,t_a) # answer(cls_conjecture_2). [copy(19),rewrite([13(4),5(11),2(19)])].
% 0.67/0.98 23 ifeq(c_lessequals(A,v_A,tc_set(t_a)),c_in(v_x,v_S,t_a),ifeq(c_in(B,A,t_a),c_in(v_x,v_S,t_a),c_in(c_Pair(B,c_Tarski_Olub(A,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)),c_in(v_x,v_S,t_a)),c_in(v_x,v_S,t_a)) = c_in(v_x,v_S,t_a). [para(10(a,1),18(a,1,3,1)),rewrite([14(6),4(4),12(24),6(58),6(50)])].
% 0.67/0.98 29 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)) = c_in(v_x,v_S,t_a). [para(6(a,1),23(a,1,3)),rewrite([8(5),6(33)])].
% 0.67/0.98 31 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)) = c_in(v_x,v_S,t_a). [para(29(a,1),16(a,1,1)),rewrite([6(31)])].
% 0.67/0.98 32 $F # answer(cls_conjecture_2). [resolve(31,a,20,a)].
% 0.67/0.98
% 0.67/0.98 % SZS output end Refutation
% 0.67/0.98 ============================== end of proof ==========================
% 0.67/0.98
% 0.67/0.98 ============================== STATISTICS ============================
% 0.67/0.98
% 0.67/0.98 Given=16. Generated=41. Kept=23. proofs=1.
% 0.67/0.98 Usable=16. Sos=6. Demods=21. Limbo=0, Disabled=12. Hints=0.
% 0.67/0.98 Megabytes=0.15.
% 0.67/0.98 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.67/0.98
% 0.67/0.98 ============================== end of statistics =====================
% 0.67/0.98
% 0.67/0.98 ============================== end of search =========================
% 0.67/0.98
% 0.67/0.98 THEOREM PROVED
% 0.67/0.98 % SZS status Unsatisfiable
% 0.67/0.98
% 0.67/0.98 Exiting with 1 proof.
% 0.67/0.98
% 0.67/0.98 Process 6896 exit (max_proofs) Wed Jun 29 19:50:06 2022
% 0.67/0.99 Prover9 interrupted
%------------------------------------------------------------------------------