TSTP Solution File: KRS013-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS013-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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 : Unsatisfiable 0.64s 0.95s
% Output : Refutation 0.64s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : KRS013-1 : TPTP v8.1.0. Released v2.0.0.
% 0.08/0.09 % Command : tptp2X_and_run_prover9 %d %s
% 0.09/0.29 % Computer : n022.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 600
% 0.09/0.29 % DateTime : Tue Jun 7 17:15:35 EDT 2022
% 0.09/0.29 % CPUTime :
% 0.64/0.95 ============================== Prover9 ===============================
% 0.64/0.95 Prover9 (32) version 2009-11A, November 2009.
% 0.64/0.95 Process 29727 was started by sandbox on n022.cluster.edu,
% 0.64/0.95 Tue Jun 7 17:15:35 2022
% 0.64/0.95 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_29573_n022.cluster.edu".
% 0.64/0.95 ============================== end of head ===========================
% 0.64/0.95
% 0.64/0.95 ============================== INPUT =================================
% 0.64/0.95
% 0.64/0.95 % Reading from file /tmp/Prover9_29573_n022.cluster.edu
% 0.64/0.95
% 0.64/0.95 set(prolog_style_variables).
% 0.64/0.95 set(auto2).
% 0.64/0.95 % set(auto2) -> set(auto).
% 0.64/0.95 % set(auto) -> set(auto_inference).
% 0.64/0.95 % set(auto) -> set(auto_setup).
% 0.64/0.95 % set(auto_setup) -> set(predicate_elim).
% 0.64/0.95 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.64/0.95 % set(auto) -> set(auto_limits).
% 0.64/0.95 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.64/0.95 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.64/0.95 % set(auto) -> set(auto_denials).
% 0.64/0.95 % set(auto) -> set(auto_process).
% 0.64/0.95 % set(auto2) -> assign(new_constants, 1).
% 0.64/0.95 % set(auto2) -> assign(fold_denial_max, 3).
% 0.64/0.95 % set(auto2) -> assign(max_weight, "200.000").
% 0.64/0.95 % set(auto2) -> assign(max_hours, 1).
% 0.64/0.95 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.64/0.95 % set(auto2) -> assign(max_seconds, 0).
% 0.64/0.95 % set(auto2) -> assign(max_minutes, 5).
% 0.64/0.95 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.64/0.95 % set(auto2) -> set(sort_initial_sos).
% 0.64/0.95 % set(auto2) -> assign(sos_limit, -1).
% 0.64/0.95 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.64/0.95 % set(auto2) -> assign(max_megs, 400).
% 0.64/0.95 % set(auto2) -> assign(stats, some).
% 0.64/0.95 % set(auto2) -> clear(echo_input).
% 0.64/0.95 % set(auto2) -> set(quiet).
% 0.64/0.95 % set(auto2) -> clear(print_initial_clauses).
% 0.64/0.95 % set(auto2) -> clear(print_given).
% 0.64/0.95 assign(lrs_ticks,-1).
% 0.64/0.95 assign(sos_limit,10000).
% 0.64/0.95 assign(order,kbo).
% 0.64/0.95 set(lex_order_vars).
% 0.64/0.95 clear(print_given).
% 0.64/0.95
% 0.64/0.95 % formulas(sos). % not echoed (33 formulas)
% 0.64/0.95
% 0.64/0.95 ============================== end of input ==========================
% 0.64/0.95
% 0.64/0.95 % From the command line: assign(max_seconds, 300).
% 0.64/0.95
% 0.64/0.95 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.64/0.95
% 0.64/0.95 % Formulas that are not ordinary clauses:
% 0.64/0.95
% 0.64/0.95 ============================== end of process non-clausal formulas ===
% 0.64/0.95
% 0.64/0.95 ============================== PROCESS INITIAL CLAUSES ===============
% 0.64/0.95
% 0.64/0.95 ============================== PREDICATE ELIMINATION =================
% 0.64/0.95 1 d(A) | -e(B) | -r(B,A) # label(clause_15) # label(axiom). [assumption].
% 0.64/0.95 2 e(exist) # label(clause_1) # label(negated_conjecture). [assumption].
% 0.64/0.95 3 e(A) | s2least(u4r1(A)) | r(A,u4r2(A)) # label(clause_20) # label(axiom). [assumption].
% 0.64/0.95 4 e(A) | r(A,u4r1(A)) | r(A,u4r2(A)) # label(clause_22) # label(axiom). [assumption].
% 0.64/0.95 Derived: d(A) | -r(exist,A). [resolve(1,b,2,a)].
% 0.64/0.95 Derived: d(A) | -r(B,A) | s2least(u4r1(B)) | r(B,u4r2(B)). [resolve(1,b,3,a)].
% 0.64/0.95 Derived: d(A) | -r(B,A) | r(B,u4r1(B)) | r(B,u4r2(B)). [resolve(1,b,4,a)].
% 0.64/0.95 5 e(A) | -c(u4r1(A)) | -d(u4r2(A)) # label(clause_17) # label(axiom). [assumption].
% 0.64/0.95 Derived: -c(u4r1(A)) | -d(u4r2(A)) | d(B) | -r(A,B). [resolve(5,a,1,b)].
% 0.64/0.95 6 e(A) | s2least(u4r1(A)) | -d(u4r2(A)) # label(clause_19) # label(axiom). [assumption].
% 0.64/0.95 Derived: s2least(u4r1(A)) | -d(u4r2(A)) | d(B) | -r(A,B). [resolve(6,a,1,b)].
% 0.64/0.95 7 c(A) | -e(B) | -r(B,A) | -s2least(A) # label(clause_16) # label(axiom). [assumption].
% 0.64/0.95 Derived: c(A) | -r(exist,A) | -s2least(A). [resolve(7,b,2,a)].
% 0.64/0.95 Derived: c(A) | -r(B,A) | -s2least(A) | s2least(u4r1(B)) | r(B,u4r2(B)). [resolve(7,b,3,a)].
% 0.64/0.95 Derived: c(A) | -r(B,A) | -s2least(A) | r(B,u4r1(B)) | r(B,u4r2(B)). [resolve(7,b,4,a)].
% 0.64/0.95 Derived: c(A) | -r(B,A) | -s2least(A) | -c(u4r1(B)) | -d(u4r2(B)). [resolve(7,b,5,a)].
% 0.64/0.95 Derived: c(A) | -r(B,A) | -s2least(A) | s2least(u4r1(B)) | -d(u4r2(B)). [resolve(7,b,6,a)].
% 0.64/0.95 8 e(A) | r(A,u4r2(A)) | -c(u4r1(A)) # label(clause_18) # label(axiom). [assumption].
% 0.64/0.95 Derived: r(A,u4r2(A)) | -c(u4r1(A)) | d(B) | -r(A,B). [resolve(8,a,1,b)].
% 0.64/0.95 Derived: r(A,u4r2(A)) | -c(u4r1(A)) | c(B) | -r(A,B) | -s2least(B). [resolve(8,a,7,b)].
% 0.64/0.95 9 e(A) | r(A,u4r1(A)) | -d(u4r2(A)) # label(clause_21) # label(axiom). [assumption].
% 0.64/0.95 Derived: r(A,u4r1(A)) | -d(u4r2(A)) | d(B) | -r(A,B). [resolve(9,a,1,b)].
% 0.64/0.95 Derived: r(A,u4r1(A)) | -d(u4r2(A)) | c(B) | -r(A,B) | -s2least(B). [resolve(9,a,7,b)].
% 0.64/0.95 10 d(A) | -t1most(A) # label(clause_10) # label(axiom). [assumption].
% 0.64/0.95 11 t1most(A) | t(A,u3r1(A)) # label(clause_13) # label(axiom). [assumption].
% 0.64/0.95 12 t1most(A) | t(A,u3r2(A)) # label(clause_14) # label(axiom). [assumption].
% 0.64/0.95 13 t1most(A) | -d(A) # label(clause_9) # label(axiom). [assumption].
% 0.64/0.95 Derived: d(A) | t(A,u3r1(A)). [resolve(10,b,11,a)].
% 0.64/0.95 Derived: d(A) | t(A,u3r2(A)). [resolve(10,b,12,a)].
% 0.64/0.95 14 t1most(A) | -equalish(u3r2(A),u3r1(A)) # label(clause_12) # label(axiom). [assumption].
% 0.64/0.95 Derived: -equalish(u3r2(A),u3r1(A)) | d(A). [resolve(14,a,10,b)].
% 0.64/0.95 15 equalish(A,B) | -t1most(C) | -t(C,A) | -t(C,B) # label(clause_11) # label(axiom). [assumption].
% 0.64/0.95 Derived: equalish(A,B) | -t(C,A) | -t(C,B) | t(C,u3r1(C)). [resolve(15,b,11,a)].
% 0.64/0.95 Derived: equalish(A,B) | -t(C,A) | -t(C,B) | t(C,u3r2(C)). [resolve(15,b,12,a)].
% 0.64/0.95 Derived: equalish(A,B) | -t(C,A) | -t(C,B) | -d(C). [resolve(15,b,13,a)].
% 0.64/0.95 Derived: equalish(A,B) | -t(C,A) | -t(C,B) | -equalish(u3r2(C),u3r1(C)). [resolve(15,b,14,a)].
% 0.64/0.95 16 -f(exist) # label(clause_2) # label(negated_conjecture). [assumption].
% 0.64/0.95 17 f(A) | r(A,u6r1(A)) # label(clause_29) # label(axiom). [assumption].
% 0.64/0.95 Derived: r(exist,u6r1(exist)). [resolve(16,a,17,a)].
% 0.64/0.95 18 f(A) | -s1most(u6r1(A)) # label(clause_28) # label(axiom). [assumption].
% 0.64/0.95 Derived: -s1most(u6r1(exist)). [resolve(18,a,16,a)].
% 0.64/0.95 19 s1most(A) | -f(B) | -r(B,A) # label(clause_27) # label(axiom). [assumption].
% 0.64/0.95 Derived: s1most(A) | -r(B,A) | r(B,u6r1(B)). [resolve(19,b,17,a)].
% 0.64/0.95 Derived: s1most(A) | -r(B,A) | -s1most(u6r1(B)). [resolve(19,b,18,a)].
% 0.64/0.95 20 t2least(A) | -c(A) # label(clause_3) # label(axiom). [assumption].
% 0.64/0.95 21 -t2least(A) | -equalish(u1r2(A),u1r1(A)) # label(clause_5) # label(axiom). [assumption].
% 0.64/0.95 Derived: -c(A) | -equalish(u1r2(A),u1r1(A)). [resolve(20,a,21,a)].
% 0.64/0.95 22 c(A) | -t2least(A) # label(clause_4) # label(axiom). [assumption].
% 0.64/0.95 23 t(A,u1r1(A)) | -t2least(A) # label(clause_6) # label(axiom). [assumption].
% 0.64/0.95 Derived: t(A,u1r1(A)) | -c(A). [resolve(23,b,20,a)].
% 0.64/0.95 24 t(A,u1r2(A)) | -t2least(A) # label(clause_7) # label(axiom). [assumption].
% 0.64/0.95 Derived: t(A,u1r2(A)) | -c(A). [resolve(24,b,20,a)].
% 0.64/0.95 25 t2least(A) | equalish(B,C) | -t(A,B) | -t(A,C) # label(clause_8) # label(axiom). [assumption].
% 0.64/0.95 Derived: equalish(A,B) | -t(C,A) | -t(C,B) | -equalish(u1r2(C),u1r1(C)). [resolve(25,a,21,a)].
% 0.64/0.95 Derived: equalish(A,B) | -t(C,A) | -t(C,B) | c(C). [resolve(25,a,22,b)].
% 0.64/0.95 Derived: equalish(A,B) | -t(C,A) | -t(C,B) | t(C,u1r1(C)). [resolve(25,a,23,b)].
% 0.64/0.95 Derived: equalish(A,B) | -t(C,A) | -t(C,B) | t(C,u1r2(C)). [resolve(25,a,24,b)].
% 0.64/0.95
% 0.64/0.95 ============================== end predicate elimination =============
% 0.64/0.95
% 0.64/0.95 Auto_denials: (non-Horn, no changes).
% 0.64/0.95
% 0.64/0.95 Term ordering decisions:
% 0.64/0.95 Function symbol KB weights: exist=1. u4r1=1. u4r2=1. u3r1=1. u3r2=1. u1r1=1. u1r2=1. u6r1=1. u7r1=1. u7r2=1. u5r1=1. u5r2=1.
% 0.64/0.95
% 0.64/0.95 ============================== end of process initial clauses ========
% 0.64/0.95
% 0.64/0.95 ============================== CLAUSES FOR SEARCH ====================
% 0.64/0.95
% 0.64/0.95 ============================== end of clauses for search =============
% 0.64/0.95
% 0.64/0.95 ============================== SEARCH ================================
% 0.64/0.95
% 0.64/0.95 % Starting search at 0.01 seconds.
% 0.64/0.95
% 0.64/0.95 ============================== PROOF =================================
% 0.64/0.95 % SZS status Unsatisfiable
% 0.64/0.95 % SZS output start Refutation
% 0.64/0.95
% 0.64/0.95 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.64/0.95 % Length of proof is 35.
% 0.64/0.95 % Level of proof is 6.
% 0.64/0.95 % Maximum clause weight is 11.000.
% 0.64/0.95 % Given clauses 70.
% 0.64/0.95
% 0.64/0.95 1 d(A) | -e(B) | -r(B,A) # label(clause_15) # label(axiom). [assumption].
% 0.64/0.95 2 e(exist) # label(clause_1) # label(negated_conjecture). [assumption].
% 0.64/0.95 7 c(A) | -e(B) | -r(B,A) | -s2least(A) # label(clause_16) # label(axiom). [assumption].
% 0.64/0.95 13 t1most(A) | -d(A) # label(clause_9) # label(axiom). [assumption].
% 0.64/0.95 15 equalish(A,B) | -t1most(C) | -t(C,A) | -t(C,B) # label(clause_11) # label(axiom). [assumption].
% 0.64/0.95 16 -f(exist) # label(clause_2) # label(negated_conjecture). [assumption].
% 0.64/0.95 17 f(A) | r(A,u6r1(A)) # label(clause_29) # label(axiom). [assumption].
% 0.64/0.95 18 f(A) | -s1most(u6r1(A)) # label(clause_28) # label(axiom). [assumption].
% 0.64/0.95 20 t2least(A) | -c(A) # label(clause_3) # label(axiom). [assumption].
% 0.64/0.95 21 -t2least(A) | -equalish(u1r2(A),u1r1(A)) # label(clause_5) # label(axiom). [assumption].
% 0.64/0.95 23 t(A,u1r1(A)) | -t2least(A) # label(clause_6) # label(axiom). [assumption].
% 0.64/0.95 24 t(A,u1r2(A)) | -t2least(A) # label(clause_7) # label(axiom). [assumption].
% 0.64/0.95 26 s1most(A) | s(A,u7r1(A)) # label(clause_32) # label(axiom). [assumption].
% 0.64/0.95 27 s1most(A) | s(A,u7r2(A)) # label(clause_33) # label(axiom). [assumption].
% 0.64/0.95 31 s1most(A) | -equalish(u7r2(A),u7r1(A)) # label(clause_31) # label(axiom). [assumption].
% 0.64/0.95 32 s2least(A) | equalish(B,C) | -s(A,B) | -s(A,C) # label(clause_26) # label(axiom). [assumption].
% 0.64/0.95 34 d(A) | -r(exist,A). [resolve(1,b,2,a)].
% 0.64/0.95 39 c(A) | -r(exist,A) | -s2least(A). [resolve(7,b,2,a)].
% 0.64/0.95 53 equalish(A,B) | -t(C,A) | -t(C,B) | -d(C). [resolve(15,b,13,a)].
% 0.64/0.95 55 r(exist,u6r1(exist)). [resolve(16,a,17,a)].
% 0.64/0.95 56 -s1most(u6r1(exist)). [resolve(18,a,16,a)].
% 0.64/0.95 59 -c(A) | -equalish(u1r2(A),u1r1(A)). [resolve(20,a,21,a)].
% 0.64/0.95 60 t(A,u1r1(A)) | -c(A). [resolve(23,b,20,a)].
% 0.64/0.95 61 t(A,u1r2(A)) | -c(A). [resolve(24,b,20,a)].
% 0.64/0.95 76 s2least(A) | equalish(u7r2(A),B) | -s(A,B) | s1most(A). [resolve(32,c,27,b)].
% 0.64/0.95 88 c(u6r1(exist)) | -s2least(u6r1(exist)). [resolve(55,a,39,b)].
% 0.64/0.95 93 d(u6r1(exist)). [resolve(55,a,34,b)].
% 0.64/0.95 94 -equalish(u7r2(u6r1(exist)),u7r1(u6r1(exist))). [ur(31,a,56,a)].
% 0.64/0.95 115 s2least(A) | equalish(u7r2(A),u7r1(A)) | s1most(A). [resolve(76,c,26,b),merge(d)].
% 0.64/0.95 117 s2least(u6r1(exist)). [resolve(115,b,94,a),unit_del(b,56)].
% 0.64/0.95 119 c(u6r1(exist)). [back_unit_del(88),unit_del(b,117)].
% 0.64/0.95 124 t(u6r1(exist),u1r2(u6r1(exist))). [resolve(119,a,61,b)].
% 0.64/0.95 125 t(u6r1(exist),u1r1(u6r1(exist))). [resolve(119,a,60,b)].
% 0.64/0.95 126 -equalish(u1r2(u6r1(exist)),u1r1(u6r1(exist))). [ur(59,a,119,a)].
% 0.64/0.95 131 $F. [ur(53,a,126,a,b,124,a,d,93,a),unit_del(a,125)].
% 0.64/0.95
% 0.64/0.95 % SZS output end Refutation
% 0.64/0.95 ============================== end of proof ==========================
% 0.64/0.95
% 0.64/0.95 ============================== STATISTICS ============================
% 0.64/0.95
% 0.64/0.95 Given=70. Generated=168. Kept=105. proofs=1.
% 0.64/0.95 Usable=64. Sos=17. Demods=0. Limbo=3, Disabled=86. Hints=0.
% 0.64/0.95 Megabytes=0.13.
% 0.64/0.95 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.64/0.95
% 0.64/0.95 ============================== end of statistics =====================
% 0.64/0.95
% 0.64/0.95 ============================== end of search =========================
% 0.64/0.95
% 0.64/0.95 THEOREM PROVED
% 0.64/0.95 % SZS status Unsatisfiable
% 0.64/0.95
% 0.64/0.95 Exiting with 1 proof.
% 0.64/0.95
% 0.64/0.95 Process 29727 exit (max_proofs) Tue Jun 7 17:15:35 2022
% 0.64/0.95 Prover9 interrupted
%------------------------------------------------------------------------------