TSTP Solution File: KRS074+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS074+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:54 EDT 2022
% Result : Unsatisfiable 0.73s 0.99s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS074+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n027.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 7 18:33:10 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.44/0.99 ============================== Prover9 ===============================
% 0.44/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.44/0.99 Process 28488 was started by sandbox on n027.cluster.edu,
% 0.44/0.99 Tue Jun 7 18:33:11 2022
% 0.44/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_28335_n027.cluster.edu".
% 0.44/0.99 ============================== end of head ===========================
% 0.44/0.99
% 0.44/0.99 ============================== INPUT =================================
% 0.44/0.99
% 0.44/0.99 % Reading from file /tmp/Prover9_28335_n027.cluster.edu
% 0.44/0.99
% 0.44/0.99 set(prolog_style_variables).
% 0.44/0.99 set(auto2).
% 0.44/0.99 % set(auto2) -> set(auto).
% 0.44/0.99 % set(auto) -> set(auto_inference).
% 0.44/0.99 % set(auto) -> set(auto_setup).
% 0.44/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.44/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.44/0.99 % set(auto) -> set(auto_limits).
% 0.44/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.44/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.44/0.99 % set(auto) -> set(auto_denials).
% 0.44/0.99 % set(auto) -> set(auto_process).
% 0.44/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.44/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.44/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.44/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.44/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.44/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.44/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.44/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.44/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.44/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.44/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.44/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.44/0.99 % set(auto2) -> assign(stats, some).
% 0.44/0.99 % set(auto2) -> clear(echo_input).
% 0.44/0.99 % set(auto2) -> set(quiet).
% 0.44/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.44/0.99 % set(auto2) -> clear(print_given).
% 0.44/0.99 assign(lrs_ticks,-1).
% 0.44/0.99 assign(sos_limit,10000).
% 0.44/0.99 assign(order,kbo).
% 0.44/0.99 set(lex_order_vars).
% 0.44/0.99 clear(print_given).
% 0.44/0.99
% 0.44/0.99 % formulas(sos). % not echoed (30 formulas)
% 0.44/0.99
% 0.44/0.99 ============================== end of input ==========================
% 0.44/0.99
% 0.44/0.99 % From the command line: assign(max_seconds, 300).
% 0.44/0.99
% 0.44/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.44/0.99
% 0.44/0.99 % Formulas that are not ordinary clauses:
% 0.44/0.99 1 (all A all B (A = B & cUnsatisfiable(A) -> cUnsatisfiable(B))) # label(cUnsatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 2 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 3 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 4 (all A all B (A = B & cp(A) -> cp(B))) # label(cp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 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.44/0.99 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.44/0.99 7 (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.44/0.99 8 (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.44/0.99 9 (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.44/0.99 10 (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.44/0.99 11 (all A all B all C (A = B & rinvF1(A,C) -> rinvF1(B,C))) # label(rinvF1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 12 (all A all B all C (A = B & rinvF1(C,A) -> rinvF1(C,B))) # label(rinvF1_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 13 (all A all B all C (A = B & rinvS(A,C) -> rinvS(B,C))) # label(rinvS_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 14 (all A all B all C (A = B & rinvS(C,A) -> rinvS(C,B))) # label(rinvS_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.44/0.99 15 (all A all B all C (A = B & rs(A,C) -> rs(B,C))) # label(rs_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 16 (all A all B all C (A = B & rs(C,A) -> rs(C,B))) # label(rs_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 17 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 18 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 19 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 20 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 21 (all X (cUnsatisfiable(X) <-> (exists Y (rs(X,Y) & cp(Y) & (exists Z (rinvS(Y,Z) & cp(Z))))) & (all Y (rs(X,Y) -> -cp(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 22 (all X all Y all Z (rf(X,Y) & rf(X,Z) -> Y = Z)) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 23 (all X all Y all Z (rf1(X,Y) & rf1(X,Z) -> Y = Z)) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 24 (all X all Y (rinvF(X,Y) <-> rf(Y,X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 25 (all X all Y (rinvF1(X,Y) <-> rf1(Y,X))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 26 (all X all Y (rinvS(X,Y) <-> rs(Y,X))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 27 (all X all Y all Z (rs(X,Y) & rs(X,Z) -> Y = Z)) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 28 (all X all Y (rs(X,Y) -> rf1(X,Y))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 29 (all X all Y (rs(X,Y) -> rf(X,Y))) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99
% 0.73/0.99 ============================== end of process non-clausal formulas ===
% 0.73/0.99
% 0.73/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.73/0.99
% 0.73/0.99 ============================== PREDICATE ELIMINATION =================
% 0.73/0.99
% 0.73/0.99 ============================== end predicate elimination =============
% 0.73/0.99
% 0.73/0.99 Auto_denials: (non-Horn, no changes).
% 0.73/0.99
% 0.73/0.99 Term ordering decisions:
% 0.73/0.99 Function symbol KB weights: i2003_11_14_17_18_59896=1. f1=1. f2=1. f3=1.
% 0.73/0.99
% 0.73/0.99 ============================== end of process initial clauses ========
% 0.73/0.99
% 0.73/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.73/0.99
% 0.73/0.99 ============================== end of clauses for search =============
% 0.73/0.99
% 0.73/0.99 ============================== SEARCH ================================
% 0.73/0.99
% 0.73/0.99 % Starting search at 0.01 seconds.
% 0.73/0.99
% 0.73/0.99 ============================== PROOF =================================
% 0.73/0.99 % SZS status Unsatisfiable
% 0.73/0.99 % SZS output start Refutation
% 0.73/0.99
% 0.73/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.73/0.99 % Length of proof is 8.
% 0.73/0.99 % Level of proof is 3.
% 0.73/0.99 % Maximum clause weight is 7.000.
% 0.73/0.99 % Given clauses 42.
% 0.73/0.99
% 0.73/0.99 21 (all X (cUnsatisfiable(X) <-> (exists Y (rs(X,Y) & cp(Y) & (exists Z (rinvS(Y,Z) & cp(Z))))) & (all Y (rs(X,Y) -> -cp(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 31 cUnsatisfiable(i2003_11_14_17_18_59896) # label(axiom_9) # label(axiom). [assumption].
% 0.73/0.99 35 -cUnsatisfiable(A) | -rs(A,B) | -cp(B) # label(axiom_2) # label(axiom). [clausify(21)].
% 0.73/0.99 36 -cUnsatisfiable(A) | cp(f1(A)) # label(axiom_2) # label(axiom). [clausify(21)].
% 0.73/0.99 38 -cUnsatisfiable(A) | rs(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(21)].
% 0.73/0.99 73 cp(f1(i2003_11_14_17_18_59896)). [resolve(36,a,31,a)].
% 0.73/0.99 75 rs(i2003_11_14_17_18_59896,f1(i2003_11_14_17_18_59896)). [resolve(38,a,31,a)].
% 0.73/0.99 80 $F. [ur(35,a,31,a,c,73,a),unit_del(a,75)].
% 0.73/0.99
% 0.73/0.99 % SZS output end Refutation
% 0.73/0.99 ============================== end of proof ==========================
% 0.73/0.99
% 0.73/0.99 ============================== STATISTICS ============================
% 0.73/0.99
% 0.73/0.99 Given=42. Generated=55. Kept=48. proofs=1.
% 0.73/0.99 Usable=42. Sos=5. Demods=0. Limbo=1, Disabled=41. Hints=0.
% 0.73/0.99 Megabytes=0.10.
% 0.73/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.73/0.99
% 0.73/0.99 ============================== end of statistics =====================
% 0.73/0.99
% 0.73/0.99 ============================== end of search =========================
% 0.73/0.99
% 0.73/0.99 THEOREM PROVED
% 0.73/0.99 % SZS status Unsatisfiable
% 0.73/0.99
% 0.73/0.99 Exiting with 1 proof.
% 0.73/0.99
% 0.73/0.99 Process 28488 exit (max_proofs) Tue Jun 7 18:33:11 2022
% 0.73/0.99 Prover9 interrupted
%------------------------------------------------------------------------------