TSTP Solution File: KRS127+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS127+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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 1.01s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : KRS127+1 : TPTP v8.1.0. Released v3.1.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jun 7 09:05:37 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/1.00 ============================== Prover9 ===============================
% 0.43/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.00 Process 18217 was started by sandbox2 on n020.cluster.edu,
% 0.43/1.00 Tue Jun 7 09:05:37 2022
% 0.43/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_18063_n020.cluster.edu".
% 0.43/1.00 ============================== end of head ===========================
% 0.43/1.00
% 0.43/1.00 ============================== INPUT =================================
% 0.43/1.00
% 0.43/1.00 % Reading from file /tmp/Prover9_18063_n020.cluster.edu
% 0.43/1.00
% 0.43/1.00 set(prolog_style_variables).
% 0.43/1.00 set(auto2).
% 0.43/1.00 % set(auto2) -> set(auto).
% 0.43/1.00 % set(auto) -> set(auto_inference).
% 0.43/1.00 % set(auto) -> set(auto_setup).
% 0.43/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.00 % set(auto) -> set(auto_limits).
% 0.43/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.00 % set(auto) -> set(auto_denials).
% 0.43/1.00 % set(auto) -> set(auto_process).
% 0.43/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.00 % set(auto2) -> assign(stats, some).
% 0.43/1.00 % set(auto2) -> clear(echo_input).
% 0.43/1.00 % set(auto2) -> set(quiet).
% 0.43/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.00 % set(auto2) -> clear(print_given).
% 0.43/1.00 assign(lrs_ticks,-1).
% 0.43/1.00 assign(sos_limit,10000).
% 0.43/1.00 assign(order,kbo).
% 0.43/1.00 set(lex_order_vars).
% 0.43/1.00 clear(print_given).
% 0.43/1.00
% 0.43/1.00 % formulas(sos). % not echoed (19 formulas)
% 0.43/1.00
% 0.43/1.00 ============================== end of input ==========================
% 0.43/1.00
% 0.43/1.00 % From the command line: assign(max_seconds, 300).
% 0.43/1.00
% 0.43/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.00
% 0.43/1.00 % Formulas that are not ordinary clauses:
% 0.43/1.00 1 (all A all B (A = B & cUnsatisfiable(A) -> cUnsatisfiable(B))) # label(cUnsatisfiable_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 2 (all A all B (A = B & cc(A) -> cc(B))) # label(cc_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 3 (all A all B (A = B & cd(A) -> cd(B))) # label(cd_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 4 (all A all B (A = B & cdxcomp(A) -> cdxcomp(B))) # label(cdxcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 5 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 6 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 7 (all A all B all C (A = B & ra_Px1(A,C) -> ra_Px1(B,C))) # label(ra_Px1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 8 (all A all B all C (A = B & ra_Px1(C,A) -> ra_Px1(C,B))) # label(ra_Px1_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 9 (all A all B all C (A = B & rr(A,C) -> rr(B,C))) # label(rr_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 10 (all A all B all C (A = B & rr(C,A) -> rr(C,B))) # label(rr_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 11 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 12 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 13 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 14 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.00 15 (all X (cUnsatisfiable(X) <-> (exists Y (rr(X,Y) & cc(Y))) & (exists Y (rr(X,Y) & cd(Y))) & (all Y0 all Y1 (rr(X,Y0) & rr(X,Y1) -> Y0 = Y1)))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 16 (all X (cc(X) -> cdxcomp(X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 17 (all X (cd(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 18 (all X (cdxcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01
% 0.43/1.01 ============================== end of process non-clausal formulas ===
% 0.43/1.01
% 0.43/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.01
% 0.43/1.01 ============================== PREDICATE ELIMINATION =================
% 0.43/1.01
% 0.43/1.01 ============================== end predicate elimination =============
% 0.43/1.01
% 0.43/1.01 Auto_denials: (non-Horn, no changes).
% 0.43/1.01
% 0.43/1.01 Term ordering decisions:
% 0.43/1.01 Function symbol KB weights: i2003_11_14_17_22_27794=1. f1=1. f2=1. f3=1. f4=1. f5=1. f6=1.
% 0.43/1.01
% 0.43/1.01 ============================== end of process initial clauses ========
% 0.43/1.01
% 0.43/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.01
% 0.43/1.01 ============================== end of clauses for search =============
% 0.43/1.01
% 0.43/1.01 ============================== SEARCH ================================
% 0.43/1.01
% 0.43/1.01 % Starting search at 0.01 seconds.
% 0.43/1.01
% 0.43/1.01 ============================== PROOF =================================
% 0.43/1.01 % SZS status Unsatisfiable
% 0.43/1.01 % SZS output start Refutation
% 0.43/1.01
% 0.43/1.01 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.43/1.01 % Length of proof is 24.
% 0.43/1.01 % Level of proof is 6.
% 0.43/1.01 % Maximum clause weight is 11.000.
% 0.43/1.01 % Given clauses 41.
% 0.43/1.01
% 0.43/1.01 4 (all A all B (A = B & cdxcomp(A) -> cdxcomp(B))) # label(cdxcomp_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 15 (all X (cUnsatisfiable(X) <-> (exists Y (rr(X,Y) & cc(Y))) & (exists Y (rr(X,Y) & cd(Y))) & (all Y0 all Y1 (rr(X,Y0) & rr(X,Y1) -> Y0 = Y1)))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 16 (all X (cc(X) -> cdxcomp(X))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 17 (all X (cd(X) <-> -(exists Y ra_Px1(X,Y)))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 18 (all X (cdxcomp(X) <-> (exists Y0 ra_Px1(X,Y0)))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.01 20 cUnsatisfiable(i2003_11_14_17_22_27794) # label(axiom_6) # label(axiom). [assumption].
% 0.43/1.01 25 -cd(A) | -ra_Px1(A,B) # label(axiom_4) # label(axiom). [clausify(17)].
% 0.43/1.01 26 -cc(A) | cdxcomp(A) # label(axiom_3) # label(axiom). [clausify(16)].
% 0.43/1.01 27 -cUnsatisfiable(A) | cc(f1(A)) # label(axiom_2) # label(axiom). [clausify(15)].
% 0.43/1.01 28 -cUnsatisfiable(A) | cd(f2(A)) # label(axiom_2) # label(axiom). [clausify(15)].
% 0.43/1.01 30 -cUnsatisfiable(A) | rr(A,f1(A)) # label(axiom_2) # label(axiom). [clausify(15)].
% 0.43/1.01 31 -cUnsatisfiable(A) | rr(A,f2(A)) # label(axiom_2) # label(axiom). [clausify(15)].
% 0.43/1.01 32 -cdxcomp(A) | ra_Px1(A,f6(A)) # label(axiom_5) # label(axiom). [clausify(18)].
% 0.43/1.01 36 A != B | -cdxcomp(B) | cdxcomp(A) # label(cdxcomp_substitution_1) # label(axiom). [clausify(4)].
% 0.43/1.01 45 -cUnsatisfiable(A) | -rr(A,B) | -rr(A,C) | C = B # label(axiom_2) # label(axiom). [clausify(15)].
% 0.43/1.01 52 cc(f1(i2003_11_14_17_22_27794)). [resolve(27,a,20,a)].
% 0.43/1.01 53 cd(f2(i2003_11_14_17_22_27794)). [resolve(28,a,20,a)].
% 0.43/1.01 55 rr(i2003_11_14_17_22_27794,f1(i2003_11_14_17_22_27794)). [resolve(30,a,20,a)].
% 0.43/1.01 56 rr(i2003_11_14_17_22_27794,f2(i2003_11_14_17_22_27794)). [resolve(31,a,20,a)].
% 0.43/1.01 62 cdxcomp(f1(i2003_11_14_17_22_27794)). [resolve(52,a,26,a)].
% 0.43/1.01 64 -ra_Px1(f2(i2003_11_14_17_22_27794),A). [ur(25,a,53,a)].
% 0.43/1.01 75 -cdxcomp(f2(i2003_11_14_17_22_27794)). [ur(32,b,64,a)].
% 0.43/1.01 76 f2(i2003_11_14_17_22_27794) != f1(i2003_11_14_17_22_27794). [ur(36,b,62,a,c,75,a)].
% 0.43/1.01 78 $F. [ur(45,b,55,a,c,56,a,d,76,a),unit_del(a,20)].
% 0.43/1.01
% 0.43/1.01 % SZS output end Refutation
% 0.43/1.01 ============================== end of proof ==========================
% 0.43/1.01
% 0.43/1.01 ============================== STATISTICS ============================
% 0.43/1.01
% 0.43/1.01 Given=41. Generated=91. Kept=57. proofs=1.
% 0.43/1.01 Usable=41. Sos=16. Demods=0. Limbo=0, Disabled=30. Hints=0.
% 0.43/1.01 Megabytes=0.10.
% 0.43/1.01 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.43/1.01
% 0.43/1.01 ============================== end of statistics =====================
% 0.43/1.01
% 0.43/1.01 ============================== end of search =========================
% 0.43/1.01
% 0.43/1.01 THEOREM PROVED
% 0.43/1.01 % SZS status Unsatisfiable
% 0.43/1.01
% 0.43/1.01 Exiting with 1 proof.
% 0.43/1.01
% 0.43/1.01 Process 18217 exit (max_proofs) Tue Jun 7 09:05:37 2022
% 0.43/1.01 Prover9 interrupted
%------------------------------------------------------------------------------