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