TSTP Solution File: SWV262-2 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV262-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n014.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.47s 1.03s
% Output : Refutation 0.47s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV262-2 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n014.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 : Thu Jun 16 01:42:20 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.47/1.03 ============================== Prover9 ===============================
% 0.47/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.03 Process 26053 was started by sandbox2 on n014.cluster.edu,
% 0.47/1.03 Thu Jun 16 01:42:21 2022
% 0.47/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_25900_n014.cluster.edu".
% 0.47/1.03 ============================== end of head ===========================
% 0.47/1.03
% 0.47/1.03 ============================== INPUT =================================
% 0.47/1.03
% 0.47/1.03 % Reading from file /tmp/Prover9_25900_n014.cluster.edu
% 0.47/1.03
% 0.47/1.03 set(prolog_style_variables).
% 0.47/1.03 set(auto2).
% 0.47/1.03 % set(auto2) -> set(auto).
% 0.47/1.03 % set(auto) -> set(auto_inference).
% 0.47/1.03 % set(auto) -> set(auto_setup).
% 0.47/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.47/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.03 % set(auto) -> set(auto_limits).
% 0.47/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.03 % set(auto) -> set(auto_denials).
% 0.47/1.03 % set(auto) -> set(auto_process).
% 0.47/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.47/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.47/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.47/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.47/1.03 % set(auto2) -> assign(stats, some).
% 0.47/1.03 % set(auto2) -> clear(echo_input).
% 0.47/1.03 % set(auto2) -> set(quiet).
% 0.47/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.03 % set(auto2) -> clear(print_given).
% 0.47/1.03 assign(lrs_ticks,-1).
% 0.47/1.03 assign(sos_limit,10000).
% 0.47/1.03 assign(order,kbo).
% 0.47/1.03 set(lex_order_vars).
% 0.47/1.03 clear(print_given).
% 0.47/1.03
% 0.47/1.03 % formulas(sos). % not echoed (4 formulas)
% 0.47/1.03
% 0.47/1.03 ============================== end of input ==========================
% 0.47/1.03
% 0.47/1.03 % From the command line: assign(max_seconds, 300).
% 0.47/1.03
% 0.47/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.03
% 0.47/1.03 % Formulas that are not ordinary clauses:
% 0.47/1.03
% 0.47/1.03 ============================== end of process non-clausal formulas ===
% 0.47/1.03
% 0.47/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.03
% 0.47/1.03 ============================== PREDICATE ELIMINATION =================
% 0.47/1.03
% 0.47/1.03 ============================== end predicate elimination =============
% 0.47/1.03
% 0.47/1.03 Auto_denials:
% 0.47/1.03 % copying label cls_conjecture_0 to answer in negative clause
% 0.47/1.03
% 0.47/1.03 Term ordering decisions:
% 0.47/1.03
% 0.47/1.03 % Assigning unary symbol c_Message_Oparts kb_weight 0 and highest precedence (9).
% 0.47/1.03 Function symbol KB weights: tc_Message_Omsg=1. c_emptyset=1. v_H=1. v_X=1. v_Y=1. c_union=1. c_insert=1. c_Message_Oparts=0.
% 0.47/1.03
% 0.47/1.03 ============================== end of process initial clauses ========
% 0.47/1.03
% 0.47/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.47/1.03
% 0.47/1.03 ============================== end of clauses for search =============
% 0.47/1.03
% 0.47/1.03 ============================== SEARCH ================================
% 0.47/1.03
% 0.47/1.03 % Starting search at 0.01 seconds.
% 0.47/1.03
% 0.47/1.03 ============================== PROOF =================================
% 0.47/1.03 % SZS status Unsatisfiable
% 0.47/1.03 % SZS output start Refutation
% 0.47/1.03
% 0.47/1.03 % Proof 1 at 0.01 (+ 0.00) seconds: cls_conjecture_0.
% 0.47/1.03 % Length of proof is 12.
% 0.47/1.03 % Level of proof is 5.
% 0.47/1.03 % Maximum clause weight is 25.000.
% 0.47/1.03 % Given clauses 13.
% 0.47/1.03
% 0.47/1.03 1 c_union(c_emptyset,A,B) = A # label(cls_Set_OUn__empty__left_0) # label(axiom). [assumption].
% 0.47/1.03 2 c_Message_Oparts(c_union(A,B,tc_Message_Omsg)) = c_union(c_Message_Oparts(A),c_Message_Oparts(B),tc_Message_Omsg) # label(cls_Message_Oparts__Un_0) # label(axiom). [assumption].
% 0.47/1.03 3 c_union(c_insert(A,B,C),D,C) = c_insert(A,c_union(B,D,C),C) # label(cls_Set_OUn__insert__left_0) # label(axiom). [assumption].
% 0.47/1.03 4 c_insert(A,c_union(B,C,D),D) = c_union(c_insert(A,B,D),C,D). [copy(3),flip(a)].
% 0.47/1.03 5 c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)) != c_union(c_union(c_Message_Oparts(c_insert(v_X,c_emptyset,tc_Message_Omsg)),c_Message_Oparts(c_insert(v_Y,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(v_H),tc_Message_Omsg) # label(cls_conjecture_0) # label(negated_conjecture) # answer(cls_conjecture_0). [assumption].
% 0.47/1.03 6 c_union(c_union(c_Message_Oparts(c_insert(v_X,c_emptyset,tc_Message_Omsg)),c_Message_Oparts(c_insert(v_Y,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg),c_Message_Oparts(v_H),tc_Message_Omsg) != c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)) # answer(cls_conjecture_0). [copy(5),flip(a)].
% 0.47/1.03 8 c_union(c_insert(A,c_emptyset,B),C,B) = c_insert(A,C,B). [para(1(a,1),4(a,1,2)),flip(a)].
% 0.47/1.03 12 c_union(c_Message_Oparts(c_insert(A,c_emptyset,tc_Message_Omsg)),c_Message_Oparts(B),tc_Message_Omsg) = c_Message_Oparts(c_insert(A,B,tc_Message_Omsg)). [para(8(a,1),2(a,1,1)),flip(a)].
% 0.47/1.03 13 c_union(c_insert(A,c_insert(B,c_emptyset,C),C),D,C) = c_insert(A,c_insert(B,D,C),C). [para(8(a,1),4(a,1,2)),flip(a)].
% 0.47/1.03 14 c_union(c_Message_Oparts(c_insert(v_X,c_insert(v_Y,c_emptyset,tc_Message_Omsg),tc_Message_Omsg)),c_Message_Oparts(v_H),tc_Message_Omsg) != c_Message_Oparts(c_insert(v_X,c_insert(v_Y,v_H,tc_Message_Omsg),tc_Message_Omsg)) # answer(cls_conjecture_0). [back_rewrite(6),rewrite([12(12)])].
% 0.47/1.03 29 c_union(c_Message_Oparts(c_insert(A,c_insert(B,c_emptyset,tc_Message_Omsg),tc_Message_Omsg)),c_Message_Oparts(C),tc_Message_Omsg) = c_Message_Oparts(c_insert(A,c_insert(B,C,tc_Message_Omsg),tc_Message_Omsg)). [para(13(a,1),2(a,1,1)),flip(a)].
% 0.47/1.03 30 $F # answer(cls_conjecture_0). [resolve(29,a,14,a)].
% 0.47/1.03
% 0.47/1.03 % SZS output end Refutation
% 0.47/1.03 ============================== end of proof ==========================
% 0.47/1.03
% 0.47/1.03 ============================== STATISTICS ============================
% 0.47/1.03
% 0.47/1.03 Given=13. Generated=67. Kept=27. proofs=1.
% 0.47/1.03 Usable=12. Sos=13. Demods=24. Limbo=0, Disabled=5. Hints=0.
% 0.47/1.03 Megabytes=0.07.
% 0.47/1.03 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.47/1.03
% 0.47/1.03 ============================== end of statistics =====================
% 0.47/1.03
% 0.47/1.03 ============================== end of search =========================
% 0.47/1.03
% 0.47/1.03 THEOREM PROVED
% 0.47/1.03 % SZS status Unsatisfiable
% 0.47/1.03
% 0.47/1.03 Exiting with 1 proof.
% 0.47/1.03
% 0.47/1.03 Process 26053 exit (max_proofs) Thu Jun 16 01:42:21 2022
% 0.47/1.03 Prover9 interrupted
%------------------------------------------------------------------------------