TSTP Solution File: SCT016-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SCT016-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n003.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 : Mon Jul 18 22:03:26 EDT 2022
% Result : Unsatisfiable 4.28s 4.57s
% Output : Refutation 4.28s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SCT016-1 : TPTP v8.1.0. Released v4.1.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.32 % Computer : n003.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 600
% 0.12/0.32 % DateTime : Sat Jul 2 01:00:08 EDT 2022
% 0.12/0.32 % CPUTime :
% 2.35/2.63 ============================== Prover9 ===============================
% 2.35/2.63 Prover9 (32) version 2009-11A, November 2009.
% 2.35/2.63 Process 31413 was started by sandbox on n003.cluster.edu,
% 2.35/2.63 Sat Jul 2 01:00:09 2022
% 2.35/2.63 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_31259_n003.cluster.edu".
% 2.35/2.63 ============================== end of head ===========================
% 2.35/2.63
% 2.35/2.63 ============================== INPUT =================================
% 2.35/2.63
% 2.35/2.63 % Reading from file /tmp/Prover9_31259_n003.cluster.edu
% 2.35/2.63
% 2.35/2.63 set(prolog_style_variables).
% 2.35/2.63 set(auto2).
% 2.35/2.63 % set(auto2) -> set(auto).
% 2.35/2.63 % set(auto) -> set(auto_inference).
% 2.35/2.63 % set(auto) -> set(auto_setup).
% 2.35/2.63 % set(auto_setup) -> set(predicate_elim).
% 2.35/2.63 % set(auto_setup) -> assign(eq_defs, unfold).
% 2.35/2.63 % set(auto) -> set(auto_limits).
% 2.35/2.63 % set(auto_limits) -> assign(max_weight, "100.000").
% 2.35/2.63 % set(auto_limits) -> assign(sos_limit, 20000).
% 2.35/2.63 % set(auto) -> set(auto_denials).
% 2.35/2.63 % set(auto) -> set(auto_process).
% 2.35/2.63 % set(auto2) -> assign(new_constants, 1).
% 2.35/2.63 % set(auto2) -> assign(fold_denial_max, 3).
% 2.35/2.63 % set(auto2) -> assign(max_weight, "200.000").
% 2.35/2.63 % set(auto2) -> assign(max_hours, 1).
% 2.35/2.63 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 2.35/2.63 % set(auto2) -> assign(max_seconds, 0).
% 2.35/2.63 % set(auto2) -> assign(max_minutes, 5).
% 2.35/2.63 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 2.35/2.63 % set(auto2) -> set(sort_initial_sos).
% 2.35/2.63 % set(auto2) -> assign(sos_limit, -1).
% 2.35/2.63 % set(auto2) -> assign(lrs_ticks, 3000).
% 2.35/2.63 % set(auto2) -> assign(max_megs, 400).
% 2.35/2.63 % set(auto2) -> assign(stats, some).
% 2.35/2.63 % set(auto2) -> clear(echo_input).
% 2.35/2.63 % set(auto2) -> set(quiet).
% 2.35/2.63 % set(auto2) -> clear(print_initial_clauses).
% 2.35/2.63 % set(auto2) -> clear(print_given).
% 2.35/2.63 assign(lrs_ticks,-1).
% 2.35/2.63 assign(sos_limit,10000).
% 2.35/2.63 assign(order,kbo).
% 2.35/2.63 set(lex_order_vars).
% 2.35/2.63 clear(print_given).
% 2.35/2.63
% 2.35/2.63 % formulas(sos). % not echoed (1015 formulas)
% 2.35/2.63
% 2.35/2.63 ============================== end of input ==========================
% 2.35/2.63
% 2.35/2.63 % From the command line: assign(max_seconds, 300).
% 2.35/2.63
% 2.35/2.63 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 2.35/2.63
% 2.35/2.63 % Formulas that are not ordinary clauses:
% 2.35/2.63
% 2.35/2.63 ============================== end of process non-clausal formulas ===
% 2.35/2.63
% 2.35/2.63 ============================== PROCESS INITIAL CLAUSES ===============
% 2.35/2.63
% 2.35/2.63 ============================== PREDICATE ELIMINATION =================
% 2.35/2.63
% 2.35/2.63 ============================== end predicate elimination =============
% 2.35/2.63
% 2.35/2.63 Auto_denials: (non-Horn, no changes).
% 2.35/2.63
% 2.35/2.63 Term ordering decisions:
% 2.35/2.63 Function symbol KB weights: tc_bool=1. tc_Arrow__Order__Mirabelle_Oalt=1. t_a=1. t_b=1. c_and=1. v_x=1. c_Not=1. v_r=1. c_implies=1. t_c=1. v_b=1. v_y=1. v_A=1. v_L=1. v_a=1. v_f=1. c_or=1. v_s=1. hAPP=1. tc_fun=1. tc_prod=1. c_Pair=1. c_Transitive__Closure_Ortrancl=1. c_Transitive__Closure_Otrancl=1. c_Relation_Osym=1. c_Relation_Otrans=1. c_Relation_Oantisym=1. c_Hilbert__Choice_OEps=1. c_Relation_OField=1. c_Wellfounded_Oacc=1. c_Finite__Set_Olattice__class_OInf__fin=1. c_Finite__Set_Olattice__class_OSup__fin=1. c_Arrow__Order__Mirabelle_Omkbot=1. c_Arrow__Order__Mirabelle_Omktop=1. c_The=1. c_Zorn_OChain=1. c_Relation_Oirrefl=1. c_in=1. c_Lattices_Oupper__semilattice__class_Osup=1. c_Lattices_Olower__semilattice__class_Oinf=1. c_Orderings_Obot__class_Obot=1. c_Set_Oinsert=1. c_Collect=1. c_lessequals=1. c_Orderings_Otop__class_Otop=1. c_HOL_Ominus__class_Ominus=1. c_fequal=1. c_HOL_Ouminus__class_Ouminus=1. c_Ex=1. c_HOL_Oord__class_Oless=1. c_All=1. c_Relation_OId=1. c_COMBI=1. c_HOL_Oundefined=1. c_COMBB=1. c_COMBC=1. c_COMBS=1. c_Complete__Lattice_Ocomplete__lattice__class_OSUPR=1. c_Complete__Lattice_Ocomplete__lattice__class_OINFI=1. c_Set_Oimage=1. c_Relation_Oconverse=1. c_Set_Ovimage=1. c_COMBK=1. c_Relation_ODomain=1. c_Relation_OImage=1. c_Relation_ORange=1. c_Predicate_Oconversep=1. c_Relation_Osingle__valued=1. c_Relation_Ototal__on=1. c_Finite__Set_Olattice_OInf__fin=1. c_Finite__Set_Olattice_OSup__fin=1. c_List_Olistsp=1. c_Orderings_Oorder__class_Omono=1. c_Wellfounded_Oaccp=1. c_FuncSet_Oextensional=1. c_Orderings_Oorder_Omono=1. c_Orderings_Oorder_Ostrict__mono=1. c_Orderings_Oorder__class_Ostrict__mono=1. c_Arrow__Order__Mirabelle_Oabove=1. c_Arrow__Order__Mirabelle_Obelow=1. c_Product__Type_OSigma=1. c_split=1. c_Hilbert__Choice_Oinv__into=1. c_Fun_Othe__inv__into=1. c_ATP__Linkup_Osko__Finite__Set__Xfinite__Collect__bex__1__1=1. c_ATP__Linkup_Osko__Finite__Set__Xfinite__Collect__bounded__ex__1__1=1. c_Predicate_ODomainP=1. c_Predicate_ORangeP=1. c_Relation_Orel__comp=1. c_Predicate_Opred__comp=1.
% 4.28/4.57
% 4.28/4.57 ============================== end of process initial clauses ========
% 4.28/4.57
% 4.28/4.57 ============================== CLAUSES FOR SEARCH ====================
% 4.28/4.57
% 4.28/4.57 ============================== end of clauses for search =============
% 4.28/4.57
% 4.28/4.57 ============================== SEARCH ================================
% 4.28/4.57
% 4.28/4.57 % Starting search at 0.98 seconds.
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=65.000, iters=3391
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=64.000, iters=3360
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=62.000, iters=3336
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=60.000, iters=3373
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=59.000, iters=3382
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=55.000, iters=3338
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=53.000, iters=3334
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=52.000, iters=3359
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=51.000, iters=3350
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=50.000, iters=3424
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=49.000, iters=3399
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=48.000, iters=3362
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=47.000, iters=3359
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=45.000, iters=3335
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=44.000, iters=3352
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=42.000, iters=3343
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=41.000, iters=3426
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=40.000, iters=3464
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=39.000, iters=3448
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=38.000, iters=3337
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=36.000, iters=3404
% 4.28/4.57
% 4.28/4.57 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 51 (0.00 of 2.31 sec).
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=35.000, iters=3487
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=34.000, iters=3445
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=33.000, iters=3359
% 4.28/4.57
% 4.28/4.57 Low Water (keep): wt=32.000, iters=3389
% 4.28/4.57
% 4.28/4.57 ============================== PROOF =================================
% 4.28/4.57 % SZS status Unsatisfiable
% 4.28/4.57 % SZS output start Refutation
% 4.28/4.57
% 4.28/4.57 % Proof 1 at 2.91 (+ 0.03) seconds.
% 4.28/4.57 % Length of proof is 14.
% 4.28/4.57 % Level of proof is 5.
% 4.28/4.57 % Maximum clause weight is 26.000.
% 4.28/4.57 % Given clauses 639.
% 4.28/4.57
% 4.28/4.57 416 hBOOL(hAPP(hAPP(c_in(A),B),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(A,tc_bool)),C))) | hBOOL(hAPP(hAPP(c_in(A),B),C)) # label(cls_ComplI_0) # label(axiom). [assumption].
% 4.28/4.57 417 -hBOOL(hAPP(hAPP(c_in(A),B),C)) | -hBOOL(hAPP(hAPP(c_in(A),B),hAPP(c_HOL_Ouminus__class_Ouminus(tc_fun(A,tc_bool)),C))) # label(cls_ComplD_0) # label(axiom). [assumption].
% 4.28/4.57 839 hAPP(c_Collect(A),hAPP(hAPP(c_COMBC(A,tc_fun(A,tc_bool),tc_bool),c_in(A)),B)) = B # label(cls_Collect__mem__eq_0) # label(axiom). [assumption].
% 4.28/4.57 897 hAPP(c_Collect(A),B) = B # label(cls_Collect__def_0) # label(axiom). [assumption].
% 4.28/4.57 912 hAPP(hAPP(hAPP(c_COMBC(A,B,C),D),E),F) = hAPP(hAPP(D,F),E) # label(cls_COMBC__def_0) # label(axiom). [assumption].
% 4.28/4.57 914 hAPP(hAPP(hAPP(c_COMBS(A,B,C),D),E),F) = hAPP(hAPP(D,F),hAPP(E,F)) # label(cls_COMBS__def_0) # label(axiom). [assumption].
% 4.28/4.57 1119 hAPP(hAPP(c_COMBC(A,tc_fun(A,tc_bool),tc_bool),c_in(A)),B) = B. [back_rewrite(839),rewrite([897(9)])].
% 4.28/4.57 6957 hBOOL(hAPP(hAPP(hAPP(c_COMBS(A,B,C),c_in(D)),c_HOL_Ouminus__class_Ouminus(tc_fun(D,tc_bool))),E)) | hBOOL(hAPP(hAPP(c_in(D),E),E)). [para(914(a,2),416(a,1))].
% 4.28/4.57 6958 -hBOOL(hAPP(hAPP(c_in(A),B),B)) | -hBOOL(hAPP(hAPP(hAPP(c_COMBS(C,D,E),c_in(A)),c_HOL_Ouminus__class_Ouminus(tc_fun(A,tc_bool))),B)). [para(914(a,2),417(b,1))].
% 4.28/4.57 8350 hAPP(hAPP(c_in(A),B),C) = hAPP(C,B). [para(1119(a,1),912(a,1,1)),flip(a)].
% 4.28/4.57 8543 -hBOOL(hAPP(A,A)) | -hBOOL(hAPP(hAPP(hAPP(c_COMBS(B,C,D),c_in(E)),c_HOL_Ouminus__class_Ouminus(tc_fun(E,tc_bool))),A)). [back_rewrite(6958),rewrite([8350(3)])].
% 4.28/4.57 8544 hBOOL(hAPP(hAPP(hAPP(c_COMBS(A,B,C),c_in(D)),c_HOL_Ouminus__class_Ouminus(tc_fun(D,tc_bool))),E)) | hBOOL(hAPP(E,E)). [back_rewrite(6957),rewrite([8350(12)])].
% 4.28/4.57 9131 -hBOOL(hAPP(hAPP(hAPP(c_COMBS(A,B,C),c_in(D)),c_HOL_Ouminus__class_Ouminus(tc_fun(D,tc_bool))),hAPP(hAPP(c_COMBS(A,B,C),c_in(D)),c_HOL_Ouminus__class_Ouminus(tc_fun(D,tc_bool))))). [factor(8543,a,b)].
% 4.28/4.57 9132 $F. [factor(8544,a,b),unit_del(a,9131)].
% 4.28/4.57
% 4.28/4.57 % SZS output end Refutation
% 4.28/4.57 ============================== end of proof ==========================
% 4.28/4.57
% 4.28/4.57 ============================== STATISTICS ============================
% 4.28/4.57
% 4.28/4.57 Given=639. Generated=20720. Kept=8895. proofs=1.
% 4.28/4.57 Usable=498. Sos=5355. Demods=632. Limbo=588, Disabled=3469. Hints=0.
% 4.28/4.57 Megabytes=39.42.
% 4.28/4.57 User_CPU=2.91, System_CPU=0.03, Wall_clock=3.
% 4.28/4.57
% 4.28/4.57 ============================== end of statistics =====================
% 4.28/4.57
% 4.28/4.57 ============================== end of search =========================
% 4.28/4.57
% 4.28/4.57 THEOREM PROVED
% 4.28/4.57 % SZS status Unsatisfiable
% 4.28/4.57
% 4.28/4.57 Exiting with 1 proof.
% 4.28/4.57
% 4.28/4.57 Process 31413 exit (max_proofs) Sat Jul 2 01:00:12 2022
% 4.28/4.57 Prover9 interrupted
%------------------------------------------------------------------------------