TSTP Solution File: LAT266-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT266-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n011.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:34 EDT 2022
% Result : Unsatisfiable 0.66s 0.97s
% Output : Refutation 0.66s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LAT266-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n011.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 05:41:03 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.66/0.97 ============================== Prover9 ===============================
% 0.66/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.66/0.97 Process 1133 was started by sandbox2 on n011.cluster.edu,
% 0.66/0.97 Thu Jun 30 05:41:03 2022
% 0.66/0.97 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_940_n011.cluster.edu".
% 0.66/0.97 ============================== end of head ===========================
% 0.66/0.97
% 0.66/0.97 ============================== INPUT =================================
% 0.66/0.97
% 0.66/0.97 % Reading from file /tmp/Prover9_940_n011.cluster.edu
% 0.66/0.97
% 0.66/0.97 set(prolog_style_variables).
% 0.66/0.97 set(auto2).
% 0.66/0.97 % set(auto2) -> set(auto).
% 0.66/0.97 % set(auto) -> set(auto_inference).
% 0.66/0.97 % set(auto) -> set(auto_setup).
% 0.66/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.66/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.66/0.97 % set(auto) -> set(auto_limits).
% 0.66/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.66/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.66/0.97 % set(auto) -> set(auto_denials).
% 0.66/0.97 % set(auto) -> set(auto_process).
% 0.66/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.66/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.66/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.66/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.66/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.66/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.66/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.66/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.66/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.66/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.66/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.66/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.66/0.97 % set(auto2) -> assign(stats, some).
% 0.66/0.97 % set(auto2) -> clear(echo_input).
% 0.66/0.97 % set(auto2) -> set(quiet).
% 0.66/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.66/0.97 % set(auto2) -> clear(print_given).
% 0.66/0.97 assign(lrs_ticks,-1).
% 0.66/0.97 assign(sos_limit,10000).
% 0.66/0.97 assign(order,kbo).
% 0.66/0.97 set(lex_order_vars).
% 0.66/0.97 clear(print_given).
% 0.66/0.97
% 0.66/0.97 % formulas(sos). % not echoed (4 formulas)
% 0.66/0.97
% 0.66/0.97 ============================== end of input ==========================
% 0.66/0.97
% 0.66/0.97 % From the command line: assign(max_seconds, 300).
% 0.66/0.97
% 0.66/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.66/0.97
% 0.66/0.97 % Formulas that are not ordinary clauses:
% 0.66/0.97
% 0.66/0.97 ============================== end of process non-clausal formulas ===
% 0.66/0.97
% 0.66/0.97 ============================== PROCESS INITIAL CLAUSES ===============
% 0.66/0.97
% 0.66/0.97 ============================== PREDICATE ELIMINATION =================
% 0.66/0.97
% 0.66/0.97 ============================== end predicate elimination =============
% 0.66/0.97
% 0.66/0.97 Auto_denials:
% 0.66/0.97 % copying label cls_conjecture_2 to answer in negative clause
% 0.66/0.97
% 0.66/0.97 Term ordering decisions:
% 0.66/0.97
% 0.66/0.97 % Assigning unary symbol tc_set kb_weight 0 and highest precedence (10).
% 0.66/0.97 Function symbol KB weights: tc_Product__Type_Ounit=1. t_a=1. v_cl=1. v_A=1. v_S=1. c_Tarski_Odual=1. c_Tarski_Opotype_Opset=1. tc_set=0.
% 0.66/0.97
% 0.66/0.97 ============================== PROOF =================================
% 0.66/0.97 % SZS status Unsatisfiable
% 0.66/0.97 % SZS output start Refutation
% 0.66/0.97
% 0.66/0.97 % Proof 1 at 0.01 (+ 0.00) seconds: cls_conjecture_2.
% 0.66/0.97 % Length of proof is 8.
% 0.66/0.97 % Level of proof is 3.
% 0.66/0.97 % Maximum clause weight is 11.000.
% 0.66/0.97 % Given clauses 0.
% 0.66/0.97
% 0.66/0.97 1 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.66/0.97 2 c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit) = v_A. [copy(1),flip(a)].
% 0.66/0.97 3 c_lessequals(v_S,c_Tarski_Opotype_Opset(v_cl,t_a,tc_Product__Type_Ounit),tc_set(t_a)) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.66/0.97 4 c_lessequals(v_S,v_A,tc_set(t_a)). [copy(3),rewrite([2(5)])].
% 0.66/0.97 5 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.66/0.97 6 -c_lessequals(v_S,c_Tarski_Opotype_Opset(c_Tarski_Odual(v_cl,t_a),t_a,tc_Product__Type_Ounit),tc_set(t_a)) # label(cls_conjecture_2) # label(negated_conjecture) # answer(cls_conjecture_2). [assumption].
% 0.66/0.97 7 -c_lessequals(v_S,v_A,tc_set(t_a)) # answer(cls_conjecture_2). [copy(6),rewrite([5(7),2(5)])].
% 0.66/0.97 8 $F # answer(cls_conjecture_2). [resolve(7,a,4,a)].
% 0.66/0.97
% 0.66/0.97 % SZS output end Refutation
% 0.66/0.97 ============================== end of proof ==========================
% 0.66/0.97
% 0.66/0.97 ============================== STATISTICS ============================
% 0.66/0.97
% 0.66/0.97 Given=0. Generated=4. Kept=4. proofs=1.
% 0.66/0.97 Usable=0. Sos=0. Demods=2. Limbo=3, Disabled=4. Hints=0.
% 0.66/0.97 Megabytes=0.02.
% 0.66/0.97 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.66/0.97
% 0.66/0.97 ============================== end of statistics =====================
% 0.66/0.97
% 0.66/0.97 ============================== end of search =========================
% 0.66/0.97
% 0.66/0.97 THEOREM PROVED
% 0.66/0.97 % SZS status Unsatisfiable
% 0.66/0.97
% 0.66/0.97 Exiting with 1 proof.
% 0.66/0.97
% 0.66/0.97 Process 1133 exit (max_proofs) Thu Jun 30 05:41:03 2022
% 0.66/0.97 Prover9 interrupted
%------------------------------------------------------------------------------