TSTP Solution File: KRS106+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS106+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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:59 EDT 2022
% Result : Unsatisfiable 0.42s 0.99s
% Output : Refutation 0.42s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS106+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n019.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 14:13:40 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/0.98 ============================== Prover9 ===============================
% 0.42/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.42/0.98 Process 17516 was started by sandbox2 on n019.cluster.edu,
% 0.42/0.98 Tue Jun 7 14:13:41 2022
% 0.42/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_17363_n019.cluster.edu".
% 0.42/0.98 ============================== end of head ===========================
% 0.42/0.98
% 0.42/0.98 ============================== INPUT =================================
% 0.42/0.98
% 0.42/0.98 % Reading from file /tmp/Prover9_17363_n019.cluster.edu
% 0.42/0.98
% 0.42/0.98 set(prolog_style_variables).
% 0.42/0.98 set(auto2).
% 0.42/0.98 % set(auto2) -> set(auto).
% 0.42/0.98 % set(auto) -> set(auto_inference).
% 0.42/0.98 % set(auto) -> set(auto_setup).
% 0.42/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.42/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/0.98 % set(auto) -> set(auto_limits).
% 0.42/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/0.98 % set(auto) -> set(auto_denials).
% 0.42/0.98 % set(auto) -> set(auto_process).
% 0.42/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.42/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.42/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.42/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.42/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.42/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.42/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.42/0.98 % set(auto2) -> assign(stats, some).
% 0.42/0.98 % set(auto2) -> clear(echo_input).
% 0.42/0.98 % set(auto2) -> set(quiet).
% 0.42/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.42/0.98 % set(auto2) -> clear(print_given).
% 0.42/0.98 assign(lrs_ticks,-1).
% 0.42/0.98 assign(sos_limit,10000).
% 0.42/0.98 assign(order,kbo).
% 0.42/0.98 set(lex_order_vars).
% 0.42/0.98 clear(print_given).
% 0.42/0.98
% 0.42/0.98 % formulas(sos). % not echoed (27 formulas)
% 0.42/0.98
% 0.42/0.98 ============================== end of input ==========================
% 0.42/0.98
% 0.42/0.98 % From the command line: assign(max_seconds, 300).
% 0.42/0.98
% 0.42/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/0.98
% 0.42/0.98 % Formulas that are not ordinary clauses:
% 0.42/0.98 1 (all A all B (A = B & cUnsatisfiable(A) -> cUnsatisfiable(B))) # label(cUnsatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 2 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 3 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 4 (all A all B (A = B & cp1(A) -> cp1(B))) # label(cp1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 5 (all A all B (A = B & cp1xcomp(A) -> cp1xcomp(B))) # label(cp1xcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 6 (all A all B (A = B & cp2(A) -> cp2(B))) # label(cp2_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 7 (all A all B all C (A = B & ra_Px1(A,C) -> ra_Px1(B,C))) # label(ra_Px1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 8 (all A all B all C (A = B & ra_Px1(C,A) -> ra_Px1(C,B))) # label(ra_Px1_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 9 (all A all B all C (A = B & rf1(A,C) -> rf1(B,C))) # label(rf1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 10 (all A all B all C (A = B & rf1(C,A) -> rf1(C,B))) # label(rf1_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 11 (all A all B all C (A = B & rf2(A,C) -> rf2(B,C))) # label(rf2_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 12 (all A all B all C (A = B & rf2(C,A) -> rf2(C,B))) # label(rf2_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 13 (all A all B all C (A = B & rf3(A,C) -> rf3(B,C))) # label(rf3_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 14 (all A all B all C (A = B & rf3(C,A) -> rf3(C,B))) # label(rf3_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.98 15 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 16 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 17 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 18 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 19 (all X (cUnsatisfiable(X) <-> (exists Y (rf3(X,Y) & cp2(Y))) & (exists Y (rf1(X,Y) & cp1(Y))) & (exists Y (rf2(X,Y) & cp1xcomp(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 20 (all X (cp1(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 21 (all X (cp1xcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 22 (all X all Y all Z (rf1(X,Y) & rf1(X,Z) -> Y = Z)) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 23 (all X all Y all Z (rf2(X,Y) & rf2(X,Z) -> Y = Z)) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 24 (all X all Y all Z (rf3(X,Y) & rf3(X,Z) -> Y = Z)) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 25 (all X all Y (rf3(X,Y) -> rf1(X,Y))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 26 (all X all Y (rf3(X,Y) -> rf2(X,Y))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99
% 0.42/0.99 ============================== end of process non-clausal formulas ===
% 0.42/0.99
% 0.42/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.42/0.99
% 0.42/0.99 ============================== PREDICATE ELIMINATION =================
% 0.42/0.99
% 0.42/0.99 ============================== end predicate elimination =============
% 0.42/0.99
% 0.42/0.99 Auto_denials: (non-Horn, no changes).
% 0.42/0.99
% 0.42/0.99 Term ordering decisions:
% 0.42/0.99 Function symbol KB weights: i2003_11_14_17_20_57644=1. f1=1. f2=1. f3=1. f4=1. f5=1.
% 0.42/0.99
% 0.42/0.99 ============================== end of process initial clauses ========
% 0.42/0.99
% 0.42/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.42/0.99
% 0.42/0.99 ============================== end of clauses for search =============
% 0.42/0.99
% 0.42/0.99 ============================== SEARCH ================================
% 0.42/0.99
% 0.42/0.99 % Starting search at 0.01 seconds.
% 0.42/0.99
% 0.42/0.99 ============================== PROOF =================================
% 0.42/0.99 % SZS status Unsatisfiable
% 0.42/0.99 % SZS output start Refutation
% 0.42/0.99
% 0.42/0.99 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.42/0.99 % Length of proof is 36.
% 0.42/0.99 % Level of proof is 8.
% 0.42/0.99 % Maximum clause weight is 9.000.
% 0.42/0.99 % Given clauses 54.
% 0.42/0.99
% 0.42/0.99 5 (all A all B (A = B & cp1xcomp(A) -> cp1xcomp(B))) # label(cp1xcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 10 (all A all B all C (A = B & rf1(C,A) -> rf1(C,B))) # label(rf1_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 19 (all X (cUnsatisfiable(X) <-> (exists Y (rf3(X,Y) & cp2(Y))) & (exists Y (rf1(X,Y) & cp1(Y))) & (exists Y (rf2(X,Y) & cp1xcomp(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 20 (all X (cp1(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 21 (all X (cp1xcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 22 (all X all Y all Z (rf1(X,Y) & rf1(X,Z) -> Y = Z)) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 23 (all X all Y all Z (rf2(X,Y) & rf2(X,Z) -> Y = Z)) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 25 (all X all Y (rf3(X,Y) -> rf1(X,Y))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 26 (all X all Y (rf3(X,Y) -> rf2(X,Y))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.42/0.99 28 cUnsatisfiable(i2003_11_14_17_20_57644) # label(axiom_8) # label(axiom). [assumption].
% 0.42/0.99 33 -cp1(A) | -ra_Px1(A,B) # label(axiom_3) # label(axiom). [clausify(20)].
% 0.42/0.99 35 -cUnsatisfiable(A) | cp1(f2(A)) # label(axiom_2) # label(axiom). [clausify(19)].
% 0.42/0.99 36 -cUnsatisfiable(A) | cp1xcomp(f3(A)) # label(axiom_2) # label(axiom). [clausify(19)].
% 0.42/0.99 38 -cUnsatisfiable(A) | rf3(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(19)].
% 0.42/0.99 39 -cUnsatisfiable(A) | rf1(A,f2(A)) # label(axiom_2) # label(axiom). [clausify(19)].
% 0.42/0.99 40 -cUnsatisfiable(A) | rf2(A,f3(A)) # label(axiom_2) # label(axiom). [clausify(19)].
% 0.42/0.99 41 -cp1xcomp(A) | ra_Px1(A,f5(A)) # label(axiom_4) # label(axiom). [clausify(21)].
% 0.42/0.99 42 -rf3(A,B) | rf1(A,B) # label(axiom_9) # label(axiom). [clausify(25)].
% 0.42/0.99 43 -rf3(A,B) | rf2(A,B) # label(axiom_10) # label(axiom). [clausify(26)].
% 0.42/0.99 48 A != B | -cp1xcomp(B) | cp1xcomp(A) # label(cp1xcomp_substitution_1) # label(axiom). [clausify(5)].
% 0.42/0.99 55 A != B | -rf1(C,B) | rf1(C,A) # label(rf1_substitution_2) # label(axiom). [clausify(10)].
% 0.42/0.99 60 -rf1(A,B) | -rf1(A,C) | C = B # label(axiom_5) # label(axiom). [clausify(22)].
% 0.42/0.99 61 -rf2(A,B) | -rf2(A,C) | C = B # label(axiom_6) # label(axiom). [clausify(23)].
% 0.42/0.99 65 cp1(f2(i2003_11_14_17_20_57644)). [resolve(35,a,28,a)].
% 0.42/0.99 66 cp1xcomp(f3(i2003_11_14_17_20_57644)). [resolve(36,a,28,a)].
% 0.42/0.99 68 rf3(i2003_11_14_17_20_57644,f1(i2003_11_14_17_20_57644)). [resolve(38,a,28,a)].
% 0.42/0.99 69 rf1(i2003_11_14_17_20_57644,f2(i2003_11_14_17_20_57644)). [resolve(39,a,28,a)].
% 0.42/0.99 70 rf2(i2003_11_14_17_20_57644,f3(i2003_11_14_17_20_57644)). [resolve(40,a,28,a)].
% 0.42/0.99 77 -ra_Px1(f2(i2003_11_14_17_20_57644),A). [ur(33,a,65,a)].
% 0.42/0.99 84 rf2(i2003_11_14_17_20_57644,f1(i2003_11_14_17_20_57644)). [resolve(68,a,43,a)].
% 0.42/0.99 85 rf1(i2003_11_14_17_20_57644,f1(i2003_11_14_17_20_57644)). [resolve(68,a,42,a)].
% 0.42/0.99 89 -cp1xcomp(f2(i2003_11_14_17_20_57644)). [ur(41,b,77,a)].
% 0.42/0.99 90 f3(i2003_11_14_17_20_57644) != f2(i2003_11_14_17_20_57644). [ur(48,b,66,a,c,89,a),flip(a)].
% 0.42/0.99 91 -rf1(i2003_11_14_17_20_57644,f3(i2003_11_14_17_20_57644)). [ur(60,a,69,a,c,90,a)].
% 0.42/0.99 103 f3(i2003_11_14_17_20_57644) != f1(i2003_11_14_17_20_57644). [ur(55,b,85,a,c,91,a)].
% 0.42/0.99 106 $F. [ur(61,b,70,a,c,103,a),unit_del(a,84)].
% 0.42/0.99
% 0.42/0.99 % SZS output end Refutation
% 0.42/0.99 ============================== end of proof ==========================
% 0.42/0.99
% 0.42/0.99 ============================== STATISTICS ============================
% 0.42/0.99
% 0.42/0.99 Given=54. Generated=114. Kept=77. proofs=1.
% 0.42/0.99 Usable=54. Sos=23. Demods=0. Limbo=0, Disabled=37. Hints=0.
% 0.42/0.99 Megabytes=0.12.
% 0.42/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.42/0.99
% 0.42/0.99 ============================== end of statistics =====================
% 0.42/0.99
% 0.42/0.99 ============================== end of search =========================
% 0.42/0.99
% 0.42/0.99 THEOREM PROVED
% 0.42/0.99 % SZS status Unsatisfiable
% 0.42/0.99
% 0.42/0.99 Exiting with 1 proof.
% 0.42/0.99
% 0.42/0.99 Process 17516 exit (max_proofs) Tue Jun 7 14:13:41 2022
% 0.42/0.99 Prover9 interrupted
%------------------------------------------------------------------------------