TSTP Solution File: KRS019+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS019+1 : TPTP v8.1.0. Released v3.1.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 : Sun Jul 17 03:24:46 EDT 2022
% Result : Unknown 0.44s 1.00s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS019+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n017.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 7 17:40:32 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.44/0.99 ============================== Prover9 ===============================
% 0.44/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.99 Process 4825 was started by sandbox on n017.cluster.edu,
% 0.44/0.99 Tue Jun 7 17:40:33 2022
% 0.44/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_4445_n017.cluster.edu".
% 0.44/0.99 ============================== end of head ===========================
% 0.44/0.99
% 0.44/0.99 ============================== INPUT =================================
% 0.44/0.99
% 0.44/0.99 % Reading from file /tmp/Prover9_4445_n017.cluster.edu
% 0.44/0.99
% 0.44/0.99 set(prolog_style_variables).
% 0.44/0.99 set(auto2).
% 0.44/0.99 % set(auto2) -> set(auto).
% 0.44/0.99 % set(auto) -> set(auto_inference).
% 0.44/0.99 % set(auto) -> set(auto_setup).
% 0.44/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.99 % set(auto) -> set(auto_limits).
% 0.44/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.99 % set(auto) -> set(auto_denials).
% 0.44/0.99 % set(auto) -> set(auto_process).
% 0.44/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.99 % set(auto2) -> assign(stats, some).
% 0.44/0.99 % set(auto2) -> clear(echo_input).
% 0.44/0.99 % set(auto2) -> set(quiet).
% 0.44/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.99 % set(auto2) -> clear(print_given).
% 0.44/0.99 assign(lrs_ticks,-1).
% 0.44/0.99 assign(sos_limit,10000).
% 0.44/0.99 assign(order,kbo).
% 0.44/0.99 set(lex_order_vars).
% 0.44/0.99 clear(print_given).
% 0.44/0.99
% 0.44/0.99 % formulas(sos). % not echoed (6 formulas)
% 0.44/0.99
% 0.44/0.99 ============================== end of input ==========================
% 0.44/0.99
% 0.44/0.99 % From the command line: assign(max_seconds, 300).
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.99
% 0.44/0.99 % Formulas that are not ordinary clauses:
% 0.44/0.99 1 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 2 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 3 (all X (cA(X) <-> (exists Y (rq(X,Y) & cowlThing(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 4 (all X (cNothing(X) -> -(exists Y rp(X,Y)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 5 (all X (cNothing(X) -> (exists Y0 rp(X,Y0)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 6 (all X (cnotA(X) <-> (all Y (rq(X,Y) -> cNothing(Y))))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99
% 0.44/0.99 ============================== end of process non-clausal formulas ===
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.44/0.99
% 0.44/0.99 ============================== PREDICATE ELIMINATION =================
% 0.44/0.99 7 cA(A) | -rq(A,B) | -cowlThing(B) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.44/0.99 8 cowlThing(A) # label(axiom_0) # label(axiom). [clausify(1)].
% 0.44/0.99 9 -cA(A) | cowlThing(f1(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.44/0.99 Derived: cA(A) | -rq(A,B). [resolve(7,c,8,a)].
% 0.44/0.99 10 -xsd_string(A) | -xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.44/0.99 11 xsd_string(A) | xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.44/0.99 12 -cnotA(A) | -rq(A,B) | cNothing(B) # label(axiom_5) # label(axiom). [clausify(6)].
% 0.44/0.99 13 cnotA(A) | rq(A,f3(A)) # label(axiom_5) # label(axiom). [clausify(6)].
% 0.44/0.99 14 cnotA(A) | -cNothing(f3(A)) # label(axiom_5) # label(axiom). [clausify(6)].
% 0.44/0.99 Derived: -rq(A,B) | cNothing(B) | rq(A,f3(A)). [resolve(12,a,13,a)].
% 0.44/0.99 Derived: -rq(A,B) | cNothing(B) | -cNothing(f3(A)). [resolve(12,a,14,a)].
% 0.44/0.99 15 -cNothing(A) | rp(A,f2(A)) # label(axiom_4) # label(axiom). [clausify(5)].
% 0.44/0.99 16 -cNothing(A) | -rp(A,B) # label(axiom_3) # label(axiom). [clausify(4)].
% 0.44/0.99 Derived: -cNothing(A) | -cNothing(A). [resolve(15,b,16,b)].
% 0.44/0.99 17 cA(A) | -rq(A,B). [resolve(7,c,8,a)].
% 0.44/0.99 18 -cA(A) | rq(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.44/0.99 Derived: -rq(A,B) | rq(A,f1(A)). [resolve(17,a,18,a)].
% 0.44/0.99
% 0.44/0.99 ============================== end predicate elimination =============
% 0.44/0.99
% 0.44/0.99 Auto_denials: (non-Horn, no changes).
% 0.44/0.99
% 0.44/0.99 Term ordering decisions:
% 0.44/0.99 Function symbol KB weights: f1=1. f3=1.
% 0.44/0.99
% 0.44/0.99 ============================== end of process initial clauses ========
% 0.44/0.99
% 0.44/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.44/0.99
% 0.44/0.99 ============================== end of clauses for search =============
% 0.44/0.99
% 0.44/0.99 ============================== SEARCH ================================
% 0.44/0.99
% 0.44/0.99 % Starting search at 0.01 seconds.
% 0.44/0.99
% 0.44/0.99 ============================== STATISTICS ============================
% 0.44/0.99
% 0.44/0.99 Given=3. Generated=5. Kept=5. proofs=0.
% 0.44/0.99 Usable=3. Sos=0. Demods=0. Limbo=0, Disabled=19. Hints=0.
% 0.44/0.99 Megabytes=0.03.
% 0.44/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.44/0.99
% 0.44/0.99 ============================== end of statistics =====================
% 0.44/0.99
% 0.44/0.99 ============================== end of search =========================
% 0.44/0.99
% 0.44/0.99 SEARCH FAILED
% 0.44/0.99
% 0.44/0.99 Exiting with failure.
% 0.44/0.99
% 0.44/0.99 Process 4825 exit (sos_empty) Tue Jun 7 17:40:33 2022
% 0.44/0.99 Prover9 interrupted
%------------------------------------------------------------------------------