TSTP Solution File: KRS007-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS007-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:45 EDT 2022
% Result : Unknown 0.42s 1.00s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : KRS007-1 : TPTP v8.1.0. Released v2.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n023.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:29:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/0.99 ============================== Prover9 ===============================
% 0.42/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.99 Process 10510 was started by sandbox on n023.cluster.edu,
% 0.42/0.99 Tue Jun 7 08:29:54 2022
% 0.42/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_10357_n023.cluster.edu".
% 0.42/0.99 ============================== end of head ===========================
% 0.42/0.99
% 0.42/0.99 ============================== INPUT =================================
% 0.42/0.99
% 0.42/0.99 % Reading from file /tmp/Prover9_10357_n023.cluster.edu
% 0.42/0.99
% 0.42/0.99 set(prolog_style_variables).
% 0.42/0.99 set(auto2).
% 0.42/0.99 % set(auto2) -> set(auto).
% 0.42/0.99 % set(auto) -> set(auto_inference).
% 0.42/0.99 % set(auto) -> set(auto_setup).
% 0.42/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.99 % set(auto) -> set(auto_limits).
% 0.42/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.99 % set(auto) -> set(auto_denials).
% 0.42/0.99 % set(auto) -> set(auto_process).
% 0.42/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.42/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.42/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.42/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.42/0.99 % set(auto2) -> assign(stats, some).
% 0.42/0.99 % set(auto2) -> clear(echo_input).
% 0.42/0.99 % set(auto2) -> set(quiet).
% 0.42/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.99 % set(auto2) -> clear(print_given).
% 0.42/0.99 assign(lrs_ticks,-1).
% 0.42/0.99 assign(sos_limit,10000).
% 0.42/0.99 assign(order,kbo).
% 0.42/0.99 set(lex_order_vars).
% 0.42/0.99 clear(print_given).
% 0.42/0.99
% 0.42/0.99 % formulas(sos). % not echoed (26 formulas)
% 0.42/0.99
% 0.42/0.99 ============================== end of input ==========================
% 0.42/0.99
% 0.42/0.99 % From the command line: assign(max_seconds, 300).
% 0.42/0.99
% 0.42/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.99
% 0.42/0.99 % Formulas that are not ordinary clauses:
% 0.42/0.99
% 0.42/0.99 ============================== end of process non-clausal formulas ===
% 0.42/0.99
% 0.42/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/0.99
% 0.42/0.99 ============================== PREDICATE ELIMINATION =================
% 0.42/0.99 1 d(u4r3(A)) | -e(A) # label(clause_15) # label(axiom). [assumption].
% 0.42/0.99 2 e(exist) # label(clause_1) # label(negated_conjecture). [assumption].
% 0.42/0.99 Derived: d(u4r3(exist)). [resolve(1,b,2,a)].
% 0.42/0.99 3 c(u4r2(A)) | -e(A) # label(clause_17) # label(axiom). [assumption].
% 0.42/0.99 Derived: c(u4r2(exist)). [resolve(3,b,2,a)].
% 0.42/0.99 4 r(A,u4r3(A)) | -e(A) # label(clause_16) # label(axiom). [assumption].
% 0.42/0.99 Derived: r(exist,u4r3(exist)). [resolve(4,b,2,a)].
% 0.42/0.99 5 r(A,u4r2(A)) | -e(A) # label(clause_18) # label(axiom). [assumption].
% 0.42/0.99 Derived: r(exist,u4r2(exist)). [resolve(5,b,2,a)].
% 0.42/0.99 6 r(A,u4r1(A)) | -e(A) # label(clause_19) # label(axiom). [assumption].
% 0.42/0.99 Derived: r(exist,u4r1(exist)). [resolve(6,b,2,a)].
% 0.42/0.99 7 e(A) | -r(A,B) | -r(A,C) | -c(C) | -r(A,D) | -d(D) # label(clause_20) # label(axiom). [assumption].
% 0.42/0.99 Derived: -r(A,B) | -r(A,C) | -c(C) | -r(A,D) | -d(D) | d(u4r3(A)). [resolve(7,a,1,b)].
% 0.42/0.99 Derived: -r(A,B) | -r(A,C) | -c(C) | -r(A,D) | -d(D) | c(u4r2(A)). [resolve(7,a,3,b)].
% 0.42/0.99 Derived: -r(A,B) | -r(A,C) | -c(C) | -r(A,D) | -d(D) | r(A,u4r3(A)). [resolve(7,a,4,b)].
% 0.42/0.99 Derived: -r(A,B) | -r(A,C) | -c(C) | -r(A,D) | -d(D) | r(A,u4r2(A)). [resolve(7,a,5,b)].
% 0.42/0.99 Derived: -r(A,B) | -r(A,C) | -c(C) | -r(A,D) | -d(D) | r(A,u4r1(A)). [resolve(7,a,6,b)].
% 0.42/0.99 8 d(A) | -s1most(A) # label(clause_10) # label(axiom). [assumption].
% 0.42/0.99 9 s1most(A) | s(A,u3r1(A)) # label(clause_13) # label(axiom). [assumption].
% 0.42/0.99 10 s1most(A) | s(A,u3r2(A)) # label(clause_14) # label(axiom). [assumption].
% 0.42/0.99 11 s1most(A) | -d(A) # label(clause_9) # label(axiom). [assumption].
% 0.42/0.99 Derived: d(A) | s(A,u3r1(A)). [resolve(8,b,9,a)].
% 0.42/0.99 Derived: d(A) | s(A,u3r2(A)). [resolve(8,b,10,a)].
% 0.42/0.99 12 s1most(A) | -equalish(u3r2(A),u3r1(A)) # label(clause_12) # label(axiom). [assumption].
% 0.42/0.99 Derived: -equalish(u3r2(A),u3r1(A)) | d(A). [resolve(12,a,8,b)].
% 0.42/1.00 13 equalish(A,B) | -s1most(C) | -s(C,A) | -s(C,B) # label(clause_11) # label(axiom). [assumption].
% 0.42/1.00 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | s(C,u3r1(C)). [resolve(13,b,9,a)].
% 0.42/1.00 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | s(C,u3r2(C)). [resolve(13,b,10,a)].
% 0.42/1.00 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | -d(C). [resolve(13,b,11,a)].
% 0.42/1.00 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | -equalish(u3r2(C),u3r1(C)). [resolve(13,b,12,a)].
% 0.42/1.00 14 f(A) | -r2least(A) # label(clause_22) # label(axiom). [assumption].
% 0.42/1.00 15 -f(exist) # label(clause_2) # label(negated_conjecture). [assumption].
% 0.42/1.00 16 r2least(A) | -f(A) # label(clause_21) # label(axiom). [assumption].
% 0.42/1.00 Derived: -r2least(exist). [resolve(14,a,15,a)].
% 0.42/1.00 17 s2least(A) | -c(A) # label(clause_3) # label(axiom). [assumption].
% 0.42/1.00 18 -s2least(A) | -equalish(u1r2(A),u1r1(A)) # label(clause_5) # label(axiom). [assumption].
% 0.42/1.00 Derived: -c(A) | -equalish(u1r2(A),u1r1(A)). [resolve(17,a,18,a)].
% 0.42/1.00 19 c(A) | -s2least(A) # label(clause_4) # label(axiom). [assumption].
% 0.42/1.00 20 s(A,u1r1(A)) | -s2least(A) # label(clause_6) # label(axiom). [assumption].
% 0.42/1.00 Derived: s(A,u1r1(A)) | -c(A). [resolve(20,b,17,a)].
% 0.42/1.00 21 s(A,u1r2(A)) | -s2least(A) # label(clause_7) # label(axiom). [assumption].
% 0.42/1.00 Derived: s(A,u1r2(A)) | -c(A). [resolve(21,b,17,a)].
% 0.42/1.00 22 s2least(A) | equalish(B,C) | -s(A,B) | -s(A,C) # label(clause_8) # label(axiom). [assumption].
% 0.42/1.00 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | -equalish(u1r2(C),u1r1(C)). [resolve(22,a,18,a)].
% 0.42/1.00 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | c(C). [resolve(22,a,19,b)].
% 0.42/1.00 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | s(C,u1r1(C)). [resolve(22,a,20,b)].
% 0.42/1.00 Derived: equalish(A,B) | -s(C,A) | -s(C,B) | s(C,u1r2(C)). [resolve(22,a,21,b)].
% 0.42/1.00 23 r2least(A) | equalish(B,C) | -r(A,B) | -r(A,C) # label(clause_26) # label(axiom). [assumption].
% 0.42/1.00 24 -r2least(A) | -equalish(u6r2(A),u6r1(A)) # label(clause_23) # label(axiom). [assumption].
% 0.42/1.00 25 r(A,u6r1(A)) | -r2least(A) # label(clause_24) # label(axiom). [assumption].
% 0.42/1.00 26 r(A,u6r2(A)) | -r2least(A) # label(clause_25) # label(axiom). [assumption].
% 0.42/1.00 Derived: equalish(A,B) | -r(C,A) | -r(C,B) | -equalish(u6r2(C),u6r1(C)). [resolve(23,a,24,a)].
% 0.42/1.00 Derived: equalish(A,B) | -r(C,A) | -r(C,B) | r(C,u6r1(C)). [resolve(23,a,25,b)].
% 0.42/1.00 Derived: equalish(A,B) | -r(C,A) | -r(C,B) | r(C,u6r2(C)). [resolve(23,a,26,b)].
% 0.42/1.00 27 -r2least(exist). [resolve(14,a,15,a)].
% 0.42/1.00 Derived: equalish(A,B) | -r(exist,A) | -r(exist,B). [resolve(27,a,23,a)].
% 0.42/1.00
% 0.42/1.00 ============================== end predicate elimination =============
% 0.42/1.00
% 0.42/1.00 Auto_denials: (non-Horn, no changes).
% 0.42/1.00
% 0.42/1.00 Term ordering decisions:
% 0.42/1.00 Function symbol KB weights: exist=1. u3r1=1. u3r2=1. u4r2=1. u4r3=1. u1r1=1. u1r2=1. u4r1=1. u6r1=1. u6r2=1.
% 0.42/1.00
% 0.42/1.00 ============================== end of process initial clauses ========
% 0.42/1.00
% 0.42/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.42/1.00
% 0.42/1.00 ============================== end of clauses for search =============
% 0.42/1.00
% 0.42/1.00 ============================== SEARCH ================================
% 0.42/1.00
% 0.42/1.00 % Starting search at 0.02 seconds.
% 0.42/1.00
% 0.42/1.00 ============================== STATISTICS ============================
% 0.42/1.00
% 0.42/1.00 Given=83. Generated=335. Kept=135. proofs=0.
% 0.42/1.00 Usable=70. Sos=0. Demods=0. Limbo=0, Disabled=120. Hints=0.
% 0.42/1.00 Megabytes=0.13.
% 0.42/1.00 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.42/1.00
% 0.42/1.00 ============================== end of statistics =====================
% 0.42/1.00
% 0.42/1.00 ============================== end of search =========================
% 0.42/1.00
% 0.42/1.00 SEARCH FAILED
% 0.42/1.00
% 0.42/1.00 Exiting with failure.
% 0.42/1.00
% 0.42/1.00 Process 10510 exit (sos_empty) Tue Jun 7 08:29:54 2022
% 0.42/1.00 Prover9 interrupted
%------------------------------------------------------------------------------