TSTP Solution File: SWV260-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV260-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:14 EDT 2022
% Result : Unsatisfiable 0.72s 1.01s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV260-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Wed Jun 15 09:43:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.72/1.01 ============================== Prover9 ===============================
% 0.72/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.01 Process 9402 was started by sandbox on n017.cluster.edu,
% 0.72/1.01 Wed Jun 15 09:43:10 2022
% 0.72/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_9033_n017.cluster.edu".
% 0.72/1.01 ============================== end of head ===========================
% 0.72/1.01
% 0.72/1.01 ============================== INPUT =================================
% 0.72/1.01
% 0.72/1.01 % Reading from file /tmp/Prover9_9033_n017.cluster.edu
% 0.72/1.01
% 0.72/1.01 set(prolog_style_variables).
% 0.72/1.01 set(auto2).
% 0.72/1.01 % set(auto2) -> set(auto).
% 0.72/1.01 % set(auto) -> set(auto_inference).
% 0.72/1.01 % set(auto) -> set(auto_setup).
% 0.72/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.72/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.01 % set(auto) -> set(auto_limits).
% 0.72/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.01 % set(auto) -> set(auto_denials).
% 0.72/1.01 % set(auto) -> set(auto_process).
% 0.72/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.72/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.72/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.72/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.72/1.01 % set(auto2) -> assign(stats, some).
% 0.72/1.01 % set(auto2) -> clear(echo_input).
% 0.72/1.01 % set(auto2) -> set(quiet).
% 0.72/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.01 % set(auto2) -> clear(print_given).
% 0.72/1.01 assign(lrs_ticks,-1).
% 0.72/1.01 assign(sos_limit,10000).
% 0.72/1.01 assign(order,kbo).
% 0.72/1.01 set(lex_order_vars).
% 0.72/1.01 clear(print_given).
% 0.72/1.01
% 0.72/1.01 % formulas(sos). % not echoed (10 formulas)
% 0.72/1.01
% 0.72/1.01 ============================== end of input ==========================
% 0.72/1.01
% 0.72/1.01 % From the command line: assign(max_seconds, 300).
% 0.72/1.01
% 0.72/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.01
% 0.72/1.01 % Formulas that are not ordinary clauses:
% 0.72/1.01
% 0.72/1.01 ============================== end of process non-clausal formulas ===
% 0.72/1.01
% 0.72/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/1.01
% 0.72/1.01 ============================== PREDICATE ELIMINATION =================
% 0.72/1.01
% 0.72/1.01 ============================== end predicate elimination =============
% 0.72/1.01
% 0.72/1.01 Auto_denials: (non-Horn, no changes).
% 0.72/1.01
% 0.72/1.01 Term ordering decisions:
% 0.72/1.01 Function symbol KB weights: tc_Message_Omsg=1. v_X=1. v_G=1. v_H=1. v_Y=1. c_Message_Oparts=1. tc_set=1. c_Main_OsubsetI__1=1. c_insert=1. c_union=1.
% 0.72/1.01
% 0.72/1.01 ============================== end of process initial clauses ========
% 0.72/1.01
% 0.72/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.72/1.01
% 0.72/1.01 ============================== end of clauses for search =============
% 0.72/1.01
% 0.72/1.01 ============================== SEARCH ================================
% 0.72/1.01
% 0.72/1.01 % Starting search at 0.01 seconds.
% 0.72/1.01
% 0.72/1.01 ============================== PROOF =================================
% 0.72/1.01 % SZS status Unsatisfiable
% 0.72/1.01 % SZS output start Refutation
% 0.72/1.01
% 0.72/1.01 % Proof 1 at 0.03 (+ 0.00) seconds.
% 0.72/1.01 % Length of proof is 22.
% 0.72/1.01 % Level of proof is 10.
% 0.72/1.01 % Maximum clause weight is 18.000.
% 0.72/1.01 % Given clauses 110.
% 0.72/1.01
% 0.72/1.01 1 c_in(v_X,c_Message_Oparts(v_H),tc_Message_Omsg) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 0.72/1.01 2 c_in(v_Y,c_Message_Oparts(c_insert(v_X,v_G,tc_Message_Omsg)),tc_Message_Omsg) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.72/1.01 3 c_in(c_Main_OsubsetI__1(A,B,C),A,C) | c_lessequals(A,B,tc_set(C)) # label(cls_Set_OsubsetI_0) # label(axiom). [assumption].
% 0.72/1.01 4 -c_in(v_Y,c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg) # label(cls_conjecture_2) # label(negated_conjecture). [assumption].
% 0.72/1.01 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.72/1.01 6 -c_in(A,B,C) | c_in(A,c_union(D,B,C),C) # label(cls_Set_OUnCI_0) # label(axiom). [assumption].
% 0.72/1.01 7 -c_in(A,B,C) | c_in(A,c_union(B,D,C),C) # label(cls_Set_OUnCI_1) # label(axiom). [assumption].
% 0.72/1.01 8 -c_in(c_Main_OsubsetI__1(A,B,C),B,C) | c_lessequals(A,B,tc_set(C)) # label(cls_Set_OsubsetI_1) # label(axiom). [assumption].
% 0.72/1.01 9 -c_in(A,c_insert(B,C,D),D) | c_in(A,C,D) | A = B # label(cls_Set_OinsertE_0) # label(axiom). [assumption].
% 0.72/1.01 10 -c_in(A,c_Message_Oparts(B),tc_Message_Omsg) | -c_lessequals(B,c_Message_Oparts(C),tc_set(tc_Message_Omsg)) | c_in(A,c_Message_Oparts(C),tc_Message_Omsg) # label(cls_Message_Oparts__trans_0) # label(axiom). [assumption].
% 0.72/1.01 19 -c_lessequals(c_insert(v_X,v_G,tc_Message_Omsg),c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)). [ur(10,a,2,a,c,4,a)].
% 0.72/1.01 27 c_in(c_Main_OsubsetI__1(c_insert(v_X,v_G,tc_Message_Omsg),c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),c_insert(v_X,v_G,tc_Message_Omsg),tc_Message_Omsg). [resolve(19,a,3,b)].
% 0.72/1.01 28 -c_in(c_Main_OsubsetI__1(c_insert(v_X,v_G,tc_Message_Omsg),c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg). [ur(8,b,19,a)].
% 0.72/1.01 46 -c_in(c_Main_OsubsetI__1(c_insert(v_X,v_G,tc_Message_Omsg),c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),c_union(v_G,v_H,tc_Message_Omsg),tc_Message_Omsg). [ur(5,b,28,a)].
% 0.72/1.01 47 -c_in(c_Main_OsubsetI__1(c_insert(v_X,v_G,tc_Message_Omsg),c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),v_G,tc_Message_Omsg). [ur(7,b,46,a)].
% 0.72/1.01 159 c_Main_OsubsetI__1(c_insert(v_X,v_G,tc_Message_Omsg),c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg) = v_X. [resolve(27,a,9,a),unit_del(a,47)].
% 0.72/1.01 166 -c_in(v_X,c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg). [back_rewrite(28),rewrite([159(11)])].
% 0.72/1.01 182 -c_lessequals(v_H,c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)). [ur(10,a,1,a,c,166,a)].
% 0.72/1.01 197 c_in(c_Main_OsubsetI__1(v_H,c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),v_H,tc_Message_Omsg). [resolve(182,a,3,b)].
% 0.72/1.01 198 -c_in(c_Main_OsubsetI__1(v_H,c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg). [ur(8,b,182,a)].
% 0.72/1.01 268 c_in(c_Main_OsubsetI__1(v_H,c_Message_Oparts(c_union(v_G,v_H,tc_Message_Omsg)),tc_Message_Omsg),c_union(A,v_H,tc_Message_Omsg),tc_Message_Omsg). [resolve(197,a,6,a)].
% 0.72/1.01 306 $F. [ur(5,b,198,a),unit_del(a,268)].
% 0.72/1.01
% 0.72/1.01 % SZS output end Refutation
% 0.72/1.01 ============================== end of proof ==========================
% 0.72/1.01
% 0.72/1.01 ============================== STATISTICS ============================
% 0.72/1.01
% 0.72/1.01 Given=110. Generated=318. Kept=305. proofs=1.
% 0.72/1.01 Usable=105. Sos=195. Demods=1. Limbo=0, Disabled=15. Hints=0.
% 0.72/1.01 Megabytes=0.38.
% 0.72/1.01 User_CPU=0.03, System_CPU=0.00, Wall_clock=0.
% 0.72/1.01
% 0.72/1.01 ============================== end of statistics =====================
% 0.72/1.01
% 0.72/1.01 ============================== end of search =========================
% 0.72/1.01
% 0.72/1.01 THEOREM PROVED
% 0.72/1.01 % SZS status Unsatisfiable
% 0.72/1.01
% 0.72/1.01 Exiting with 1 proof.
% 0.72/1.01
% 0.72/1.01 Process 9402 exit (max_proofs) Wed Jun 15 09:43:10 2022
% 0.72/1.01 Prover9 interrupted
%------------------------------------------------------------------------------