TSTP Solution File: KRS051+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : KRS051+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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:24:50 EDT 2022
% Result : Timeout 300.04s 300.31s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : KRS051+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n021.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 15:07:36 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.01 ============================== Prover9 ===============================
% 0.42/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.42/1.01 Process 23360 was started by sandbox2 on n021.cluster.edu,
% 0.42/1.01 Tue Jun 7 15:07:37 2022
% 0.42/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_23207_n021.cluster.edu".
% 0.42/1.01 ============================== end of head ===========================
% 0.42/1.01
% 0.42/1.01 ============================== INPUT =================================
% 0.42/1.01
% 0.42/1.01 % Reading from file /tmp/Prover9_23207_n021.cluster.edu
% 0.42/1.01
% 0.42/1.01 set(prolog_style_variables).
% 0.42/1.01 set(auto2).
% 0.42/1.01 % set(auto2) -> set(auto).
% 0.42/1.01 % set(auto) -> set(auto_inference).
% 0.42/1.01 % set(auto) -> set(auto_setup).
% 0.42/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.42/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.42/1.01 % set(auto) -> set(auto_limits).
% 0.42/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.42/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.42/1.01 % set(auto) -> set(auto_denials).
% 0.42/1.01 % set(auto) -> set(auto_process).
% 0.42/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.42/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.42/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.42/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.42/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.42/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.42/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.42/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.42/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.42/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.42/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.42/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.42/1.01 % set(auto2) -> assign(stats, some).
% 0.42/1.01 % set(auto2) -> clear(echo_input).
% 0.42/1.01 % set(auto2) -> set(quiet).
% 0.42/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.42/1.01 % set(auto2) -> clear(print_given).
% 0.42/1.01 assign(lrs_ticks,-1).
% 0.42/1.01 assign(sos_limit,10000).
% 0.42/1.01 assign(order,kbo).
% 0.42/1.01 set(lex_order_vars).
% 0.42/1.01 clear(print_given).
% 0.42/1.01
% 0.42/1.01 % formulas(sos). % not echoed (41 formulas)
% 0.42/1.01
% 0.42/1.01 ============================== end of input ==========================
% 0.42/1.01
% 0.42/1.01 % From the command line: assign(max_seconds, 300).
% 0.42/1.01
% 0.42/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.42/1.01
% 0.42/1.01 % Formulas that are not ordinary clauses:
% 0.42/1.01 1 (all A all B (A = B & ccardinality_N(A) -> ccardinality_N(B))) # label(ccardinality_N_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 2 (all A all B (A = B & ccardinality_N_times_M(A) -> ccardinality_N_times_M(B))) # label(ccardinality_N_times_M_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 3 (all A all B (A = B & conly_d(A) -> conly_d(B))) # label(conly_d_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 4 (all A all B (A = B & cowlNothing(A) -> cowlNothing(B))) # label(cowlNothing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 5 (all A all B (A = B & cowlThing(A) -> cowlThing(B))) # label(cowlThing_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 6 (all A all B all C (A = B & rinvP_1_to_N(A,C) -> rinvP_1_to_N(B,C))) # label(rinvP_1_to_N_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 7 (all A all B all C (A = B & rinvP_1_to_N(C,A) -> rinvP_1_to_N(C,B))) # label(rinvP_1_to_N_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 8 (all A all B all C (A = B & rinvQ_1_to_M(A,C) -> rinvQ_1_to_M(B,C))) # label(rinvQ_1_to_M_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 9 (all A all B all C (A = B & rinvQ_1_to_M(C,A) -> rinvQ_1_to_M(C,B))) # label(rinvQ_1_to_M_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 10 (all A all B all C (A = B & rinvR_N_times_M_to_1(A,C) -> rinvR_N_times_M_to_1(B,C))) # label(rinvR_N_times_M_to_1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 11 (all A all B all C (A = B & rinvR_N_times_M_to_1(C,A) -> rinvR_N_times_M_to_1(C,B))) # label(rinvR_N_times_M_to_1_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 12 (all A all B all C (A = B & rp_N_to_1(A,C) -> rp_N_to_1(B,C))) # label(rp_N_to_1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.01 13 (all A all B all C (A = B & rp_N_to_1(C,A) -> rp_N_to_1(C,B))) # label(rp_N_to_1_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 14 (all A all B all C (A = B & rq_M_to_1(A,C) -> rq_M_to_1(B,C))) # label(rq_M_to_1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 15 (all A all B all C (A = B & rq_M_to_1(C,A) -> rq_M_to_1(C,B))) # label(rq_M_to_1_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 16 (all A all B all C (A = B & rr_N_times_M_to_1(A,C) -> rr_N_times_M_to_1(B,C))) # label(rr_N_times_M_to_1_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 17 (all A all B all C (A = B & rr_N_times_M_to_1(C,A) -> rr_N_times_M_to_1(C,B))) # label(rr_N_times_M_to_1_substitution_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 18 (all A all B (A = B & xsd_integer(A) -> xsd_integer(B))) # label(xsd_integer_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 19 (all A all B (A = B & xsd_string(A) -> xsd_string(B))) # label(xsd_string_substitution_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 20 (all X (cowlThing(X) & -cowlNothing(X))) # label(axiom_0) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 21 (all X (xsd_string(X) <-> -xsd_integer(X))) # label(axiom_1) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 22 (all X (ccardinality_N(X) <-> (exists Y0 exists Y1 exists Y2 (rinvQ_1_to_M(X,Y0) & rinvQ_1_to_M(X,Y1) & rinvQ_1_to_M(X,Y2) & Y0 != Y1 & Y0 != Y2 & Y1 != Y2)) & (all Y0 all Y1 all Y2 all Y3 (rinvQ_1_to_M(X,Y0) & rinvQ_1_to_M(X,Y1) & rinvQ_1_to_M(X,Y2) & rinvQ_1_to_M(X,Y3) -> Y0 = Y1 | Y0 = Y2 | Y0 = Y3 | Y1 = Y2 | Y1 = Y3 | Y2 = Y3)))) # label(axiom_2) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 23 (all X (ccardinality_N(X) <-> (exists Y (rp_N_to_1(X,Y) & conly_d(Y))))) # label(axiom_3) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 24 (all X (ccardinality_N_times_M(X) <-> (exists Y (rr_N_times_M_to_1(X,Y) & conly_d(Y))))) # label(axiom_4) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 25 (all X (ccardinality_N_times_M(X) <-> (exists Y (rq_M_to_1(X,Y) & ccardinality_N(Y))))) # label(axiom_5) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 26 (all X (conly_d(X) <-> (exists Y0 exists Y1 exists Y2 exists Y3 exists Y4 exists Y5 (rinvR_N_times_M_to_1(X,Y0) & rinvR_N_times_M_to_1(X,Y1) & rinvR_N_times_M_to_1(X,Y2) & rinvR_N_times_M_to_1(X,Y3) & rinvR_N_times_M_to_1(X,Y4) & rinvR_N_times_M_to_1(X,Y5) & Y0 != Y1 & Y0 != Y2 & Y0 != Y3 & Y0 != Y4 & Y0 != Y5 & Y1 != Y2 & Y1 != Y3 & Y1 != Y4 & Y1 != Y5 & Y2 != Y3 & Y2 != Y4 & Y2 != Y5 & Y3 != Y4 & Y3 != Y5 & Y4 != Y5)) & (all Y0 all Y1 all Y2 all Y3 all Y4 all Y5 all Y6 (rinvR_N_times_M_to_1(X,Y0) & rinvR_N_times_M_to_1(X,Y1) & rinvR_N_times_M_to_1(X,Y2) & rinvR_N_times_M_to_1(X,Y3) & rinvR_N_times_M_to_1(X,Y4) & rinvR_N_times_M_to_1(X,Y5) & rinvR_N_times_M_to_1(X,Y6) -> Y0 = Y1 | Y0 = Y2 | Y0 = Y3 | Y0 = Y4 | Y0 = Y5 | Y0 = Y6 | Y1 = Y2 | Y1 = Y3 | Y1 = Y4 | Y1 = Y5 | Y1 = Y6 | Y2 = Y3 | Y2 = Y4 | Y2 = Y5 | Y2 = Y6 | Y3 = Y4 | Y3 = Y5 | Y3 = Y6 | Y4 = Y5 | Y4 = Y6 | Y5 = Y6)))) # label(axiom_6) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 27 (all X (conly_d(X) <-> (exists Y0 exists Y1 (rinvP_1_to_N(X,Y0) & rinvP_1_to_N(X,Y1) & Y0 != Y1)) & (all Y0 all Y1 all Y2 (rinvP_1_to_N(X,Y0) & rinvP_1_to_N(X,Y1) & rinvP_1_to_N(X,Y2) -> Y0 = Y1 | Y0 = Y2 | Y1 = Y2)))) # label(axiom_7) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 28 (all X (conly_d(X) <-> X = id)) # label(axiom_8) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 29 (all X all Y all Z (rp_N_to_1(X,Y) & rp_N_to_1(X,Z) -> Y = Z)) # label(axiom_9) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 30 (all X all Y (rp_N_to_1(X,Y) -> ccardinality_N(X))) # label(axiom_10) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 31 (all X all Y (rp_N_to_1(X,Y) -> conly_d(Y))) # label(axiom_11) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 32 (all X all Y (rp_N_to_1(X,Y) <-> rinvP_1_to_N(Y,X))) # label(axiom_12) # label(axiom) # label(non_clause). [assumption].
% 0.42/1.02 33 (all X all Y all Z (rq_M_to_1(X,Y) & rq_M_to_1(X,Z) -> Y = Z)) # label(axiom_13) # label(axiom)Cputime limit exceeded (core dumped)
%------------------------------------------------------------------------------