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