TSTP Solution File: LAT270-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT270-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n032.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:38 EDT 2022
% Result : Unsatisfiable 0.65s 0.91s
% Output : Refutation 0.65s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : LAT270-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.31 % Computer : n032.cluster.edu
% 0.12/0.31 % Model : x86_64 x86_64
% 0.12/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.31 % Memory : 8042.1875MB
% 0.12/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.31 % CPULimit : 300
% 0.17/0.31 % WCLimit : 600
% 0.17/0.31 % DateTime : Tue Jun 28 22:35:12 EDT 2022
% 0.17/0.31 % CPUTime :
% 0.65/0.91 ============================== Prover9 ===============================
% 0.65/0.91 Prover9 (32) version 2009-11A, November 2009.
% 0.65/0.91 Process 17464 was started by sandbox on n032.cluster.edu,
% 0.65/0.91 Tue Jun 28 22:35:13 2022
% 0.65/0.91 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17311_n032.cluster.edu".
% 0.65/0.91 ============================== end of head ===========================
% 0.65/0.91
% 0.65/0.91 ============================== INPUT =================================
% 0.65/0.91
% 0.65/0.91 % Reading from file /tmp/Prover9_17311_n032.cluster.edu
% 0.65/0.91
% 0.65/0.91 set(prolog_style_variables).
% 0.65/0.91 set(auto2).
% 0.65/0.91 % set(auto2) -> set(auto).
% 0.65/0.91 % set(auto) -> set(auto_inference).
% 0.65/0.91 % set(auto) -> set(auto_setup).
% 0.65/0.91 % set(auto_setup) -> set(predicate_elim).
% 0.65/0.91 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.65/0.91 % set(auto) -> set(auto_limits).
% 0.65/0.91 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.65/0.91 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.65/0.91 % set(auto) -> set(auto_denials).
% 0.65/0.91 % set(auto) -> set(auto_process).
% 0.65/0.91 % set(auto2) -> assign(new_constants, 1).
% 0.65/0.91 % set(auto2) -> assign(fold_denial_max, 3).
% 0.65/0.91 % set(auto2) -> assign(max_weight, "200.000").
% 0.65/0.91 % set(auto2) -> assign(max_hours, 1).
% 0.65/0.91 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.65/0.91 % set(auto2) -> assign(max_seconds, 0).
% 0.65/0.91 % set(auto2) -> assign(max_minutes, 5).
% 0.65/0.91 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.65/0.91 % set(auto2) -> set(sort_initial_sos).
% 0.65/0.91 % set(auto2) -> assign(sos_limit, -1).
% 0.65/0.91 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.65/0.91 % set(auto2) -> assign(max_megs, 400).
% 0.65/0.91 % set(auto2) -> assign(stats, some).
% 0.65/0.91 % set(auto2) -> clear(echo_input).
% 0.65/0.91 % set(auto2) -> set(quiet).
% 0.65/0.91 % set(auto2) -> clear(print_initial_clauses).
% 0.65/0.91 % set(auto2) -> clear(print_given).
% 0.65/0.91 assign(lrs_ticks,-1).
% 0.65/0.91 assign(sos_limit,10000).
% 0.65/0.91 assign(order,kbo).
% 0.65/0.91 set(lex_order_vars).
% 0.65/0.91 clear(print_given).
% 0.65/0.91
% 0.65/0.91 % formulas(sos). % not echoed (5 formulas)
% 0.65/0.91
% 0.65/0.91 ============================== end of input ==========================
% 0.65/0.91
% 0.65/0.91 % From the command line: assign(max_seconds, 300).
% 0.65/0.91
% 0.65/0.91 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.65/0.91
% 0.65/0.91 % Formulas that are not ordinary clauses:
% 0.65/0.91
% 0.65/0.91 ============================== end of process non-clausal formulas ===
% 0.65/0.91
% 0.65/0.91 ============================== PROCESS INITIAL CLAUSES ===============
% 0.65/0.91
% 0.65/0.91 ============================== PREDICATE ELIMINATION =================
% 0.65/0.91
% 0.65/0.91 ============================== end predicate elimination =============
% 0.65/0.91
% 0.65/0.91 Auto_denials:
% 0.65/0.91 % copying label cls_conjecture_6 to answer in negative clause
% 0.65/0.91
% 0.65/0.91 Term ordering decisions:
% 0.65/0.91
% 0.65/0.91 % Assigning unary symbol tc_set kb_weight 0 and highest precedence (10).
% 0.65/0.91 Function symbol KB weights: t_a=1. v_A=1. v_a=1. v_b=1. v_r=1. v_S=1. c_Tarski_Ointerval=1. tc_set=0.
% 0.65/0.91
% 0.65/0.91 ============================== end of process initial clauses ========
% 0.65/0.91
% 0.65/0.91 ============================== CLAUSES FOR SEARCH ====================
% 0.65/0.91
% 0.65/0.91 ============================== end of clauses for search =============
% 0.65/0.91
% 0.65/0.91 ============================== SEARCH ================================
% 0.65/0.91
% 0.65/0.91 % Starting search at 0.01 seconds.
% 0.65/0.91
% 0.65/0.91 ============================== PROOF =================================
% 0.65/0.91 % SZS status Unsatisfiable
% 0.65/0.91 % SZS output start Refutation
% 0.65/0.91
% 0.65/0.91 % Proof 1 at 0.01 (+ 0.00) seconds: cls_conjecture_6.
% 0.65/0.91 % Length of proof is 7.
% 0.65/0.91 % Level of proof is 2.
% 0.65/0.91 % Maximum clause weight is 22.000.
% 0.65/0.91 % Given clauses 5.
% 0.65/0.91
% 0.65/0.91 1 c_in(v_a,v_A,t_a) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.65/0.91 2 c_in(v_b,v_A,t_a) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 0.65/0.91 3 c_lessequals(v_S,c_Tarski_Ointerval(v_r,v_a,v_b,t_a),tc_set(t_a)) # label(cls_conjecture_2) # label(negated_conjecture). [assumption].
% 0.65/0.91 4 -c_lessequals(v_S,v_A,tc_set(t_a)) # label(cls_conjecture_6) # label(negated_conjecture) # answer(cls_conjecture_6). [assumption].
% 0.65/0.91 5 -c_in(A,v_A,t_a) | -c_in(B,v_A,t_a) | -c_lessequals(C,c_Tarski_Ointerval(v_r,B,A,t_a),tc_set(t_a)) | c_lessequals(C,v_A,tc_set(t_a)) # label(cls_Tarski_O_91_124_Aa1_A_58_AA_59_Ab1_A_58_AA_59_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_A_124_93_A_61_61_62_AS1_A_60_61_AA_A_61_61_ATrue_0) # label(axiom). [assumption].
% 0.65/0.91 7 c_lessequals(v_S,v_A,tc_set(t_a)). [ur(5,a,2,a,b,1,a,c,3,a)].
% 0.65/0.91 8 $F # answer(cls_conjecture_6). [resolve(7,a,4,a)].
% 0.65/0.91
% 0.65/0.91 % SZS output end Refutation
% 0.65/0.91 ============================== end of proof ==========================
% 0.65/0.91
% 0.65/0.91 ============================== STATISTICS ============================
% 0.65/0.91
% 0.65/0.91 Given=5. Generated=7. Kept=7. proofs=1.
% 0.65/0.91 Usable=5. Sos=0. Demods=0. Limbo=1, Disabled=5. Hints=0.
% 0.65/0.91 Megabytes=0.03.
% 0.65/0.91 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.65/0.91
% 0.65/0.91 ============================== end of statistics =====================
% 0.65/0.91
% 0.65/0.91 ============================== end of search =========================
% 0.65/0.91
% 0.65/0.91 THEOREM PROVED
% 0.65/0.91 % SZS status Unsatisfiable
% 0.65/0.91
% 0.65/0.91 Exiting with 1 proof.
% 0.65/0.91
% 0.65/0.91 Process 17464 exit (max_proofs) Tue Jun 28 22:35:13 2022
% 0.65/0.91 Prover9 interrupted
%------------------------------------------------------------------------------