TSTP Solution File: KRS125+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS125+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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.73s 0.99s
% Output : Refutation 0.73s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS125+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.33 % Computer : n025.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 600
% 0.14/0.33 % DateTime : Tue Jun 7 17:25:19 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.73/0.99 ============================== Prover9 ===============================
% 0.73/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.73/0.99 Process 15823 was started by sandbox2 on n025.cluster.edu,
% 0.73/0.99 Tue Jun 7 17:25:19 2022
% 0.73/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15466_n025.cluster.edu".
% 0.73/0.99 ============================== end of head ===========================
% 0.73/0.99
% 0.73/0.99 ============================== INPUT =================================
% 0.73/0.99
% 0.73/0.99 % Reading from file /tmp/Prover9_15466_n025.cluster.edu
% 0.73/0.99
% 0.73/0.99 set(prolog_style_variables).
% 0.73/0.99 set(auto2).
% 0.73/0.99 % set(auto2) -> set(auto).
% 0.73/0.99 % set(auto) -> set(auto_inference).
% 0.73/0.99 % set(auto) -> set(auto_setup).
% 0.73/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.73/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.73/0.99 % set(auto) -> set(auto_limits).
% 0.73/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.73/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.73/0.99 % set(auto) -> set(auto_denials).
% 0.73/0.99 % set(auto) -> set(auto_process).
% 0.73/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.73/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.73/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.73/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.73/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.73/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.73/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.73/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.73/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.73/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.73/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.73/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.73/0.99 % set(auto2) -> assign(stats, some).
% 0.73/0.99 % set(auto2) -> clear(echo_input).
% 0.73/0.99 % set(auto2) -> set(quiet).
% 0.73/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.73/0.99 % set(auto2) -> clear(print_given).
% 0.73/0.99 assign(lrs_ticks,-1).
% 0.73/0.99 assign(sos_limit,10000).
% 0.73/0.99 assign(order,kbo).
% 0.73/0.99 set(lex_order_vars).
% 0.73/0.99 clear(print_given).
% 0.73/0.99
% 0.73/0.99 % formulas(sos). % not echoed (13 formulas)
% 0.73/0.99
% 0.73/0.99 ============================== end of input ==========================
% 0.73/0.99
% 0.73/0.99 % From the command line: assign(max_seconds, 300).
% 0.73/0.99
% 0.73/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.73/0.99
% 0.73/0.99 % Formulas that are not ordinary clauses:
% 0.73/0.99 1 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 2 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 3 (all X (cUnsatisfiable(X) <-> ce3(X) & cf(X))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 4 (all X (cc(X) -> cdxcomp(X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 5 (all X (cc1(X) -> cd1xcomp(X))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 6 (all X (cc1(X) -> cd1(X))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 7 (all X (cd(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 8 (all X (cdxcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 9 (all X (cd1(X) <-> (exists Y0 ra_Px2(X,Y0)))) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 10 (all X (cd1xcomp(X) <-> -(exists Y ra_Px2(X,Y)))) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 11 (all X (ce3(X) -> cc(X))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 12 (all X (cf(X) -> cd(X))) # 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 13 -cUnsatisfiable(A) | ce3(A) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.73/0.99 14 cUnsatisfiable(i2003_11_14_17_22_17947) # label(axiom_12) # label(axiom). [assumption].
% 0.73/0.99 Derived: ce3(i2003_11_14_17_22_17947). [resolve(13,a,14,a)].
% 0.73/0.99 15 -cUnsatisfiable(A) | cf(A) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.73/0.99 Derived: cf(i2003_11_14_17_22_17947). [resolve(15,a,14,a)].
% 0.73/0.99 16 cUnsatisfiable(A) | -ce3(A) | -cf(A) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.73/0.99 17 -xsd_string(A) | -xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.73/0.99 18 xsd_string(A) | xsd_integer(A) # label(axiom_1) # label(axiom). [clausify(2)].
% 0.73/0.99 19 -cd(A) | -ra_Px1(A,B) # label(axiom_6) # label(axiom). [clausify(7)].
% 0.73/0.99 20 cd(A) | ra_Px1(A,f1(A)) # label(axiom_6) # label(axiom). [clausify(7)].
% 0.73/0.99 Derived: -ra_Px1(A,B) | ra_Px1(A,f1(A)). [resolve(19,a,20,a)].
% 0.73/0.99 21 -cf(A) | cd(A) # label(axiom_11) # label(axiom). [clausify(12)].
% 0.73/0.99 Derived: -cf(A) | -ra_Px1(A,B). [resolve(21,b,19,a)].
% 0.73/0.99 22 -cd1xcomp(A) | -ra_Px2(A,B) # label(axiom_9) # label(axiom). [clausify(10)].
% 0.73/0.99 23 cd1xcomp(A) | ra_Px2(A,f4(A)) # label(axiom_9) # label(axiom). [clausify(10)].
% 0.73/0.99 Derived: -ra_Px2(A,B) | ra_Px2(A,f4(A)). [resolve(22,a,23,a)].
% 0.73/0.99 24 -cc1(A) | cd1xcomp(A) # label(axiom_4) # label(axiom). [clausify(5)].
% 0.73/0.99 Derived: -cc1(A) | -ra_Px2(A,B). [resolve(24,b,22,a)].
% 0.73/0.99 25 -ce3(A) | cc(A) # label(axiom_10) # label(axiom). [clausify(11)].
% 0.73/0.99 26 -cc(A) | cdxcomp(A) # label(axiom_3) # label(axiom). [clausify(4)].
% 0.73/0.99 Derived: -ce3(A) | cdxcomp(A). [resolve(25,b,26,a)].
% 0.73/0.99 27 -cdxcomp(A) | ra_Px1(A,f2(A)) # label(axiom_7) # label(axiom). [clausify(8)].
% 0.73/0.99 28 cdxcomp(A) | -ra_Px1(A,B) # label(axiom_7) # label(axiom). [clausify(8)].
% 0.73/0.99 Derived: ra_Px1(A,f2(A)) | -ra_Px1(A,B). [resolve(27,a,28,a)].
% 0.73/0.99 29 -ce3(A) | cdxcomp(A). [resolve(25,b,26,a)].
% 0.73/0.99 Derived: -ce3(A) | ra_Px1(A,f2(A)). [resolve(29,b,27,a)].
% 0.73/0.99 30 -cd1(A) | ra_Px2(A,f3(A)) # label(axiom_8) # label(axiom). [clausify(9)].
% 0.73/0.99 31 cd1(A) | -ra_Px2(A,B) # label(axiom_8) # label(axiom). [clausify(9)].
% 0.73/0.99 Derived: ra_Px2(A,f3(A)) | -ra_Px2(A,B). [resolve(30,a,31,a)].
% 0.73/0.99 32 -ce3(A) | ra_Px1(A,f2(A)). [resolve(29,b,27,a)].
% 0.73/0.99 33 ce3(i2003_11_14_17_22_17947). [resolve(13,a,14,a)].
% 0.73/0.99 Derived: ra_Px1(i2003_11_14_17_22_17947,f2(i2003_11_14_17_22_17947)). [resolve(32,a,33,a)].
% 0.73/0.99 34 -cf(A) | -ra_Px1(A,B). [resolve(21,b,19,a)].
% 0.73/0.99 35 cf(i2003_11_14_17_22_17947). [resolve(15,a,14,a)].
% 0.73/0.99 Derived: -ra_Px1(i2003_11_14_17_22_17947,A). [resolve(34,a,35,a)].
% 0.73/0.99
% 0.73/0.99 ============================== end predicate elimination =============
% 0.73/0.99
% 0.73/0.99 Auto_denials: (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_22_17947=1. f1=1. f2=1. f3=1. f4=1.
% 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 22.
% 0.73/0.99 % Level of proof is 5.
% 0.73/0.99 % Maximum clause weight is 4.000.
% 0.73/0.99 % Given clauses 0.
% 0.73/0.99
% 0.73/0.99 3 (all X (cUnsatisfiable(X) <-> ce3(X) & cf(X))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 4 (all X (cc(X) -> cdxcomp(X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 7 (all X (cd(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 8 (all X (cdxcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 11 (all X (ce3(X) -> cc(X))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 12 (all X (cf(X) -> cd(X))) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.73/0.99 13 -cUnsatisfiable(A) | ce3(A) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.73/0.99 14 cUnsatisfiable(i2003_11_14_17_22_17947) # label(axiom_12) # label(axiom). [assumption].
% 0.73/0.99 15 -cUnsatisfiable(A) | cf(A) # label(axiom_2) # label(axiom). [clausify(3)].
% 0.73/0.99 19 -cd(A) | -ra_Px1(A,B) # label(axiom_6) # label(axiom). [clausify(7)].
% 0.73/0.99 21 -cf(A) | cd(A) # label(axiom_11) # label(axiom). [clausify(12)].
% 0.73/0.99 25 -ce3(A) | cc(A) # label(axiom_10) # label(axiom). [clausify(11)].
% 0.73/0.99 26 -cc(A) | cdxcomp(A) # label(axiom_3) # label(axiom). [clausify(4)].
% 0.73/0.99 27 -cdxcomp(A) | ra_Px1(A,f2(A)) # label(axiom_7) # label(axiom). [clausify(8)].
% 0.73/0.99 29 -ce3(A) | cdxcomp(A). [resolve(25,b,26,a)].
% 0.73/0.99 32 -ce3(A) | ra_Px1(A,f2(A)). [resolve(29,b,27,a)].
% 0.73/0.99 33 ce3(i2003_11_14_17_22_17947). [resolve(13,a,14,a)].
% 0.73/0.99 34 -cf(A) | -ra_Px1(A,B). [resolve(21,b,19,a)].
% 0.73/0.99 35 cf(i2003_11_14_17_22_17947). [resolve(15,a,14,a)].
% 0.73/0.99 40 ra_Px1(i2003_11_14_17_22_17947,f2(i2003_11_14_17_22_17947)). [resolve(32,a,33,a)].
% 0.73/0.99 41 -ra_Px1(i2003_11_14_17_22_17947,A). [resolve(34,a,35,a)].
% 0.73/0.99 42 $F. [resolve(41,a,40,a)].
% 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=0. Generated=6. Kept=6. proofs=1.
% 0.73/0.99 Usable=0. Sos=0. Demods=0. Limbo=5, Disabled=33. Hints=0.
% 0.73/0.99 Megabytes=0.03.
% 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 15823 exit (max_proofs) Tue Jun 7 17:25:19 2022
% 0.73/0.99 Prover9 interrupted
%------------------------------------------------------------------------------