TSTP Solution File: KRS005-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS005-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:44 EDT 2022
% Result : Unknown 0.66s 0.99s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : KRS005-1 : TPTP v8.1.0. Released v2.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n025.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 7 08:54:18 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.66/0.98 ============================== Prover9 ===============================
% 0.66/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.66/0.98 Process 28256 was started by sandbox on n025.cluster.edu,
% 0.66/0.98 Tue Jun 7 08:54:19 2022
% 0.66/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_28102_n025.cluster.edu".
% 0.66/0.98 ============================== end of head ===========================
% 0.66/0.98
% 0.66/0.98 ============================== INPUT =================================
% 0.66/0.98
% 0.66/0.98 % Reading from file /tmp/Prover9_28102_n025.cluster.edu
% 0.66/0.98
% 0.66/0.98 set(prolog_style_variables).
% 0.66/0.98 set(auto2).
% 0.66/0.98 % set(auto2) -> set(auto).
% 0.66/0.98 % set(auto) -> set(auto_inference).
% 0.66/0.98 % set(auto) -> set(auto_setup).
% 0.66/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.66/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.66/0.98 % set(auto) -> set(auto_limits).
% 0.66/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.66/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.66/0.98 % set(auto) -> set(auto_denials).
% 0.66/0.98 % set(auto) -> set(auto_process).
% 0.66/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.66/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.66/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.66/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.66/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.66/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.66/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.66/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.66/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.66/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.66/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.66/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.66/0.98 % set(auto2) -> assign(stats, some).
% 0.66/0.98 % set(auto2) -> clear(echo_input).
% 0.66/0.98 % set(auto2) -> set(quiet).
% 0.66/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.66/0.98 % set(auto2) -> clear(print_given).
% 0.66/0.98 assign(lrs_ticks,-1).
% 0.66/0.98 assign(sos_limit,10000).
% 0.66/0.98 assign(order,kbo).
% 0.66/0.98 set(lex_order_vars).
% 0.66/0.98 clear(print_given).
% 0.66/0.98
% 0.66/0.98 % formulas(sos). % not echoed (8 formulas)
% 0.66/0.98
% 0.66/0.98 ============================== end of input ==========================
% 0.66/0.98
% 0.66/0.98 % From the command line: assign(max_seconds, 300).
% 0.66/0.98
% 0.66/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.66/0.98
% 0.66/0.98 % Formulas that are not ordinary clauses:
% 0.66/0.98
% 0.66/0.98 ============================== end of process non-clausal formulas ===
% 0.66/0.98
% 0.66/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.66/0.98
% 0.66/0.98 ============================== PREDICATE ELIMINATION =================
% 0.66/0.98 1 -e(A) | -equalish(u0r3(A),u0r2(A)) # label(clause_4) # label(axiom). [assumption].
% 0.66/0.98 2 e(exist) # label(clause_1) # label(negated_conjecture). [assumption].
% 0.66/0.98 Derived: -equalish(u0r3(exist),u0r2(exist)). [resolve(1,a,2,a)].
% 0.66/0.98 3 r(A,u0r4(A)) | -e(A) # label(clause_3) # label(axiom). [assumption].
% 0.66/0.98 Derived: r(exist,u0r4(exist)). [resolve(3,b,2,a)].
% 0.66/0.98 4 r(A,u0r2(A)) | -e(A) # label(clause_5) # label(axiom). [assumption].
% 0.66/0.98 Derived: r(exist,u0r2(exist)). [resolve(4,b,2,a)].
% 0.66/0.98 5 r(A,u0r3(A)) | -e(A) # label(clause_6) # label(axiom). [assumption].
% 0.66/0.98 Derived: r(exist,u0r3(exist)). [resolve(5,b,2,a)].
% 0.66/0.98 6 equalish(A,u0r4(B)) | -e(B) | -r(B,A) # label(clause_2) # label(axiom). [assumption].
% 0.66/0.98 Derived: equalish(A,u0r4(exist)) | -r(exist,A). [resolve(6,b,2,a)].
% 0.66/0.98 7 e(A) | equalish(B,C) | -r(A,B) | -r(A,C) | -r(A,D) | -equalish(u0r1(D,A),D) # label(clause_7) # label(axiom). [assumption].
% 0.66/0.98 Derived: equalish(A,B) | -r(C,A) | -r(C,B) | -r(C,D) | -equalish(u0r1(D,C),D) | -equalish(u0r3(C),u0r2(C)). [resolve(7,a,1,a)].
% 0.66/0.98 Derived: equalish(A,B) | -r(C,A) | -r(C,B) | -r(C,D) | -equalish(u0r1(D,C),D) | r(C,u0r4(C)). [resolve(7,a,3,b)].
% 0.66/0.98 Derived: equalish(A,B) | -r(C,A) | -r(C,B) | -r(C,D) | -equalish(u0r1(D,C),D) | r(C,u0r2(C)). [resolve(7,a,4,b)].
% 0.66/0.98 Derived: equalish(A,B) | -r(C,A) | -r(C,B) | -r(C,D) | -equalish(u0r1(D,C),D) | r(C,u0r3(C)). [resolve(7,a,5,b)].
% 0.66/0.98 Derived: equalish(A,B) | -r(C,A) | -r(C,B) | -r(C,D) | -equalish(u0r1(D,C),D) | equalish(E,u0r4(C)) | -r(C,E). [resolve(7,a,6,b)].
% 0.66/0.98 8 e(A) | equalish(B,C) | r(A,u0r1(D,A)) | -r(A,B) | -r(A,C) | -r(A,D) # label(clause_8) # label(axiom). [assumption].
% 0.66/0.98 Derived: equalish(A,B) | r(C,u0r1(D,C)) | -r(C,A) | -r(C,B) | -r(C,D) | -equalish(u0r3(C),u0r2(C)). [resolve(8,a,1,a)].
% 0.66/0.98 Derived: equalish(A,B) | r(C,u0r1(D,C)) | -r(C,A) | -r(C,B) | -r(C,D) | r(C,u0r4(C)). [resolve(8,a,3,b)].
% 0.66/0.99 Derived: equalish(A,B) | r(C,u0r1(D,C)) | -r(C,A) | -r(C,B) | -r(C,D) | r(C,u0r2(C)). [resolve(8,a,4,b)].
% 0.66/0.99 Derived: equalish(A,B) | r(C,u0r1(D,C)) | -r(C,A) | -r(C,B) | -r(C,D) | r(C,u0r3(C)). [resolve(8,a,5,b)].
% 0.66/0.99 Derived: equalish(A,B) | r(C,u0r1(D,C)) | -r(C,A) | -r(C,B) | -r(C,D) | equalish(E,u0r4(C)) | -r(C,E). [resolve(8,a,6,b)].
% 0.66/0.99
% 0.66/0.99 ============================== end predicate elimination =============
% 0.66/0.99
% 0.66/0.99 Auto_denials: (non-Horn, no changes).
% 0.66/0.99
% 0.66/0.99 Term ordering decisions:
% 0.66/0.99 Function symbol KB weights: exist=1. u0r1=1. u0r4=1. u0r2=1. u0r3=1.
% 0.66/0.99
% 0.66/0.99 ============================== end of process initial clauses ========
% 0.66/0.99
% 0.66/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.66/0.99
% 0.66/0.99 ============================== end of clauses for search =============
% 0.66/0.99
% 0.66/0.99 ============================== SEARCH ================================
% 0.66/0.99
% 0.66/0.99 % Starting search at 0.01 seconds.
% 0.66/0.99
% 0.66/0.99 ============================== STATISTICS ============================
% 0.66/0.99
% 0.66/0.99 Given=88. Generated=391. Kept=88. proofs=0.
% 0.66/0.99 Usable=88. Sos=0. Demods=0. Limbo=0, Disabled=23. Hints=0.
% 0.66/0.99 Megabytes=0.09.
% 0.66/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.66/0.99
% 0.66/0.99 ============================== end of statistics =====================
% 0.66/0.99
% 0.66/0.99 ============================== end of search =========================
% 0.66/0.99
% 0.66/0.99 SEARCH FAILED
% 0.66/0.99
% 0.66/0.99 Exiting with failure.
% 0.66/0.99
% 0.66/0.99 Process 28256 exit (sos_empty) Tue Jun 7 08:54:19 2022
% 0.66/0.99 Prover9 interrupted
%------------------------------------------------------------------------------