TSTP Solution File: SWV778-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV778-1 : TPTP v8.1.0. Released v4.1.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:14:46 EDT 2022
% Result : Unsatisfiable 0.95s 1.19s
% Output : Refutation 0.95s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV778-1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n013.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Tue Jun 14 19:02:44 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.47/1.17 ============================== Prover9 ===============================
% 0.47/1.17 Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.17 Process 4714 was started by sandbox on n013.cluster.edu,
% 0.47/1.17 Tue Jun 14 19:02:44 2022
% 0.47/1.17 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_4561_n013.cluster.edu".
% 0.47/1.17 ============================== end of head ===========================
% 0.47/1.17
% 0.47/1.17 ============================== INPUT =================================
% 0.47/1.17
% 0.47/1.17 % Reading from file /tmp/Prover9_4561_n013.cluster.edu
% 0.47/1.17
% 0.47/1.17 set(prolog_style_variables).
% 0.47/1.17 set(auto2).
% 0.47/1.17 % set(auto2) -> set(auto).
% 0.47/1.17 % set(auto) -> set(auto_inference).
% 0.47/1.17 % set(auto) -> set(auto_setup).
% 0.47/1.17 % set(auto_setup) -> set(predicate_elim).
% 0.47/1.17 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.17 % set(auto) -> set(auto_limits).
% 0.47/1.17 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.17 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.17 % set(auto) -> set(auto_denials).
% 0.47/1.17 % set(auto) -> set(auto_process).
% 0.47/1.17 % set(auto2) -> assign(new_constants, 1).
% 0.47/1.17 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.17 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.17 % set(auto2) -> assign(max_hours, 1).
% 0.47/1.17 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.17 % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.17 % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.17 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.17 % set(auto2) -> set(sort_initial_sos).
% 0.47/1.17 % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.17 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.17 % set(auto2) -> assign(max_megs, 400).
% 0.47/1.17 % set(auto2) -> assign(stats, some).
% 0.47/1.17 % set(auto2) -> clear(echo_input).
% 0.47/1.17 % set(auto2) -> set(quiet).
% 0.47/1.17 % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.17 % set(auto2) -> clear(print_given).
% 0.47/1.17 assign(lrs_ticks,-1).
% 0.47/1.17 assign(sos_limit,10000).
% 0.47/1.17 assign(order,kbo).
% 0.47/1.17 set(lex_order_vars).
% 0.47/1.17 clear(print_given).
% 0.47/1.17
% 0.47/1.17 % formulas(sos). % not echoed (443 formulas)
% 0.47/1.17
% 0.47/1.17 ============================== end of input ==========================
% 0.47/1.17
% 0.47/1.17 % From the command line: assign(max_seconds, 300).
% 0.47/1.17
% 0.47/1.17 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.17
% 0.47/1.17 % Formulas that are not ordinary clauses:
% 0.47/1.17
% 0.47/1.17 ============================== end of process non-clausal formulas ===
% 0.47/1.17
% 0.47/1.17 ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.17
% 0.47/1.17 ============================== PREDICATE ELIMINATION =================
% 0.47/1.17 1 class_Divides_Osemiring__div(tc_nat) # label(clsarity_nat__Divides_Osemiring__div) # label(axiom). [assumption].
% 0.47/1.17 2 -class_Divides_Osemiring__div(A) | c_Divides_Odiv__class_Omod(c_Divides_Odiv__class_Omod(B,C,A),C,A) = c_Divides_Odiv__class_Omod(B,C,A) # label(cls_mod__mod__trivial_0) # label(axiom). [assumption].
% 0.47/1.17 Derived: c_Divides_Odiv__class_Omod(c_Divides_Odiv__class_Omod(A,B,tc_nat),B,tc_nat) = c_Divides_Odiv__class_Omod(A,B,tc_nat). [resolve(1,a,2,a)].
% 0.47/1.17 3 class_Orderings_Olinorder(tc_nat) # label(clsarity_nat__Orderings_Olinorder) # label(axiom). [assumption].
% 0.47/1.17 4 -class_Orderings_Olinorder(A) | c_lessequals(B,C,A) | c_lessequals(C,B,A) # label(cls_linorder__linear_0) # label(axiom). [assumption].
% 0.47/1.17 5 -class_Orderings_Olinorder(A) | c_lessequals(B,C,A) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,c_List_Olist_OCons(C,D,A),A),A) # label(cls_sorted_Osimps_I3_J_0) # label(axiom). [assumption].
% 0.47/1.17 6 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,c_List_Olist_OCons(C,D,A),A),A) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(C,D,A),A) | -c_lessequals(B,C,A) # label(cls_sorted_Osimps_I3_J_2) # label(axiom). [assumption].
% 0.47/1.17 7 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Odrop(B,C,A),A) | -c_List_Olinorder__class_Osorted(C,A) # label(cls_sorted__drop_0) # label(axiom). [assumption].
% 0.47/1.17 8 -class_Orderings_Olinorder(A) | c_List_Oset(B,A) != c_List_Oset(C,A) | -c_List_Odistinct(C,A) | -c_List_Olinorder__class_Osorted(C,A) | -c_List_Odistinct(B,A) | -c_List_Olinorder__class_Osorted(B,A) | B = C # label(cls_sorted__distinct__set__unique_0) # label(axiom). [assumption].
% 0.47/1.17 9 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,C,A),A) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(D,c_List_Olist_OCons(B,C,A),A),A) # label(cls_sorted_Osimps_I3_J_1) # label(axiom). [assumption].
% 0.47/1.17 10 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(B,A) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(C,B,A),A) # label(cls_sorted__Cons_0) # label(axiom). [assumption].
% 0.47/1.17 11 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,c_List_Olist_ONil(A),A),A) # label(cls_sorted_Osimps_I2_J_0) # label(axiom). [assumption].
% 0.47/1.17 12 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Otake(B,C,A),A) | -c_List_Olinorder__class_Osorted(C,A) # label(cls_sorted__take_0) # label(axiom). [assumption].
% 0.47/1.17 13 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(B,A) | -c_List_Olinorder__class_Osorted(c_List_Oappend(B,C,A),A) # label(cls_sorted__append_0) # label(axiom). [assumption].
% 0.47/1.17 14 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(B,A) | -c_List_Olinorder__class_Osorted(c_List_Oappend(C,B,A),A) # label(cls_sorted__append_1) # label(axiom). [assumption].
% 0.47/1.17 15 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Oremdups(B,A),A) | -c_List_Olinorder__class_Osorted(B,A) # label(cls_sorted__remdups_0) # label(axiom). [assumption].
% 0.47/1.17 16 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_OdropWhile(B,C,A),A) | -c_List_Olinorder__class_Osorted(C,A) # label(cls_sorted__dropWhile_0) # label(axiom). [assumption].
% 0.47/1.17 17 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Oremove1(B,C,A),A) | -c_List_Olinorder__class_Osorted(C,A) # label(cls_sorted__remove1_0) # label(axiom). [assumption].
% 0.47/1.17 18 -class_Orderings_Olinorder(A) | c_List_Olinorder__class_Osorted(c_List_Olist_ONil(A),A) # label(cls_sorted_Osimps_I1_J_0) # label(axiom). [assumption].
% 0.47/1.17 Derived: c_lessequals(A,B,tc_nat) | c_lessequals(B,A,tc_nat). [resolve(3,a,4,a)].
% 0.47/1.17 Derived: c_lessequals(A,B,tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(A,c_List_Olist_OCons(B,C,tc_nat),tc_nat),tc_nat). [resolve(3,a,5,a)].
% 0.47/1.17 Derived: c_List_Olinorder__class_Osorted(c_List_Olist_OCons(A,c_List_Olist_OCons(B,C,tc_nat),tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,C,tc_nat),tc_nat) | -c_lessequals(A,B,tc_nat). [resolve(3,a,6,a)].
% 0.47/1.17 Derived: c_List_Olinorder__class_Osorted(c_List_Odrop(A,B,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(B,tc_nat). [resolve(3,a,7,a)].
% 0.47/1.17 Derived: c_List_Oset(A,tc_nat) != c_List_Oset(B,tc_nat) | -c_List_Odistinct(B,tc_nat) | -c_List_Olinorder__class_Osorted(B,tc_nat) | -c_List_Odistinct(A,tc_nat) | -c_List_Olinorder__class_Osorted(A,tc_nat) | A = B. [resolve(3,a,8,a)].
% 0.47/1.17 Derived: c_List_Olinorder__class_Osorted(c_List_Olist_OCons(A,B,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(C,c_List_Olist_OCons(A,B,tc_nat),tc_nat),tc_nat). [resolve(3,a,9,a)].
% 0.47/1.17 Derived: c_List_Olinorder__class_Osorted(A,tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Olist_OCons(B,A,tc_nat),tc_nat). [resolve(3,a,10,a)].
% 0.47/1.17 Derived: c_List_Olinorder__class_Osorted(c_List_Olist_OCons(A,c_List_Olist_ONil(tc_nat),tc_nat),tc_nat). [resolve(3,a,11,a)].
% 0.47/1.17 Derived: c_List_Olinorder__class_Osorted(c_List_Otake(A,B,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(B,tc_nat). [resolve(3,a,12,a)].
% 0.47/1.17 Derived: c_List_Olinorder__class_Osorted(A,tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Oappend(A,B,tc_nat),tc_nat). [resolve(3,a,13,a)].
% 0.47/1.17 Derived: c_List_Olinorder__class_Osorted(A,tc_nat) | -c_List_Olinorder__class_Osorted(c_List_Oappend(B,A,tc_nat),tc_nat). [resolve(3,a,14,a)].
% 0.47/1.17 Derived: c_List_Olinorder__class_Osorted(c_List_Oremdups(A,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(A,tc_nat). [resolve(3,a,15,a)].
% 0.47/1.17 Derived: c_List_Olinorder__class_Osorted(c_List_OdropWhile(A,B,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(B,tc_nat). [resolve(3,a,16,a)].
% 0.47/1.17 Derived: c_List_Olinorder__class_Osorted(c_List_Oremove1(A,B,tc_nat),tc_nat) | -c_List_Olinorder__class_Osorted(B,tc_nat). [resolve(3,a,17,a)].
% 0.47/1.17 Derived: c_List_Olinorder__class_Osorted(c_List_Olist_ONil(tc_nat),tc_nat). [resolve(3,a,18,a)].
% 0.95/1.19 19 class_OrderedGroup_Ocomm__monoid__add(tc_nat) # label(clsarity_nat__OrderedGroup_Ocomm__monoid__add) # label(axiom). [assumption].
% 0.95/1.19 20 -class_OrderedGroup_Ocomm__monoid__add(A) | c_Finite__Set_Osetsum(B,c_List_Oset(C,D),D,A) = c_List_Olistsum(c_List_Omap(B,C,D,A),A) | -c_List_Odistinct(C,D) # label(cls_setsum__set__distinct__conv__listsum_0) # label(axiom). [assumption].
% 0.95/1.19 21 -class_OrderedGroup_Ocomm__monoid__add(A) | c_List_Olistsum(hAPP(c_List_Orev(A),B),A) = c_List_Olistsum(B,A) # label(cls_listsum__rev_0) # label(axiom). [assumption].
% 0.95/1.19 Derived: c_Finite__Set_Osetsum(A,c_List_Oset(B,C),C,tc_nat) = c_List_Olistsum(c_List_Omap(A,B,C,tc_nat),tc_nat) | -c_List_Odistinct(B,C). [resolve(19,a,20,a)].
% 0.95/1.19 Derived: c_List_Olistsum(hAPP(c_List_Orev(tc_nat),A),tc_nat) = c_List_Olistsum(A,tc_nat). [resolve(19,a,21,a)].
% 0.95/1.19
% 0.95/1.19 ============================== end predicate elimination =============
% 0.95/1.19
% 0.95/1.19 Auto_denials: (non-Horn, no changes).
% 0.95/1.19
% 0.95/1.19 Term ordering decisions:
% 0.95/1.19 Function symbol KB weights: tc_nat=1. t_a=1. tc_bool=1. c_Message_Oagent_OSpy=1. tc_Event_Oevent=1. c_Message_Oagent_OServer=1. tc_Message_Omsg=1. t_b=1. hAPP=1. c_Nat_Osize__class_Osize=1. tc_fun=1. c_List_Oset=1. c_Event_Oknows=1. c_List_Oremdups=1. c_List_Obutlast=1. c_List_Olast=1. c_List_Orotate1=1. c_Event_Oevent_OGets=1. c_List_Ohd=1. c_List_Otl=1. c_List_Olistsum=1. c_List_Olist_ONil=1. tc_List_Olist=1. c_List_Orev=1. c_Message_Oagent_OFriend=1. c_fequal=1. c_Event_OinitState=1. v_sko__List__Xdistinct__Xinduct__2=1. v_sko__List__XdropWhile__Xinduct__2=1. v_sko__List__Xlast__Xinduct__2=1. v_sko__List__Xlist__Xinduct__2=1. v_sko__List__Xlist__update__Xinduct__2=1. v_sko__List__Xlistset__Xinduct__2=1. v_sko__List__Xlistsum__Xinduct__2=1. v_sko__List__Xremove1__Xinduct__2=1. v_sko__List__XremoveAll__Xinduct__2=1. v_sko__List__XtakeWhile__Xinduct__2=1. v_sko__List__Xzip__Xinduct__2=1. v_sko__List__Xconcat__Xinduct__2=1. v_sko__List__Xdistinct__Xinduct__1=1. v_sko__List__XdropWhile__Xinduct__1=1. v_sko__List__Xfoldl__Xinduct__2=1. v_sko__List__Xlast__Xinduct__1=1. v_sko__List__Xlist__Xinduct__1=1. v_sko__List__Xlist__update__Xinduct__1=1. v_sko__List__Xlistset__Xinduct__1=1. v_sko__List__Xlistsum__Xinduct__1=1. v_sko__List__Xmap__Xinduct__2=1. v_sko__List__Xremove1__Xinduct__1=1. v_sko__List__XremoveAll__Xinduct__1=1. v_sko__List__XtakeWhile__Xinduct__1=1. v_sko__List__Xtake__Xinduct__2=1. v_sko__List__Xzip__Xinduct__1=1. c_List_Oappend=1. c_List_Olist_OCons=1. c_List_Odrop=1. c_HOL_Ominus__class_Ominus=1. c_List_Otake=1. c_Set_Oinsert=1. c_List_Ofilter=1. c_List_Oreplicate=1. c_List_Orotate=1. c_Event_Oevent_OSays=1. c_Divides_Odiv__class_Omod=1. c_List_OdropWhile=1. c_List_Oremove1=1. v_sko__Message__Xagent__Xsplit__1=1. v_sko__Message__Xagent__Xsplit__asm__1=1. c_List_Osublist=1. c_List_Olist__inter=1. c_List_Omap=1. c_List_Olist__update=1. c_Message_Osko__Message__Xagent__Xcase__cong__1__1=1. c_Finite__Set_Osetsum=1. c_List_Ofiltermap=1. c_Message_Oagent_Oagent__case=1. c_List_Ofoldl=1. c_List_Ofoldr=1. c_Map_Omap__upds=1. c_List_Olist_Olist__case=1. c_List_Olist_Olist__rec=1. c_Message_Oagent_Oagent__rec=1.
% 0.95/1.19
% 0.95/1.19 ============================== PROOF =================================
% 0.95/1.19 % SZS status Unsatisfiable
% 0.95/1.19 % SZS output start Refutation
% 0.95/1.19
% 0.95/1.19 % Proof 1 at 0.07 (+ 0.00) seconds.
% 0.95/1.19 % Length of proof is 4.
% 0.95/1.19 % Level of proof is 2.
% 0.95/1.19 % Maximum clause weight is 8.000.
% 0.95/1.19 % Given clauses 0.
% 0.95/1.19
% 0.95/1.19 502 c_List_Olist_ONil(A) = hAPP(c_List_Orev(A),c_List_Olist_ONil(A)) # label(cls_Nil__is__rev__conv_1) # label(axiom). [assumption].
% 0.95/1.19 503 hAPP(c_List_Orev(A),c_List_Olist_ONil(A)) = c_List_Olist_ONil(A). [copy(502),flip(a)].
% 0.95/1.19 512 c_Event_Oknows(c_Message_Oagent_OSpy,c_List_Olist_ONil(tc_Event_Oevent)) != c_Event_Oknows(c_Message_Oagent_OSpy,hAPP(c_List_Orev(tc_Event_Oevent),c_List_Olist_ONil(tc_Event_Oevent))) # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 0.95/1.19 513 $F. [copy(512),rewrite([503(10)]),xx(a)].
% 0.95/1.19
% 0.95/1.19 % SZS output end Refutation
% 0.95/1.19 ============================== end of proof ==========================
% 0.95/1.19
% 0.95/1.19 ============================== STATISTICS ============================
% 0.95/1.19
% 0.95/1.19 Given=0. Generated=402. Kept=343. proofs=1.
% 0.95/1.19 Usable=0. Sos=0. Demods=94. Limbo=343, Disabled=432. Hints=0.
% 0.95/1.19 Megabytes=1.11.
% 0.95/1.19 User_CPU=0.07, System_CPU=0.00, Wall_clock=0.
% 0.95/1.19
% 0.95/1.19 ============================== end of statistics =====================
% 0.95/1.19
% 0.95/1.19 ============================== end of search =========================
% 0.95/1.19
% 0.95/1.19 THEOREM PROVED
% 0.95/1.19 % SZS status Unsatisfiable
% 0.95/1.19
% 0.95/1.19 Exiting with 1 proof.
% 0.95/1.19
% 0.95/1.19 Process 4714 exit (max_proofs) Tue Jun 14 19:02:44 2022
% 0.95/1.19 Prover9 interrupted
%------------------------------------------------------------------------------