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