TSTP Solution File: KRS017-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS017-1 : TPTP v8.1.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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 : Unsatisfiable 0.75s 1.05s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : KRS017-1 : TPTP v8.1.0. Released v2.0.0.
% 0.03/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n020.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Tue Jun 7 13:51:21 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.75/1.05 ============================== Prover9 ===============================
% 0.75/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.05 Process 24642 was started by sandbox2 on n020.cluster.edu,
% 0.75/1.05 Tue Jun 7 13:51:22 2022
% 0.75/1.05 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_24489_n020.cluster.edu".
% 0.75/1.05 ============================== end of head ===========================
% 0.75/1.05
% 0.75/1.05 ============================== INPUT =================================
% 0.75/1.05
% 0.75/1.05 % Reading from file /tmp/Prover9_24489_n020.cluster.edu
% 0.75/1.05
% 0.75/1.05 set(prolog_style_variables).
% 0.75/1.05 set(auto2).
% 0.75/1.05 % set(auto2) -> set(auto).
% 0.75/1.05 % set(auto) -> set(auto_inference).
% 0.75/1.05 % set(auto) -> set(auto_setup).
% 0.75/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.05 % set(auto) -> set(auto_limits).
% 0.75/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.05 % set(auto) -> set(auto_denials).
% 0.75/1.05 % set(auto) -> set(auto_process).
% 0.75/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.05 % set(auto2) -> assign(stats, some).
% 0.75/1.05 % set(auto2) -> clear(echo_input).
% 0.75/1.05 % set(auto2) -> set(quiet).
% 0.75/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.05 % set(auto2) -> clear(print_given).
% 0.75/1.05 assign(lrs_ticks,-1).
% 0.75/1.05 assign(sos_limit,10000).
% 0.75/1.05 assign(order,kbo).
% 0.75/1.05 set(lex_order_vars).
% 0.75/1.05 clear(print_given).
% 0.75/1.05
% 0.75/1.05 % formulas(sos). % not echoed (7 formulas)
% 0.75/1.05
% 0.75/1.05 ============================== end of input ==========================
% 0.75/1.05
% 0.75/1.05 % From the command line: assign(max_seconds, 300).
% 0.75/1.05
% 0.75/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.05
% 0.75/1.05 % Formulas that are not ordinary clauses:
% 0.75/1.05
% 0.75/1.05 ============================== end of process non-clausal formulas ===
% 0.75/1.05
% 0.75/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.05
% 0.75/1.05 ============================== PREDICATE ELIMINATION =================
% 0.75/1.05 1 r(A,u0r3(A)) | -e(A) # label(clause_3) # label(axiom). [assumption].
% 0.75/1.05 2 e(exists) # label(clause_1) # label(negated_conjecture). [assumption].
% 0.75/1.05 Derived: r(exists,u0r3(exists)). [resolve(1,b,2,a)].
% 0.75/1.05 3 e(A) | -a(u0r2(A)) | -r(A,B) # label(clause_5) # label(axiom). [assumption].
% 0.75/1.05 Derived: -a(u0r2(A)) | -r(A,B) | r(A,u0r3(A)). [resolve(3,a,1,b)].
% 0.75/1.05 4 e(A) | r(A,u0r1(A)) | -r(A,B) # label(clause_7) # label(axiom). [assumption].
% 0.75/1.05 Derived: r(A,u0r1(A)) | -r(A,B) | r(A,u0r3(A)). [resolve(4,a,1,b)].
% 0.75/1.05 5 a(A) | -e(B) | -r(B,C) | -r(A,C) # label(clause_4) # label(axiom). [assumption].
% 0.75/1.05 Derived: a(A) | -r(exists,B) | -r(A,B). [resolve(5,b,2,a)].
% 0.75/1.05 Derived: a(A) | -r(B,C) | -r(A,C) | -a(u0r2(B)) | -r(B,D). [resolve(5,b,3,a)].
% 0.75/1.05 Derived: a(A) | -r(B,C) | -r(A,C) | r(B,u0r1(B)) | -r(B,D). [resolve(5,b,4,a)].
% 0.75/1.05 6 e(A) | r(u0r2(A),u0r1(A)) | -r(A,B) # label(clause_6) # label(axiom). [assumption].
% 0.75/1.05 Derived: r(u0r2(A),u0r1(A)) | -r(A,B) | r(A,u0r3(A)). [resolve(6,a,1,b)].
% 0.75/1.05 Derived: r(u0r2(A),u0r1(A)) | -r(A,B) | a(C) | -r(A,D) | -r(C,D). [resolve(6,a,5,b)].
% 0.75/1.05
% 0.75/1.05 ============================== end predicate elimination =============
% 0.75/1.05
% 0.75/1.05 Auto_denials: (non-Horn, no changes).
% 0.75/1.05
% 0.75/1.05 Term ordering decisions:
% 0.75/1.05 Function symbol KB weights: exists=1. u0r1=1. u0r2=1. u0r3=1.
% 0.75/1.05
% 0.75/1.05 ============================== PROOF =================================
% 0.75/1.05 % SZS status Unsatisfiable
% 0.75/1.05 % SZS output start Refutation
% 0.75/1.05
% 0.75/1.05 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.75/1.05 % Length of proof is 8.
% 0.75/1.05 % Level of proof is 3.
% 0.75/1.05 % Maximum clause weight is 8.000.
% 0.75/1.05 % Given clauses 0.
% 0.75/1.05
% 0.75/1.05 1 r(A,u0r3(A)) | -e(A) # label(clause_3) # label(axiom). [assumption].
% 0.75/1.05 2 e(exists) # label(clause_1) # label(negated_conjecture). [assumption].
% 0.75/1.05 5 a(A) | -e(B) | -r(B,C) | -r(A,C) # label(clause_4) # label(axiom). [assumption].
% 0.75/1.05 7 -a(exists) # label(clause_2) # label(negated_conjecture). [assumption].
% 0.75/1.05 8 r(exists,u0r3(exists)). [resolve(1,b,2,a)].
% 0.75/1.05 11 a(A) | -r(exists,B) | -r(A,B). [resolve(5,b,2,a)].
% 0.75/1.05 16 -r(exists,A). [factor(11,b,c),unit_del(a,7)].
% 0.75/1.05 17 $F. [resolve(16,a,8,a)].
% 0.75/1.05
% 0.75/1.05 % SZS output end Refutation
% 0.75/1.05 ============================== end of proof ==========================
% 0.75/1.05
% 0.75/1.05 ============================== STATISTICS ============================
% 0.75/1.05
% 0.75/1.05 Given=0. Generated=10. Kept=10. proofs=1.
% 0.75/1.05 Usable=0. Sos=4. Demods=0. Limbo=5, Disabled=15. Hints=0.
% 0.75/1.05 Megabytes=0.03.
% 0.75/1.05 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.75/1.05
% 0.75/1.05 ============================== end of statistics =====================
% 0.75/1.05
% 0.75/1.05 ============================== end of search =========================
% 0.75/1.05
% 0.75/1.05 THEOREM PROVED
% 0.75/1.05 % SZS status Unsatisfiable
% 0.75/1.05
% 0.75/1.05 Exiting with 1 proof.
% 0.75/1.05
% 0.75/1.05 Process 24642 exit (max_proofs) Tue Jun 7 13:51:22 2022
% 0.75/1.05 Prover9 interrupted
%------------------------------------------------------------------------------