TSTP Solution File: KRS128+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS128+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n018.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:25:03 EDT 2022
% Result : Unsatisfiable 0.43s 0.99s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : KRS128+1 : TPTP v8.1.0. Released v3.1.0.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n018.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 13:36:51 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.43/0.98 ============================== Prover9 ===============================
% 0.43/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.98 Process 32215 was started by sandbox on n018.cluster.edu,
% 0.43/0.98 Tue Jun 7 13:36:51 2022
% 0.43/0.98 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_32061_n018.cluster.edu".
% 0.43/0.98 ============================== end of head ===========================
% 0.43/0.98
% 0.43/0.98 ============================== INPUT =================================
% 0.43/0.98
% 0.43/0.98 % Reading from file /tmp/Prover9_32061_n018.cluster.edu
% 0.43/0.98
% 0.43/0.98 set(prolog_style_variables).
% 0.43/0.98 set(auto2).
% 0.43/0.98 % set(auto2) -> set(auto).
% 0.43/0.98 % set(auto) -> set(auto_inference).
% 0.43/0.98 % set(auto) -> set(auto_setup).
% 0.43/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.98 % set(auto) -> set(auto_limits).
% 0.43/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.98 % set(auto) -> set(auto_denials).
% 0.43/0.98 % set(auto) -> set(auto_process).
% 0.43/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.98 % set(auto2) -> assign(stats, some).
% 0.43/0.98 % set(auto2) -> clear(echo_input).
% 0.43/0.98 % set(auto2) -> set(quiet).
% 0.43/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.98 % set(auto2) -> clear(print_given).
% 0.43/0.98 assign(lrs_ticks,-1).
% 0.43/0.98 assign(sos_limit,10000).
% 0.43/0.98 assign(order,kbo).
% 0.43/0.98 set(lex_order_vars).
% 0.43/0.98 clear(print_given).
% 0.43/0.98
% 0.43/0.98 % formulas(sos). % not echoed (12 formulas)
% 0.43/0.98
% 0.43/0.98 ============================== end of input ==========================
% 0.43/0.98
% 0.43/0.98 % From the command line: assign(max_seconds, 300).
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.98
% 0.43/0.98 % Formulas that are not ordinary clauses:
% 0.43/0.98 1 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 2 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 3 (all X (cUnsatisfiable(X) <-> (exists Y (rr(X,Y) & cexcomp(Y))) & (all Y (rr(X,Y) -> cd(Y))) & (all Y (rr(X,Y) -> ca_Cx4(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 4 (all X (cc(X) -> cdxcomp(X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 5 (all X (cd(X) <-> (exists Y0 ra_Px2(X,Y0)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 6 (all X (cdxcomp(X) <-> -(exists Y ra_Px2(X,Y)))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 7 (all X (ce(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 8 (all X (cexcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 9 (all X (ca_Cx4(X) <-> (exists Y0 ra_Px4(X,Y0)))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 10 (all X (ca_Cx4xcomp(X) <-> -(exists Y ra_Px4(X,Y)))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 11 (all X (ca_Cx4xcomp(X) <-> cd(X) & cexcomp(X))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98
% 0.43/0.98 ============================== end of process non-clausal formulas ===
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.98
% 0.43/0.98 ============================== PREDICATE ELIMINATION =================
% 0.43/0.98 12 -cUnsatisfiable(A) | cexcomp(f1(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.43/0.98 13 cUnsatisfiable(i2003_11_14_17_22_31584) # label(axiom_11) # label(axiom). [assumption].
% 0.43/0.98 Derived: cexcomp(f1(i2003_11_14_17_22_31584)). [resolve(12,a,13,a)].
% 0.43/0.98 14 -cUnsatisfiable(A) | rr(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.43/0.98 Derived: rr(i2003_11_14_17_22_31584,f1(i2003_11_14_17_22_31584)). [resolve(14,a,13,a)].
% 0.43/0.98 15 -cUnsatisfiable(A) | -rr(A,B) | cd(B) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.43/0.98 Derived: -rr(i2003_11_14_17_22_31584,A) | cd(A). [resolve(15,a,13,a)].
% 0.43/0.98 16 -cUnsatisfiable(A) | -rr(A,B) | ca_Cx4(B) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.43/0.98 Derived: -rr(i2003_11_14_17_22_31584,A) | ca_Cx4(A). [resolve(16,a,13,a)].
% 0.43/0.98 17 cUnsatisfiable(A) | -rr(A,B) | -cexcomp(B) | -cd(f2(A)) | -ca_Cx4(f3(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.43/0.98 Derived: -rr(A,B) | -cexcomp(B) | -cd(f2(A)) | -ca_Cx4(f3(A)) | cexcomp(f1(A)). [resolve(17,a,12,a)].
% 0.43/0.98 Derived: -rr(A,B) | -cexcomp(B) | -cd(f2(A)) | -ca_Cx4(f3(A)) | rr(A,f1(A)). [resolve(17,a,14,a)].
% 0.43/0.98 Derived: -rr(A,B) | -cexcomp(B) | -cd(f2(A)) | -ca_Cx4(f3(A)) | -rr(A,C) | cd(C). [resolve(17,a,15,a)].
% 0.43/0.98 Derived: -rr(A,B) | -cexcomp(B) | -cd(f2(A)) | -ca_Cx4(f3(A)) | -rr(A,C) | ca_Cx4(C). [resolve(17,a,16,a)].
% 0.43/0.98 18 cUnsatisfiable(A) | -rr(A,B) | -cexcomp(B) | rr(A,f2(A)) | -ca_Cx4(f3(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.43/0.98 Derived: -rr(A,B) | -cexcomp(B) | rr(A,f2(A)) | -ca_Cx4(f3(A)) | cexcomp(f1(A)). [resolve(18,a,12,a)].
% 0.43/0.98 Derived: -rr(A,B) | -cexcomp(B) | rr(A,f2(A)) | -ca_Cx4(f3(A)) | rr(A,f1(A)). [resolve(18,a,14,a)].
% 0.43/0.98 Derived: -rr(A,B) | -cexcomp(B) | rr(A,f2(A)) | -ca_Cx4(f3(A)) | -rr(A,C) | cd(C). [resolve(18,a,15,a)].
% 0.43/0.98 Derived: -rr(A,B) | -cexcomp(B) | rr(A,f2(A)) | -ca_Cx4(f3(A)) | -rr(A,C) | ca_Cx4(C). [resolve(18,a,16,a)].
% 0.43/0.98 19 cUnsatisfiable(A) | -rr(A,B) | -cexcomp(B) | -cd(f2(A)) | rr(A,f3(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.43/0.98 Derived: -rr(A,B) | -cexcomp(B) | -cd(f2(A)) | rr(A,f3(A)) | cexcomp(f1(A)). [resolve(19,a,12,a)].
% 0.43/0.98 Derived: -rr(A,B) | -cexcomp(B) | -cd(f2(A)) | rr(A,f3(A)) | rr(A,f1(A)). [resolve(19,a,14,a)].
% 0.43/0.98 Derived: -rr(A,B) | -cexcomp(B) | -cd(f2(A)) | rr(A,f3(A)) | -rr(A,C) | cd(C). [resolve(19,a,15,a)].
% 0.43/0.98 Derived: -rr(A,B) | -cexcomp(B) | -cd(f2(A)) | rr(A,f3(A)) | -rr(A,C) | ca_Cx4(C). [resolve(19,a,16,a)].
% 0.43/0.98 20 cUnsatisfiable(A) | -rr(A,B) | -cexcomp(B) | rr(A,f2(A)) | rr(A,f3(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.43/0.98 Derived: -rr(A,B) | -cexcomp(B) | rr(A,f2(A)) | rr(A,f3(A)) | cexcomp(f1(A)). [resolve(20,a,12,a)].
% 0.43/0.98 Derived: -rr(A,B) | -cexcomp(B) | rr(A,f2(A)) | rr(A,f3(A)) | rr(A,f1(A)). [resolve(20,a,14,a)].
% 0.43/0.98 Derived: -rr(A,B) | -cexcomp(B) | rr(A,f2(A)) | rr(A,f3(A)) | -rr(A,C) | cd(C). [resolve(20,a,15,a)].
% 0.43/0.98 Derived: -rr(A,B) | -cexcomp(B) | rr(A,f2(A)) | rr(A,f3(A)) | -rr(A,C) | ca_Cx4(C). [resolve(20,a,16,a)].
% 0.43/0.98 21 -xsd_string(A) | -xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.43/0.98 22 xsd_string(A) | xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.43/0.98 23 -cdxcomp(A) | -ra_Px2(A,B) # label(axiom_5) # label(axiom). [clausify(6)].
% 0.43/0.98 24 cdxcomp(A) | ra_Px2(A,f5(A)) # label(axiom_5) # label(axiom). [clausify(6)].
% 0.43/0.98 Derived: -ra_Px2(A,B) | ra_Px2(A,f5(A)). [resolve(23,a,24,a)].
% 0.43/0.98 25 -cc(A) | cdxcomp(A) # label(axiom_3) # label(axiom). [clausify(4)].
% 0.43/0.98 Derived: -cc(A) | -ra_Px2(A,B). [resolve(25,b,23,a)].
% 0.43/0.98 26 -ce(A) | -ra_Px1(A,B) # label(axiom_6) # label(axiom). [clausify(7)].
% 0.43/0.98 27 ce(A) | ra_Px1(A,f6(A)) # label(axiom_6) # label(axiom). [clausify(7)].
% 0.43/0.98 Derived: -ra_Px1(A,B) | ra_Px1(A,f6(A)). [resolve(26,a,27,a)].
% 0.43/0.98 28 -ca_Cx4xcomp(A) | -ra_Px4(A,B) # label(axiom_9) # label(axiom). [clausify(10)].
% 0.43/0.98 29 ca_Cx4xcomp(A) | ra_Px4(A,f9(A)) # label(axiom_9) # label(axiom). [clausify(10)].
% 0.43/0.98 Derived: -ra_Px4(A,B) | ra_Px4(A,f9(A)). [resolve(28,a,29,a)].
% 0.43/0.98 30 -ca_Cx4xcomp(A) | cd(A) # label(axiom_10) # label(axiom). [clausify(11)].
% 0.43/0.98 Derived: cd(A) | ra_Px4(A,f9(A)). [resolve(30,a,29,a)].
% 0.43/0.98 31 -ca_Cx4xcomp(A) | cexcomp(A) # label(axiom_10) # label(axiom). [clausify(11)].
% 0.43/0.98 Derived: cexcomp(A) | ra_Px4(A,f9(A)). [resolve(31,a,29,a)].
% 0.43/0.98 32 ca_Cx4xcomp(A) | -cd(A) | -cexcomp(A) # label(axiom_10) # label(axiom). [clausify(11)].
% 0.43/0.98 Derived: -cd(A) | -cexcomp(A) | -ra_Px4(A,B). [resolve(32,a,28,a)].
% 0.43/0.98
% 0.43/0.98 ============================== end predicate elimination =============
% 0.43/0.98
% 0.43/0.98 Auto_denials: (non-Horn, no changes).
% 0.43/0.98
% 0.43/0.98 Term ordering decisions:
% 0.43/0.98 Function symbol KB weights: i2003_11_14_17_22_31584=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1. f7=1. f8=1. f9=1.
% 0.43/0.99
% 0.43/0.99 ============================== end of process initial clauses ========
% 0.43/0.99
% 0.43/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.99
% 0.43/0.99 ============================== end of clauses for search =============
% 0.43/0.99
% 0.43/0.99 ============================== SEARCH ================================
% 0.43/0.99
% 0.43/0.99 % Starting search at 0.01 seconds.
% 0.43/0.99
% 0.43/0.99 ============================== PROOF =================================
% 0.43/0.99 % SZS status Unsatisfiable
% 0.43/0.99 % SZS output start Refutation
% 0.43/0.99
% 0.43/0.99 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.43/0.99 % Length of proof is 21.
% 0.43/0.99 % Level of proof is 5.
% 0.43/0.99 % Maximum clause weight is 7.000.
% 0.43/0.99 % Given clauses 43.
% 0.43/0.99
% 0.43/0.99 3 (all X (cUnsatisfiable(X) <-> (exists Y (rr(X,Y) & cexcomp(Y))) & (all Y (rr(X,Y) -> cd(Y))) & (all Y (rr(X,Y) -> ca_Cx4(Y))))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 9 (all X (ca_Cx4(X) <-> (exists Y0 ra_Px4(X,Y0)))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 10 (all X (ca_Cx4xcomp(X) <-> -(exists Y ra_Px4(X,Y)))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 11 (all X (ca_Cx4xcomp(X) <-> cd(X) & cexcomp(X))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 12 -cUnsatisfiable(A) | cexcomp(f1(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.43/0.99 13 cUnsatisfiable(i2003_11_14_17_22_31584) # label(axiom_11) # label(axiom). [assumption].
% 0.43/0.99 14 -cUnsatisfiable(A) | rr(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.43/0.99 15 -cUnsatisfiable(A) | -rr(A,B) | cd(B) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.43/0.99 16 -cUnsatisfiable(A) | -rr(A,B) | ca_Cx4(B) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.43/0.99 28 -ca_Cx4xcomp(A) | -ra_Px4(A,B) # label(axiom_9) # label(axiom). [clausify(10)].
% 0.43/0.99 32 ca_Cx4xcomp(A) | -cd(A) | -cexcomp(A) # label(axiom_10) # label(axiom). [clausify(11)].
% 0.43/0.99 38 -ca_Cx4(A) | ra_Px4(A,f8(A)) # label(axiom_8) # label(axiom). [clausify(9)].
% 0.43/0.99 39 cexcomp(f1(i2003_11_14_17_22_31584)). [resolve(12,a,13,a)].
% 0.43/0.99 40 rr(i2003_11_14_17_22_31584,f1(i2003_11_14_17_22_31584)). [resolve(14,a,13,a)].
% 0.43/0.99 41 -rr(i2003_11_14_17_22_31584,A) | cd(A). [resolve(15,a,13,a)].
% 0.43/0.99 42 -rr(i2003_11_14_17_22_31584,A) | ca_Cx4(A). [resolve(16,a,13,a)].
% 0.43/0.99 64 -cd(A) | -cexcomp(A) | -ra_Px4(A,B). [resolve(32,a,28,a)].
% 0.43/0.99 74 cd(f1(i2003_11_14_17_22_31584)). [resolve(41,a,40,a)].
% 0.43/0.99 75 ca_Cx4(f1(i2003_11_14_17_22_31584)). [resolve(42,a,40,a)].
% 0.43/0.99 80 -ra_Px4(f1(i2003_11_14_17_22_31584),A). [ur(64,a,74,a,b,39,a)].
% 0.43/0.99 81 $F. [resolve(75,a,38,a),unit_del(a,80)].
% 0.43/0.99
% 0.43/0.99 % SZS output end Refutation
% 0.43/0.99 ============================== end of proof ==========================
% 0.43/0.99
% 0.43/0.99 ============================== STATISTICS ============================
% 0.43/0.99
% 0.43/0.99 Given=43. Generated=86. Kept=48. proofs=1.
% 0.43/0.99 Usable=43. Sos=5. Demods=0. Limbo=0, Disabled=56. Hints=0.
% 0.43/0.99 Megabytes=0.10.
% 0.43/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.43/0.99
% 0.43/0.99 ============================== end of statistics =====================
% 0.43/0.99
% 0.43/0.99 ============================== end of search =========================
% 0.43/0.99
% 0.43/0.99 THEOREM PROVED
% 0.43/0.99 % SZS status Unsatisfiable
% 0.43/0.99
% 0.43/0.99 Exiting with 1 proof.
% 0.43/0.99
% 0.43/0.99 Process 32215 exit (max_proofs) Tue Jun 7 13:36:51 2022
% 0.43/0.99 Prover9 interrupted
%------------------------------------------------------------------------------