TSTP Solution File: LAT273-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : LAT273-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:41 EDT 2022
% Result : Unsatisfiable 0.74s 1.00s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : LAT273-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n025.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 17:29:37 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.74/1.00 ============================== Prover9 ===============================
% 0.74/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.00 Process 21200 was started by sandbox on n025.cluster.edu,
% 0.74/1.00 Wed Jun 29 17:29:38 2022
% 0.74/1.00 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_21047_n025.cluster.edu".
% 0.74/1.00 ============================== end of head ===========================
% 0.74/1.00
% 0.74/1.00 ============================== INPUT =================================
% 0.74/1.00
% 0.74/1.00 % Reading from file /tmp/Prover9_21047_n025.cluster.edu
% 0.74/1.00
% 0.74/1.00 set(prolog_style_variables).
% 0.74/1.00 set(auto2).
% 0.74/1.00 % set(auto2) -> set(auto).
% 0.74/1.00 % set(auto) -> set(auto_inference).
% 0.74/1.00 % set(auto) -> set(auto_setup).
% 0.74/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.00 % set(auto) -> set(auto_limits).
% 0.74/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.00 % set(auto) -> set(auto_denials).
% 0.74/1.00 % set(auto) -> set(auto_process).
% 0.74/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.00 % set(auto2) -> assign(stats, some).
% 0.74/1.00 % set(auto2) -> clear(echo_input).
% 0.74/1.00 % set(auto2) -> set(quiet).
% 0.74/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.00 % set(auto2) -> clear(print_given).
% 0.74/1.00 assign(lrs_ticks,-1).
% 0.74/1.00 assign(sos_limit,10000).
% 0.74/1.00 assign(order,kbo).
% 0.74/1.00 set(lex_order_vars).
% 0.74/1.00 clear(print_given).
% 0.74/1.00
% 0.74/1.00 % formulas(sos). % not echoed (7 formulas)
% 0.74/1.00
% 0.74/1.00 ============================== end of input ==========================
% 0.74/1.00
% 0.74/1.00 % From the command line: assign(max_seconds, 300).
% 0.74/1.00
% 0.74/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.00
% 0.74/1.00 % Formulas that are not ordinary clauses:
% 0.74/1.00
% 0.74/1.00 ============================== end of process non-clausal formulas ===
% 0.74/1.00
% 0.74/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.00
% 0.74/1.00 ============================== PREDICATE ELIMINATION =================
% 0.74/1.00 1 -c_Tarski_OisLub(A,v_cl,B,t_a) | -c_in(C,v_A,t_a) | c_in(c_Pair(B,C,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(v_sko__4mi(A,v_r,C),A,t_a) # label(cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_0) # label(axiom). [assumption].
% 0.74/1.00 2 c_Tarski_OisLub(v_S,v_cl,v_L,t_a) # label(cls_conjecture_4) # label(negated_conjecture). [assumption].
% 0.74/1.00 Derived: -c_in(A,v_A,t_a) | c_in(c_Pair(v_L,A,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(v_sko__4mi(v_S,v_r,A),v_S,t_a). [resolve(1,a,2,a)].
% 0.74/1.00 3 -c_Tarski_OisLub(A,v_cl,B,t_a) | -c_in(C,v_A,t_a) | -c_in(c_Pair(v_sko__4mi(A,v_r,C),C,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(c_Pair(B,C,t_a,t_a),v_r,tc_prod(t_a,t_a)) # label(cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_1) # label(axiom). [assumption].
% 0.74/1.00 Derived: -c_in(A,v_A,t_a) | -c_in(c_Pair(v_sko__4mi(v_S,v_r,A),A,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(c_Pair(v_L,A,t_a,t_a),v_r,tc_prod(t_a,t_a)). [resolve(3,a,2,a)].
% 0.74/1.00 4 -c_in(A,B,C) | -c_lessequals(B,c_Tarski_Ointerval(D,E,F,C),tc_set(C)) | c_in(c_Pair(A,F,C,C),D,tc_prod(C,C)) # label(cls_Tarski_O_91_124_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_59_Ax1_A_58_AS1_A_124_93_A_61_61_62_A_Ix1_M_Ab1_J_A_58_Ar_A_61_61_ATrue_0) # label(axiom). [assumption].
% 0.74/1.00 5 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.74/1.00 Derived: -c_in(A,v_S,t_a) | c_in(c_Pair(A,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)). [resolve(4,b,5,a)].
% 0.74/1.00
% 0.74/1.00 ============================== end predicate elimination =============
% 0.74/1.00
% 0.74/1.00 Auto_denials: (non-Horn, no changes).
% 0.74/1.00
% 0.74/1.00 Term ordering decisions:
% 0.74/1.00 Function symbol KB weights: t_a=1. v_r=1. v_S=1. v_A=1. v_L=1. v_b=1. tc_prod=1. v_sko__4mi=1. c_Pair=1.
% 0.74/1.00
% 0.74/1.00 ============================== end of process initial clauses ========
% 0.74/1.00
% 0.74/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.00
% 0.74/1.00 ============================== end of clauses for search =============
% 0.74/1.00
% 0.74/1.00 ============================== SEARCH ================================
% 0.74/1.00
% 0.74/1.00 % Starting search at 0.01 seconds.
% 0.74/1.00
% 0.74/1.00 ============================== PROOF =================================
% 0.74/1.00 % SZS status Unsatisfiable
% 0.74/1.00 % SZS output start Refutation
% 0.74/1.00
% 0.74/1.00 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.74/1.00 % Length of proof is 13.
% 0.74/1.00 % Level of proof is 3.
% 0.74/1.00 % Maximum clause weight is 27.000.
% 0.74/1.00 % Given clauses 6.
% 0.74/1.00
% 0.74/1.00 1 -c_Tarski_OisLub(A,v_cl,B,t_a) | -c_in(C,v_A,t_a) | c_in(c_Pair(B,C,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(v_sko__4mi(A,v_r,C),A,t_a) # label(cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_0) # label(axiom). [assumption].
% 0.74/1.00 2 c_Tarski_OisLub(v_S,v_cl,v_L,t_a) # label(cls_conjecture_4) # label(negated_conjecture). [assumption].
% 0.74/1.00 3 -c_Tarski_OisLub(A,v_cl,B,t_a) | -c_in(C,v_A,t_a) | -c_in(c_Pair(v_sko__4mi(A,v_r,C),C,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(c_Pair(B,C,t_a,t_a),v_r,tc_prod(t_a,t_a)) # label(cls_Tarski_O_91_124_AisLub_AS1_Acl_AL1_59_Az1_A_58_AA_59_AALL_Ay_58S1_O_A_Iy_M_Az1_J_A_58_Ar_A_124_93_A_61_61_62_A_IL1_M_Az1_J_A_58_Ar_A_61_61_ATrue_1) # label(axiom). [assumption].
% 0.74/1.00 4 -c_in(A,B,C) | -c_lessequals(B,c_Tarski_Ointerval(D,E,F,C),tc_set(C)) | c_in(c_Pair(A,F,C,C),D,tc_prod(C,C)) # label(cls_Tarski_O_91_124_AS1_A_60_61_Ainterval_Ar_Aa1_Ab1_59_Ax1_A_58_AS1_A_124_93_A_61_61_62_A_Ix1_M_Ab1_J_A_58_Ar_A_61_61_ATrue_0) # label(axiom). [assumption].
% 0.74/1.00 5 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.74/1.00 6 c_in(v_b,v_A,t_a) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 0.74/1.00 7 -c_in(c_Pair(v_L,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)) # label(cls_conjecture_6) # label(negated_conjecture). [assumption].
% 0.74/1.00 8 -c_in(A,v_A,t_a) | c_in(c_Pair(v_L,A,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(v_sko__4mi(v_S,v_r,A),v_S,t_a). [resolve(1,a,2,a)].
% 0.74/1.00 9 -c_in(A,v_A,t_a) | -c_in(c_Pair(v_sko__4mi(v_S,v_r,A),A,t_a,t_a),v_r,tc_prod(t_a,t_a)) | c_in(c_Pair(v_L,A,t_a,t_a),v_r,tc_prod(t_a,t_a)). [resolve(3,a,2,a)].
% 0.74/1.00 10 -c_in(A,v_S,t_a) | c_in(c_Pair(A,v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)). [resolve(4,b,5,a)].
% 0.74/1.00 11 c_in(v_sko__4mi(v_S,v_r,v_b),v_S,t_a). [resolve(8,a,6,a),unit_del(a,7)].
% 0.74/1.00 12 -c_in(c_Pair(v_sko__4mi(v_S,v_r,v_b),v_b,t_a,t_a),v_r,tc_prod(t_a,t_a)). [ur(9,a,6,a,c,7,a)].
% 0.74/1.00 14 $F. [resolve(11,a,10,a),unit_del(a,12)].
% 0.74/1.00
% 0.74/1.00 % SZS output end Refutation
% 0.74/1.00 ============================== end of proof ==========================
% 0.74/1.00
% 0.74/1.00 ============================== STATISTICS ============================
% 0.74/1.00
% 0.74/1.00 Given=6. Generated=9. Kept=8. proofs=1.
% 0.74/1.00 Usable=6. Sos=2. Demods=0. Limbo=0, Disabled=10. Hints=0.
% 0.74/1.00 Megabytes=0.04.
% 0.74/1.00 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.74/1.00
% 0.74/1.00 ============================== end of statistics =====================
% 0.74/1.00
% 0.74/1.00 ============================== end of search =========================
% 0.74/1.00
% 0.74/1.00 THEOREM PROVED
% 0.74/1.00 % SZS status Unsatisfiable
% 0.74/1.00
% 0.74/1.00 Exiting with 1 proof.
% 0.74/1.00
% 0.74/1.00 Process 21200 exit (max_proofs) Wed Jun 29 17:29:38 2022
% 0.74/1.00 Prover9 interrupted
%------------------------------------------------------------------------------