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