TSTP Solution File: KRS085+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS085+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n026.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:56 EDT 2022
% Result : Unsatisfiable 0.43s 1.03s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS085+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n026.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 7 08:44:46 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/1.03 ============================== Prover9 ===============================
% 0.43/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.03 Process 18021 was started by sandbox on n026.cluster.edu,
% 0.43/1.03 Tue Jun 7 08:44:46 2022
% 0.43/1.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_17868_n026.cluster.edu".
% 0.43/1.03 ============================== end of head ===========================
% 0.43/1.03
% 0.43/1.03 ============================== INPUT =================================
% 0.43/1.03
% 0.43/1.03 % Reading from file /tmp/Prover9_17868_n026.cluster.edu
% 0.43/1.03
% 0.43/1.03 set(prolog_style_variables).
% 0.43/1.03 set(auto2).
% 0.43/1.03 % set(auto2) -> set(auto).
% 0.43/1.03 % set(auto) -> set(auto_inference).
% 0.43/1.03 % set(auto) -> set(auto_setup).
% 0.43/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.03 % set(auto) -> set(auto_limits).
% 0.43/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.03 % set(auto) -> set(auto_denials).
% 0.43/1.03 % set(auto) -> set(auto_process).
% 0.43/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.03 % set(auto2) -> assign(stats, some).
% 0.43/1.03 % set(auto2) -> clear(echo_input).
% 0.43/1.03 % set(auto2) -> set(quiet).
% 0.43/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.03 % set(auto2) -> clear(print_given).
% 0.43/1.03 assign(lrs_ticks,-1).
% 0.43/1.03 assign(sos_limit,10000).
% 0.43/1.03 assign(order,kbo).
% 0.43/1.03 set(lex_order_vars).
% 0.43/1.03 clear(print_given).
% 0.43/1.03
% 0.43/1.03 % formulas(sos). % not echoed (22 formulas)
% 0.43/1.03
% 0.43/1.03 ============================== end of input ==========================
% 0.43/1.03
% 0.43/1.03 % From the command line: assign(max_seconds, 300).
% 0.43/1.03
% 0.43/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.03
% 0.43/1.03 % Formulas that are not ordinary clauses:
% 0.43/1.03 1 (all A all B (A = B & cUnsatisfiable(A) -> cUnsatisfiable(B))) # label(cUnsatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 2 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 3 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 4 (all A all B (A = B & cp1(A) -> cp1(B))) # label(cp1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 5 (all A all B all C (A = B & rf(A,C) -> rf(B,C))) # label(rf_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 6 (all A all B all C (A = B & rf(C,A) -> rf(C,B))) # label(rf_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 7 (all A all B all C (A = B & rinvF(A,C) -> rinvF(B,C))) # label(rinvF_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 8 (all A all B all C (A = B & rinvF(C,A) -> rinvF(C,B))) # label(rinvF_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 9 (all A all B all C (A = B & rinvR(A,C) -> rinvR(B,C))) # label(rinvR_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 10 (all A all B all C (A = B & rinvR(C,A) -> rinvR(C,B))) # label(rinvR_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 11 (all A all B all C (A = B & rr(A,C) -> rr(B,C))) # label(rr_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 12 (all A all B all C (A = B & rr(C,A) -> rr(C,B))) # label(rr_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 13 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 14 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 15 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 16 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 17 (all X (cUnsatisfiable(X) <-> (exists Y (rr(X,Y) & (exists Z (rr(Y,Z) & cp1(Z) & (all W (rinvR(Z,W) -> -cp1(W))))))) & cp1(X))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 18 (all X (cowlThing(X) -> (all Y0 all Y1 (rf(X,Y0) & rf(X,Y1) -> Y0 = Y1)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 19 (all X all Y (rinvF(X,Y) <-> rf(Y,X))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 20 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 21 (all X all Y all Z (rr(X,Y) & rr(Y,Z) -> rr(X,Z))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03
% 0.43/1.03 ============================== end of process non-clausal formulas ===
% 0.43/1.03
% 0.43/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.03
% 0.43/1.03 ============================== PREDICATE ELIMINATION =================
% 0.43/1.03
% 0.43/1.03 ============================== end predicate elimination =============
% 0.43/1.03
% 0.43/1.03 Auto_denials: (non-Horn, no changes).
% 0.43/1.03
% 0.43/1.03 Term ordering decisions:
% 0.43/1.03 Function symbol KB weights: i2003_11_14_17_19_39537=1. f1=1. f2=1. f3=1.
% 0.43/1.03
% 0.43/1.03 ============================== end of process initial clauses ========
% 0.43/1.03
% 0.43/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.03
% 0.43/1.03 ============================== end of clauses for search =============
% 0.43/1.03
% 0.43/1.03 ============================== SEARCH ================================
% 0.43/1.03
% 0.43/1.03 % Starting search at 0.01 seconds.
% 0.43/1.03
% 0.43/1.03 ============================== PROOF =================================
% 0.43/1.03 % SZS status Unsatisfiable
% 0.43/1.03 % SZS output start Refutation
% 0.43/1.03
% 0.43/1.03 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.43/1.03 % Length of proof is 16.
% 0.43/1.03 % Level of proof is 5.
% 0.43/1.03 % Maximum clause weight is 9.000.
% 0.43/1.03 % Given clauses 39.
% 0.43/1.03
% 0.43/1.03 17 (all X (cUnsatisfiable(X) <-> (exists Y (rr(X,Y) & (exists Z (rr(Y,Z) & cp1(Z) & (all W (rinvR(Z,W) -> -cp1(W))))))) & cp1(X))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 20 (all X all Y (rinvR(X,Y) <-> rr(Y,X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 21 (all X all Y all Z (rr(X,Y) & rr(Y,Z) -> rr(X,Z))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 23 cUnsatisfiable(i2003_11_14_17_19_39537) # label(axiom_7) # label(axiom). [assumption].
% 0.43/1.03 27 -cUnsatisfiable(A) | -rinvR(f2(A),B) | -cp1(B) # label(axiom_2) # label(axiom). [clausify(17)].
% 0.43/1.03 28 -cUnsatisfiable(A) | cp1(A) # label(axiom_2) # label(axiom). [clausify(17)].
% 0.43/1.03 30 -cUnsatisfiable(A) | rr(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(17)].
% 0.43/1.03 34 rinvR(A,B) | -rr(B,A) # label(axiom_5) # label(axiom). [clausify(20)].
% 0.43/1.03 41 -cUnsatisfiable(A) | rr(f1(A),f2(A)) # label(axiom_2) # label(axiom). [clausify(17)].
% 0.43/1.03 50 -rr(A,B) | -rr(B,C) | rr(A,C) # label(axiom_6) # label(axiom). [clausify(21)].
% 0.43/1.03 59 cp1(i2003_11_14_17_19_39537). [resolve(28,a,23,a)].
% 0.43/1.03 61 rr(i2003_11_14_17_19_39537,f1(i2003_11_14_17_19_39537)). [resolve(30,a,23,a)].
% 0.43/1.03 64 rr(f1(i2003_11_14_17_19_39537),f2(i2003_11_14_17_19_39537)). [resolve(41,a,23,a)].
% 0.43/1.03 66 -rinvR(f2(i2003_11_14_17_19_39537),i2003_11_14_17_19_39537). [ur(27,a,23,a,c,59,a)].
% 0.43/1.03 67 -rr(i2003_11_14_17_19_39537,f2(i2003_11_14_17_19_39537)). [ur(34,a,66,a)].
% 0.43/1.03 79 $F. [ur(50,a,61,a,c,67,a),unit_del(a,64)].
% 0.43/1.03
% 0.43/1.03 % SZS output end Refutation
% 0.43/1.03 ============================== end of proof ==========================
% 0.43/1.03
% 0.43/1.03 ============================== STATISTICS ============================
% 0.43/1.03
% 0.43/1.03 Given=39. Generated=71. Kept=54. proofs=1.
% 0.43/1.03 Usable=39. Sos=6. Demods=0. Limbo=9, Disabled=32. Hints=0.
% 0.43/1.03 Megabytes=0.10.
% 0.43/1.03 User_CPU=0.02, System_CPU=0.00, Wall_clock=1.
% 0.43/1.03
% 0.43/1.03 ============================== end of statistics =====================
% 0.43/1.03
% 0.43/1.03 ============================== end of search =========================
% 0.43/1.03
% 0.43/1.03 THEOREM PROVED
% 0.43/1.03 % SZS status Unsatisfiable
% 0.43/1.03
% 0.43/1.03 Exiting with 1 proof.
% 0.43/1.03
% 0.43/1.03 Process 18021 exit (max_proofs) Tue Jun 7 08:44:47 2022
% 0.43/1.03 Prover9 interrupted
%------------------------------------------------------------------------------