TSTP Solution File: SWV954-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV954-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n028.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:15:21 EDT 2022
% Result : Unsatisfiable 1.50s 1.80s
% Output : Refutation 1.50s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV954-1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n028.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 : Tue Jun 14 23:12:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.23/1.62 ============================== Prover9 ===============================
% 1.23/1.62 Prover9 (32) version 2009-11A, November 2009.
% 1.23/1.62 Process 27758 was started by sandbox on n028.cluster.edu,
% 1.23/1.62 Tue Jun 14 23:12:40 2022
% 1.23/1.62 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_27437_n028.cluster.edu".
% 1.23/1.62 ============================== end of head ===========================
% 1.23/1.62
% 1.23/1.62 ============================== INPUT =================================
% 1.23/1.62
% 1.23/1.62 % Reading from file /tmp/Prover9_27437_n028.cluster.edu
% 1.23/1.62
% 1.23/1.62 set(prolog_style_variables).
% 1.23/1.62 set(auto2).
% 1.23/1.62 % set(auto2) -> set(auto).
% 1.23/1.62 % set(auto) -> set(auto_inference).
% 1.23/1.62 % set(auto) -> set(auto_setup).
% 1.23/1.62 % set(auto_setup) -> set(predicate_elim).
% 1.23/1.62 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.23/1.62 % set(auto) -> set(auto_limits).
% 1.23/1.62 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.23/1.62 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.23/1.62 % set(auto) -> set(auto_denials).
% 1.23/1.62 % set(auto) -> set(auto_process).
% 1.23/1.62 % set(auto2) -> assign(new_constants, 1).
% 1.23/1.62 % set(auto2) -> assign(fold_denial_max, 3).
% 1.23/1.62 % set(auto2) -> assign(max_weight, "200.000").
% 1.23/1.62 % set(auto2) -> assign(max_hours, 1).
% 1.23/1.62 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.23/1.62 % set(auto2) -> assign(max_seconds, 0).
% 1.23/1.62 % set(auto2) -> assign(max_minutes, 5).
% 1.23/1.62 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.23/1.62 % set(auto2) -> set(sort_initial_sos).
% 1.23/1.62 % set(auto2) -> assign(sos_limit, -1).
% 1.23/1.62 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.23/1.62 % set(auto2) -> assign(max_megs, 400).
% 1.23/1.62 % set(auto2) -> assign(stats, some).
% 1.23/1.62 % set(auto2) -> clear(echo_input).
% 1.23/1.62 % set(auto2) -> set(quiet).
% 1.23/1.62 % set(auto2) -> clear(print_initial_clauses).
% 1.23/1.62 % set(auto2) -> clear(print_given).
% 1.23/1.62 assign(lrs_ticks,-1).
% 1.23/1.62 assign(sos_limit,10000).
% 1.23/1.62 assign(order,kbo).
% 1.23/1.62 set(lex_order_vars).
% 1.23/1.62 clear(print_given).
% 1.23/1.62
% 1.23/1.62 % formulas(sos). % not echoed (398 formulas)
% 1.23/1.62
% 1.23/1.62 ============================== end of input ==========================
% 1.23/1.62
% 1.23/1.62 % From the command line: assign(max_seconds, 300).
% 1.23/1.62
% 1.23/1.62 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.23/1.62
% 1.23/1.62 % Formulas that are not ordinary clauses:
% 1.23/1.62
% 1.23/1.62 ============================== end of process non-clausal formulas ===
% 1.23/1.62
% 1.23/1.62 ============================== PROCESS INITIAL CLAUSES ===============
% 1.23/1.62
% 1.23/1.62 ============================== PREDICATE ELIMINATION =================
% 1.23/1.62 1 c_in(c_Pair(A,A,B,B),C,tc_prod(B,B)) | -c_in(A,D,B) | -c_Relation_Orefl__on(D,C,B) # label(cls_refl__on__def_1) # label(axiom). [assumption].
% 1.23/1.62 2 c_Relation_Orefl__on(A,c_Relation_OId__on(A,B),B) # label(cls_refl__on__Id__on_0) # label(axiom). [assumption].
% 1.23/1.62 3 c_Relation_Orefl__on(A,B,C) | -c_Equiv__Relations_Oequiv(A,B,C) # label(cls_equiv_Orefl__on_0) # label(axiom). [assumption].
% 1.23/1.62 Derived: c_in(c_Pair(A,A,B,B),c_Relation_OId__on(C,B),tc_prod(B,B)) | -c_in(A,C,B). [resolve(1,c,2,a)].
% 1.23/1.62 Derived: c_in(c_Pair(A,A,B,B),C,tc_prod(B,B)) | -c_in(A,D,B) | -c_Equiv__Relations_Oequiv(D,C,B). [resolve(1,c,3,a)].
% 1.23/1.62 4 c_in(A,B,C) | -c_in(c_Pair(D,A,C,C),E,tc_prod(C,C)) | -c_Relation_Orefl__on(B,E,C) # label(cls_refl__onD2_0) # label(axiom). [assumption].
% 1.23/1.62 Derived: c_in(A,B,C) | -c_in(c_Pair(D,A,C,C),c_Relation_OId__on(B,C),tc_prod(C,C)). [resolve(4,c,2,a)].
% 1.23/1.62 Derived: c_in(A,B,C) | -c_in(c_Pair(D,A,C,C),E,tc_prod(C,C)) | -c_Equiv__Relations_Oequiv(B,E,C). [resolve(4,c,3,a)].
% 1.23/1.62 5 c_in(A,B,C) | -c_in(c_Pair(A,D,C,C),E,tc_prod(C,C)) | -c_Relation_Orefl__on(B,E,C) # label(cls_refl__onD1_0) # label(axiom). [assumption].
% 1.23/1.62 Derived: c_in(A,B,C) | -c_in(c_Pair(A,D,C,C),c_Relation_OId__on(B,C),tc_prod(C,C)). [resolve(5,c,2,a)].
% 1.23/1.62 Derived: c_in(A,B,C) | -c_in(c_Pair(A,D,C,C),E,tc_prod(C,C)) | -c_Equiv__Relations_Oequiv(B,E,C). [resolve(5,c,3,a)].
% 1.23/1.62 6 c_in(c_Pair(A,A,B,B),C,tc_prod(B,B)) | -c_in(A,D,B) | -c_Relation_Orefl__on(D,C,B) # label(cls_refl__onD_0) # label(axiom). [assumption].
% 1.23/1.62 7 class_Orderings_Olinorder(tc_nat) # label(clsarity_nat__Orderings_Olinorder) # label(axiom). [assumption].
% 1.23/1.62 8 -class_Orderings_Olinorder(A) | c_lessequals(B,C,A) | c_lessequals(C,B,A) # label(cls_linorder__linear_0) # label(axiom). [assumption].
% 1.23/1.62 Derived: c_lessequals(A,B,tc_nat) | c_lessequals(B,A,tc_nat). [resolve(7,a,8,a)].
% 1.50/1.80 9 A = B | -c_fequal(A,B,C) # label(cls_ATP__Linkup_Ofequal__imp__equal_0) # label(axiom). [assumption].
% 1.50/1.80 10 c_fequal(A,A,B) # label(cls_ATP__Linkup_Oequal__imp__fequal_0) # label(axiom). [assumption].
% 1.50/1.80 Derived: A = A. [resolve(9,b,10,a)].
% 1.50/1.80
% 1.50/1.80 ============================== end predicate elimination =============
% 1.50/1.80
% 1.50/1.80 Auto_denials: (non-Horn, no changes).
% 1.50/1.80
% 1.50/1.80 Term ordering decisions:
% 1.50/1.80 Function symbol KB weights: tc_String_Ochar=1. tc_Value_Oval=1. tc_nat=1. v_P=1. tc_bool=1. c_Type_Oty_OVoid=1. v_ha____=1. c_Type_Oty_ONT=1. v_e_Ha____=1. v_h_Ha____=1. v_ea____=1. v_la____=1. v_E____=1. v_e_092_060_094isub_0622____=1. c_WWellForm_Owwf__J__mdecl=1. t_a=1. v_T____=1. tc_Type_Oty=1. v_D____=1. v_F____=1. v_l_Ha____=1. tc_prod=1. tc_fun=1. c_Expr_Oexp_Othrow=1. c_Transitive__Closure_Ortrancl=1. c_Expr_Oexp_OVal=1. hAPP=1. c_Relation_OId__on=1. c_Wellfounded_Oacc=1. c_COMBI=1. tc_List_Olist=1. tc_Option_Ooption=1. tc_Expr_Oexp=1. c_SmallStep_Ored=1. c_Type_Oty_OClass=1. c_State_Ohp=1. c_Expr_Oexp_OSeq=1. c_Expr_Oexp_OLAss=1. c_Expr_Oexp_OCast=1. c_Map_Odom=1. c_Relation_ODomain=1. c_Relation_ORange=1. v_sko__TypeRel__Xwiden__Xcases__1=1. v_sko__TypeRel__Xwiden__Xcases__2=1. c_Pair=1. c_Expr_Oexp_OFAcc=1. c_Map_Omap__add=1. c_Expr_Oexp_OBinOp=1. c_Expr_Oexp_OCall=1. c_Expr_Oexp_OCond=1. c_WellTypeRT_Osko__WellTypeRT__XWTrt__elim__cases__8__4=1. c_Product__Type_OSigma=1. c_Wellfounded_Olex__prod=1. c_Relation_OImage=1. c_Recdef_Osame__fst=1. c_TypeRel_Osko__TypeRel__Xwiden__Class__1__1=1. c_Expr_Oexp_OFAss=1. c_Expr_Oexp_OTryCatch=1. v_sko__local__XFAssRed1__2__1=1. v_sko__local__XFAssRed1__Xhyps__2__1=1. v_sko__local__XIH__1=1. c_WellType_Osko__WellType__XWT__elim__cases__7__1=1. c_WellType_Osko__WellType__XWT__elim__cases__8__1=1. c_WellType_Osko__WellType__XWT__elim__cases__8__2=1. c_WellType_Osko__WellType__XWT__elim__cases__8__3=1. c_WellTypeRT_Osko__WellTypeRT__XWTrt__elim__cases__8__1=1. c_WellTypeRT_Osko__WellTypeRT__XWTrt__elim__cases__8__2=1. c_WellTypeRT_Osko__WellTypeRT__XWTrt__elim__cases__8__3=1. c_WellTypeRT_Osko__WellTypeRT__XWTrt__elim__cases__7__1=1.
% 1.50/1.80
% 1.50/1.80 ============================== end of process initial clauses ========
% 1.50/1.80
% 1.50/1.80 ============================== CLAUSES FOR SEARCH ====================
% 1.50/1.80
% 1.50/1.80 ============================== end of clauses for search =============
% 1.50/1.80
% 1.50/1.80 ============================== SEARCH ================================
% 1.50/1.80
% 1.50/1.80 % Starting search at 0.26 seconds.
% 1.50/1.80
% 1.50/1.80 ============================== PROOF =================================
% 1.50/1.80 % SZS status Unsatisfiable
% 1.50/1.80 % SZS output start Refutation
% 1.50/1.80
% 1.50/1.80 % Proof 1 at 0.32 (+ 0.00) seconds.
% 1.50/1.80 % Length of proof is 8.
% 1.50/1.80 % Level of proof is 2.
% 1.50/1.80 % Maximum clause weight is 35.000.
% 1.50/1.80 % Given clauses 289.
% 1.50/1.80
% 1.50/1.80 272 c_WellTypeRT_OWTrt(A,B,C,D,c_WellTypeRT_Osko__WellTypeRT__XWTrt__elim__cases__8__4(C,A,B,D)) | c_WellTypeRT_OWTrt(A,B,C,D,c_WellTypeRT_Osko__WellTypeRT__XWTrt__elim__cases__8__3(E,C,F,A,V6,B,D)) | -c_WellTypeRT_OWTrt(A,B,C,c_Expr_Oexp_OFAss(V6,F,E,D,tc_List_Olist(tc_String_Ochar)),V7) # label(cls_WTrt__elim__cases_I8_J_11) # label(axiom). [assumption].
% 1.50/1.80 362 v_T____ = c_Type_Oty_OVoid # label(cls_void_0) # label(axiom). [assumption].
% 1.50/1.80 383 c_WellTypeRT_OWTrt(v_P,v_ha____,v_E____,c_Expr_Oexp_OFAss(v_ea____,v_F____,v_D____,v_e_092_060_094isub_0622____,tc_List_Olist(tc_String_Ochar)),v_T____) # label(cls_wt_0) # label(axiom). [assumption].
% 1.50/1.80 384 c_WellTypeRT_OWTrt(v_P,v_ha____,v_E____,c_Expr_Oexp_OFAss(v_ea____,v_F____,v_D____,v_e_092_060_094isub_0622____,tc_List_Olist(tc_String_Ochar)),c_Type_Oty_OVoid). [copy(383),rewrite([362(11)])].
% 1.50/1.80 390 -v_thesis____ # label(cls_conjecture_0) # label(negated_conjecture). [assumption].
% 1.50/1.80 391 v_thesis____ | -c_WellTypeRT_OWTrt(v_P,v_ha____,v_E____,v_e_092_060_094isub_0622____,A) # label(cls_conjecture_1) # label(negated_conjecture). [assumption].
% 1.50/1.80 392 -c_WellTypeRT_OWTrt(v_P,v_ha____,v_E____,v_e_092_060_094isub_0622____,A). [copy(391),unit_del(a,390)].
% 1.50/1.80 728 $F. [resolve(384,a,272,c),unit_del(a,392),unit_del(b,392)].
% 1.50/1.80
% 1.50/1.80 % SZS output end Refutation
% 1.50/1.80 ============================== end of proof ==========================
% 1.50/1.80
% 1.50/1.80 ============================== STATISTICS ============================
% 1.50/1.80
% 1.50/1.80 Given=289. Generated=1037. Kept=636. proofs=1.
% 1.50/1.80 Usable=289. Sos=328. Demods=8. Limbo=7, Disabled=418. Hints=0.
% 1.50/1.80 Megabytes=5.12.
% 1.50/1.80 User_CPU=0.32, System_CPU=0.00, Wall_clock=1.
% 1.50/1.80
% 1.50/1.80 ============================== end of statistics =====================
% 1.50/1.80
% 1.50/1.80 ============================== end of search =========================
% 1.50/1.80
% 1.50/1.80 THEOREM PROVED
% 1.50/1.80 % SZS status Unsatisfiable
% 1.50/1.80
% 1.50/1.80 Exiting with 1 proof.
% 1.50/1.80
% 1.50/1.80 Process 27758 exit (max_proofs) Tue Jun 14 23:12:41 2022
% 1.50/1.80 Prover9 interrupted
%------------------------------------------------------------------------------