TSTP Solution File: KRS094+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS094+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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:57 EDT 2022
% Result : Unsatisfiable 0.72s 0.99s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : KRS094+1 : TPTP v8.1.0. Released v3.1.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n024.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 7 20:00:19 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.72/0.98 ============================== Prover9 ===============================
% 0.72/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.72/0.98 Process 16194 was started by sandbox on n024.cluster.edu,
% 0.72/0.98 Tue Jun 7 20:00:20 2022
% 0.72/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_16041_n024.cluster.edu".
% 0.72/0.98 ============================== end of head ===========================
% 0.72/0.98
% 0.72/0.98 ============================== INPUT =================================
% 0.72/0.98
% 0.72/0.98 % Reading from file /tmp/Prover9_16041_n024.cluster.edu
% 0.72/0.98
% 0.72/0.98 set(prolog_style_variables).
% 0.72/0.98 set(auto2).
% 0.72/0.98 % set(auto2) -> set(auto).
% 0.72/0.98 % set(auto) -> set(auto_inference).
% 0.72/0.98 % set(auto) -> set(auto_setup).
% 0.72/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.72/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/0.98 % set(auto) -> set(auto_limits).
% 0.72/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/0.98 % set(auto) -> set(auto_denials).
% 0.72/0.98 % set(auto) -> set(auto_process).
% 0.72/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.72/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.72/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.72/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.72/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.72/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.72/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.72/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.72/0.98 % set(auto2) -> assign(stats, some).
% 0.72/0.98 % set(auto2) -> clear(echo_input).
% 0.72/0.98 % set(auto2) -> set(quiet).
% 0.72/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.72/0.98 % set(auto2) -> clear(print_given).
% 0.72/0.98 assign(lrs_ticks,-1).
% 0.72/0.98 assign(sos_limit,10000).
% 0.72/0.98 assign(order,kbo).
% 0.72/0.98 set(lex_order_vars).
% 0.72/0.98 clear(print_given).
% 0.72/0.98
% 0.72/0.98 % formulas(sos). % not echoed (9 formulas)
% 0.72/0.98
% 0.72/0.98 ============================== end of input ==========================
% 0.72/0.98
% 0.72/0.98 % From the command line: assign(max_seconds, 300).
% 0.72/0.98
% 0.72/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/0.98
% 0.72/0.98 % Formulas that are not ordinary clauses:
% 0.72/0.98 1 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.72/0.98 2 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.72/0.98 3 (all X (cUnsatisfiable(X) <-> cc1(X))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.72/0.98 4 (all X (cc(X) -> -cd(X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.72/0.98 5 (all X (cc1(X) -> -cd1(X))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.72/0.98 6 (all X (cc1(X) -> cd1(X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.72/0.98 7 (all X (ce3(X) -> cc(X))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.72/0.98 8 (all X (cf(X) -> cd(X))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.72/0.98
% 0.72/0.98 ============================== end of process non-clausal formulas ===
% 0.72/0.98
% 0.72/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/0.98
% 0.72/0.98 ============================== PREDICATE ELIMINATION =================
% 0.72/0.98 9 -cUnsatisfiable(A) | cc1(A) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.72/0.98 10 cUnsatisfiable(i2003_11_14_17_20_11330) # label(axiom_8) # label(axiom). [assumption].
% 0.72/0.98 Derived: cc1(i2003_11_14_17_20_11330). [resolve(9,a,10,a)].
% 0.72/0.98 11 cUnsatisfiable(A) | -cc1(A) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.72/0.98 12 -xsd_string(A) | -xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.72/0.98 13 xsd_string(A) | xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.72/0.98 14 -ce3(A) | cc(A) # label(axiom_6) # label(axiom). [clausify(7)].
% 0.72/0.98 15 -cc(A) | -cd(A) # label(axiom_3) # label(axiom). [clausify(4)].
% 0.72/0.98 Derived: -ce3(A) | -cd(A). [resolve(14,b,15,a)].
% 0.72/0.98 16 cc1(i2003_11_14_17_20_11330). [resolve(9,a,10,a)].
% 0.72/0.98 17 -cc1(A) | -cd1(A) # label(axiom_4) # label(axiom). [clausify(5)].
% 0.72/0.98 18 -cc1(A) | cd1(A) # label(axiom_5) # label(axiom). [clausify(6)].
% 0.72/0.98 Derived: -cd1(i2003_11_14_17_20_11330). [resolve(16,a,17,a)].
% 0.72/0.98 Derived: cd1(i2003_11_14_17_20_11330). [resolve(16,a,18,a)].
% 0.72/0.99 19 cd1(i2003_11_14_17_20_11330). [resolve(16,a,18,a)].
% 0.72/0.99 20 -cd1(i2003_11_14_17_20_11330). [resolve(16,a,17,a)].
% 0.72/0.99 Derived: $F. [resolve(19,a,20,a)].
% 0.72/0.99
% 0.72/0.99 ============================== end predicate elimination =============
% 0.72/0.99
% 0.72/0.99 Auto_denials: (no changes).
% 0.72/0.99
% 0.72/0.99 Term ordering decisions:
% 0.72/0.99 Function symbol KB weights:
% 0.72/0.99
% 0.72/0.99 ============================== PROOF =================================
% 0.72/0.99 % SZS status Unsatisfiable
% 0.72/0.99 % SZS output start Refutation
% 0.72/0.99
% 0.72/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.72/0.99 % Length of proof is 11.
% 0.72/0.99 % Level of proof is 4.
% 0.72/0.99 % Maximum clause weight is 0.000.
% 0.72/0.99 % Given clauses 0.
% 0.72/0.99
% 0.72/0.99 3 (all X (cUnsatisfiable(X) <-> cc1(X))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.72/0.99 5 (all X (cc1(X) -> -cd1(X))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.72/0.99 6 (all X (cc1(X) -> cd1(X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.72/0.99 9 -cUnsatisfiable(A) | cc1(A) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.72/0.99 10 cUnsatisfiable(i2003_11_14_17_20_11330) # label(axiom_8) # label(axiom). [assumption].
% 0.72/0.99 16 cc1(i2003_11_14_17_20_11330). [resolve(9,a,10,a)].
% 0.72/0.99 17 -cc1(A) | -cd1(A) # label(axiom_4) # label(axiom). [clausify(5)].
% 0.72/0.99 18 -cc1(A) | cd1(A) # label(axiom_5) # label(axiom). [clausify(6)].
% 0.72/0.99 19 cd1(i2003_11_14_17_20_11330). [resolve(16,a,18,a)].
% 0.72/0.99 20 -cd1(i2003_11_14_17_20_11330). [resolve(16,a,17,a)].
% 0.72/0.99 21 $F. [resolve(19,a,20,a)].
% 0.72/0.99
% 0.72/0.99 % SZS output end Refutation
% 0.72/0.99 ============================== end of proof ==========================
% 0.72/0.99
% 0.72/0.99 ============================== STATISTICS ============================
% 0.72/0.99
% 0.72/0.99 Given=0. Generated=1. Kept=0. proofs=1.
% 0.72/0.99 Usable=0. Sos=0. Demods=0. Limbo=0, Disabled=17. Hints=0.
% 0.72/0.99 Megabytes=0.02.
% 0.72/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.72/0.99
% 0.72/0.99 ============================== end of statistics =====================
% 0.72/0.99
% 0.72/0.99 ============================== end of search =========================
% 0.72/0.99
% 0.72/0.99 THEOREM PROVED
% 0.72/0.99 % SZS status Unsatisfiable
% 0.72/0.99
% 0.72/0.99 Exiting with 1 proof.
% 0.72/0.99
% 0.72/0.99 Process 16194 exit (max_proofs) Tue Jun 7 20:00:20 2022
% 0.72/0.99 Prover9 interrupted
%------------------------------------------------------------------------------