TSTP Solution File: KRS012-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS012-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.61s 0.91s
% Output : Refutation 0.61s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : KRS012-1 : TPTP v8.1.0. Released v2.0.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n022.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:25:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.61/0.91 ============================== Prover9 ===============================
% 0.61/0.91 Prover9 (32) version 2009-11A, November 2009.
% 0.61/0.91 Process 12152 was started by sandbox2 on n022.cluster.edu,
% 0.61/0.91 Tue Jun 7 08:25:05 2022
% 0.61/0.91 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_11998_n022.cluster.edu".
% 0.61/0.91 ============================== end of head ===========================
% 0.61/0.91
% 0.61/0.91 ============================== INPUT =================================
% 0.61/0.91
% 0.61/0.91 % Reading from file /tmp/Prover9_11998_n022.cluster.edu
% 0.61/0.91
% 0.61/0.91 set(prolog_style_variables).
% 0.61/0.91 set(auto2).
% 0.61/0.91 % set(auto2) -> set(auto).
% 0.61/0.91 % set(auto) -> set(auto_inference).
% 0.61/0.91 % set(auto) -> set(auto_setup).
% 0.61/0.91 % set(auto_setup) -> set(predicate_elim).
% 0.61/0.91 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.61/0.91 % set(auto) -> set(auto_limits).
% 0.61/0.91 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.61/0.91 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.61/0.91 % set(auto) -> set(auto_denials).
% 0.61/0.91 % set(auto) -> set(auto_process).
% 0.61/0.91 % set(auto2) -> assign(new_constants, 1).
% 0.61/0.91 % set(auto2) -> assign(fold_denial_max, 3).
% 0.61/0.91 % set(auto2) -> assign(max_weight, "200.000").
% 0.61/0.91 % set(auto2) -> assign(max_hours, 1).
% 0.61/0.91 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.61/0.91 % set(auto2) -> assign(max_seconds, 0).
% 0.61/0.91 % set(auto2) -> assign(max_minutes, 5).
% 0.61/0.91 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.61/0.91 % set(auto2) -> set(sort_initial_sos).
% 0.61/0.91 % set(auto2) -> assign(sos_limit, -1).
% 0.61/0.91 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.61/0.91 % set(auto2) -> assign(max_megs, 400).
% 0.61/0.91 % set(auto2) -> assign(stats, some).
% 0.61/0.91 % set(auto2) -> clear(echo_input).
% 0.61/0.91 % set(auto2) -> set(quiet).
% 0.61/0.91 % set(auto2) -> clear(print_initial_clauses).
% 0.61/0.91 % set(auto2) -> clear(print_given).
% 0.61/0.91 assign(lrs_ticks,-1).
% 0.61/0.91 assign(sos_limit,10000).
% 0.61/0.91 assign(order,kbo).
% 0.61/0.91 set(lex_order_vars).
% 0.61/0.91 clear(print_given).
% 0.61/0.91
% 0.61/0.91 % formulas(sos). % not echoed (13 formulas)
% 0.61/0.91
% 0.61/0.91 ============================== end of input ==========================
% 0.61/0.91
% 0.61/0.91 % From the command line: assign(max_seconds, 300).
% 0.61/0.91
% 0.61/0.91 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.61/0.91
% 0.61/0.91 % Formulas that are not ordinary clauses:
% 0.61/0.91
% 0.61/0.91 ============================== end of process non-clausal formulas ===
% 0.61/0.91
% 0.61/0.91 ============================== PROCESS INITIAL CLAUSES ===============
% 0.61/0.91
% 0.61/0.91 ============================== PREDICATE ELIMINATION =================
% 0.61/0.91 1 d(A) | -c(B) | -r(B,A) # label(clause_4) # label(axiom). [assumption].
% 0.61/0.91 2 c(exists) # label(clause_1) # label(negated_conjecture). [assumption].
% 0.61/0.91 3 c(A) | r(A,u0r1(A)) | d(u0r2(A)) # label(clause_9) # label(axiom). [assumption].
% 0.61/0.91 4 c(A) | r(A,u0r1(A)) | r(A,u0r2(A)) # label(clause_10) # label(axiom). [assumption].
% 0.61/0.91 Derived: d(A) | -r(exists,A). [resolve(1,b,2,a)].
% 0.61/0.91 Derived: d(A) | -r(B,A) | r(B,u0r1(B)) | d(u0r2(B)). [resolve(1,b,3,a)].
% 0.61/0.91 Derived: d(A) | -r(B,A) | r(B,u0r1(B)) | r(B,u0r2(B)). [resolve(1,b,4,a)].
% 0.61/0.91 5 c(A) | -d(u0r1(A)) | -e(u0r2(A)) # label(clause_5) # label(axiom). [assumption].
% 0.61/0.91 Derived: -d(u0r1(A)) | -e(u0r2(A)) | d(B) | -r(A,B). [resolve(5,a,1,b)].
% 0.61/0.91 6 c(A) | d(u0r2(A)) | -d(u0r1(A)) # label(clause_6) # label(axiom). [assumption].
% 0.61/0.91 Derived: d(u0r2(A)) | -d(u0r1(A)) | d(B) | -r(A,B). [resolve(6,a,1,b)].
% 0.61/0.91 7 e(A) | -c(B) | -r(B,A) | -d(A) # label(clause_3) # label(axiom). [assumption].
% 0.61/0.91 Derived: e(A) | -r(exists,A) | -d(A). [resolve(7,b,2,a)].
% 0.61/0.91 Derived: e(A) | -r(B,A) | -d(A) | r(B,u0r1(B)) | d(u0r2(B)). [resolve(7,b,3,a)].
% 0.61/0.91 Derived: e(A) | -r(B,A) | -d(A) | r(B,u0r1(B)) | r(B,u0r2(B)). [resolve(7,b,4,a)].
% 0.61/0.91 Derived: e(A) | -r(B,A) | -d(A) | -d(u0r1(B)) | -e(u0r2(B)). [resolve(7,b,5,a)].
% 0.61/0.91 Derived: e(A) | -r(B,A) | -d(A) | d(u0r2(B)) | -d(u0r1(B)). [resolve(7,b,6,a)].
% 0.61/0.91 8 c(A) | r(A,u0r2(A)) | -d(u0r1(A)) # label(clause_7) # label(axiom). [assumption].
% 0.61/0.91 Derived: r(A,u0r2(A)) | -d(u0r1(A)) | d(B) | -r(A,B). [resolve(8,a,1,b)].
% 0.61/0.91 Derived: r(A,u0r2(A)) | -d(u0r1(A)) | e(B) | -r(A,B) | -d(B). [resolve(8,a,7,b)].
% 0.61/0.91 9 c(A) | r(A,u0r1(A)) | -e(u0r2(A)) # label(clause_8) # label(axiom). [assumption].
% 0.61/0.91 Derived: r(A,u0r1(A)) | -e(u0r2(A)) | d(B) | -r(A,B). [resolve(9,a,1,b)].
% 0.61/0.91 Derived: r(A,u0r1(A)) | -e(u0r2(A)) | e(B) | -r(A,B) | -d(B). [resolve(9,a,7,b)].
% 0.61/0.91 10 -f(exists) # label(clause_2) # label(negated_conjecture). [assumption].
% 0.61/0.91 11 f(A) | r(A,u1r1(A)) # label(clause_13) # label(axiom). [assumption].
% 0.61/0.91 Derived: r(exists,u1r1(exists)). [resolve(10,a,11,a)].
% 0.61/0.91 12 f(A) | -e(u1r1(A)) # label(clause_12) # label(axiom). [assumption].
% 0.61/0.91 Derived: -e(u1r1(exists)). [resolve(12,a,10,a)].
% 0.61/0.91 13 e(A) | -f(B) | -r(B,A) # label(clause_11) # label(axiom). [assumption].
% 0.61/0.91 Derived: e(A) | -r(B,A) | r(B,u1r1(B)). [resolve(13,b,11,a)].
% 0.61/0.91 Derived: e(A) | -r(B,A) | -e(u1r1(B)). [resolve(13,b,12,a)].
% 0.61/0.91
% 0.61/0.91 ============================== end predicate elimination =============
% 0.61/0.91
% 0.61/0.91 Auto_denials: (non-Horn, no changes).
% 0.61/0.91
% 0.61/0.91 Term ordering decisions:
% 0.61/0.91 Function symbol KB weights: exists=1. u0r1=1. u0r2=1. u1r1=1.
% 0.61/0.91
% 0.61/0.91 ============================== end of process initial clauses ========
% 0.61/0.91
% 0.61/0.91 ============================== CLAUSES FOR SEARCH ====================
% 0.61/0.91
% 0.61/0.91 ============================== end of clauses for search =============
% 0.61/0.91
% 0.61/0.91 ============================== SEARCH ================================
% 0.61/0.91
% 0.61/0.91 % Starting search at 0.01 seconds.
% 0.61/0.91
% 0.61/0.91 ============================== PROOF =================================
% 0.61/0.91 % SZS status Unsatisfiable
% 0.61/0.91 % SZS output start Refutation
% 0.61/0.91
% 0.61/0.91 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.61/0.91 % Length of proof is 12.
% 0.61/0.91 % Level of proof is 3.
% 0.61/0.91 % Maximum clause weight is 7.000.
% 0.61/0.91 % Given clauses 15.
% 0.61/0.91
% 0.61/0.91 1 d(A) | -c(B) | -r(B,A) # label(clause_4) # label(axiom). [assumption].
% 0.61/0.91 2 c(exists) # label(clause_1) # label(negated_conjecture). [assumption].
% 0.61/0.91 7 e(A) | -c(B) | -r(B,A) | -d(A) # label(clause_3) # label(axiom). [assumption].
% 0.61/0.91 10 -f(exists) # label(clause_2) # label(negated_conjecture). [assumption].
% 0.61/0.91 11 f(A) | r(A,u1r1(A)) # label(clause_13) # label(axiom). [assumption].
% 0.61/0.91 12 f(A) | -e(u1r1(A)) # label(clause_12) # label(axiom). [assumption].
% 0.61/0.91 14 d(A) | -r(exists,A). [resolve(1,b,2,a)].
% 0.61/0.91 19 e(A) | -r(exists,A) | -d(A). [resolve(7,b,2,a)].
% 0.61/0.91 28 r(exists,u1r1(exists)). [resolve(10,a,11,a)].
% 0.61/0.91 29 -e(u1r1(exists)). [resolve(12,a,10,a)].
% 0.61/0.91 45 -d(u1r1(exists)). [resolve(28,a,19,b),unit_del(a,29)].
% 0.61/0.91 50 $F. [resolve(28,a,14,b),unit_del(a,45)].
% 0.61/0.91
% 0.61/0.91 % SZS output end Refutation
% 0.61/0.91 ============================== end of proof ==========================
% 0.61/0.91
% 0.61/0.91 ============================== STATISTICS ============================
% 0.61/0.91
% 0.61/0.91 Given=15. Generated=37. Kept=36. proofs=1.
% 0.61/0.91 Usable=15. Sos=8. Demods=0. Limbo=13, Disabled=31. Hints=0.
% 0.61/0.91 Megabytes=0.05.
% 0.61/0.91 User_CPU=0.01, System_CPU=0.00, Wall_clock=1.
% 0.61/0.91
% 0.61/0.91 ============================== end of statistics =====================
% 0.61/0.91
% 0.61/0.91 ============================== end of search =========================
% 0.61/0.91
% 0.61/0.91 THEOREM PROVED
% 0.61/0.91 % SZS status Unsatisfiable
% 0.61/0.91
% 0.61/0.91 Exiting with 1 proof.
% 0.61/0.91
% 0.61/0.91 Process 12152 exit (max_proofs) Tue Jun 7 08:25:06 2022
% 0.61/0.91 Prover9 interrupted
%------------------------------------------------------------------------------