TSTP Solution File: SWV490+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV490+3 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n005.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 : Wed Jul 20 21:13:14 EDT 2022
% Result : Timeout 300.05s 300.35s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SWV490+3 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n005.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 : Thu Jun 16 01:21:38 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.76/1.06 ============================== Prover9 ===============================
% 0.76/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.76/1.06 Process 1322 was started by sandbox on n005.cluster.edu,
% 0.76/1.06 Thu Jun 16 01:21:39 2022
% 0.76/1.06 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1167_n005.cluster.edu".
% 0.76/1.06 ============================== end of head ===========================
% 0.76/1.06
% 0.76/1.06 ============================== INPUT =================================
% 0.76/1.06
% 0.76/1.06 % Reading from file /tmp/Prover9_1167_n005.cluster.edu
% 0.76/1.06
% 0.76/1.06 set(prolog_style_variables).
% 0.76/1.06 set(auto2).
% 0.76/1.06 % set(auto2) -> set(auto).
% 0.76/1.06 % set(auto) -> set(auto_inference).
% 0.76/1.06 % set(auto) -> set(auto_setup).
% 0.76/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.76/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.76/1.06 % set(auto) -> set(auto_limits).
% 0.76/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.76/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.76/1.06 % set(auto) -> set(auto_denials).
% 0.76/1.06 % set(auto) -> set(auto_process).
% 0.76/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.76/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.76/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.76/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.76/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.76/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.76/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.76/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.76/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.76/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.76/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.76/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.76/1.06 % set(auto2) -> assign(stats, some).
% 0.76/1.06 % set(auto2) -> clear(echo_input).
% 0.76/1.06 % set(auto2) -> set(quiet).
% 0.76/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.76/1.06 % set(auto2) -> clear(print_given).
% 0.76/1.06 assign(lrs_ticks,-1).
% 0.76/1.06 assign(sos_limit,10000).
% 0.76/1.06 assign(order,kbo).
% 0.76/1.06 set(lex_order_vars).
% 0.76/1.06 clear(print_given).
% 0.76/1.06
% 0.76/1.06 % formulas(sos). % not echoed (13 formulas)
% 0.76/1.06
% 0.76/1.06 ============================== end of input ==========================
% 0.76/1.06
% 0.76/1.06 % From the command line: assign(max_seconds, 300).
% 0.76/1.06
% 0.76/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.76/1.06
% 0.76/1.06 % Formulas that are not ordinary clauses:
% 0.76/1.06 1 (all I all J (int_leq(I,J) <-> int_less(I,J) | I = J)) # label(int_leq) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.06 2 (all I all J all K (int_less(I,J) & int_less(J,K) -> int_less(I,K))) # label(int_less_transitive) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.06 3 (all I all J (int_less(I,J) -> I != J)) # label(int_less_irreflexive) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.06 4 (all I all J (int_less(I,J) | int_leq(J,I))) # label(int_less_total) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.06 5 (all I all J plus(I,J) = plus(J,I)) # label(plus_commutative) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.06 6 (all I plus(I,int_zero) = I) # label(plus_zero) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.06 7 (all I1 all J1 all I2 all J2 (int_less(I1,J1) & int_leq(I2,J2) -> int_leq(plus(I1,I2),plus(J1,J2)))) # label(plus_and_order1) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.06 8 (all I all J (int_less(I,J) <-> (exists K (plus(I,K) = J & int_less(int_zero,K))))) # label(plus_and_inverse) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.06 9 (all I (int_less(int_zero,I) <-> int_leq(int_one,I))) # label(one_successor_of_zero) # label(axiom) # label(non_clause). [assumption].
% 0.76/1.06 10 (all I all J (int_leq(int_one,I) & int_leq(I,n) & int_leq(int_one,J) & int_leq(J,n) -> (all C (int_less(int_zero,C) & I = plus(J,C) -> (all K (int_leq(int_one,K) & int_leq(K,J) -> a(plus(K,C),K) = real_zero)))) & (all K (int_leq(int_one,K) & int_leq(K,J) -> a(K,K) = real_one)) & (all C (int_less(int_zero,C) & J = plus(I,C) -> (all K (int_leq(int_one,K) & int_leq(K,I) -> a(K,plus(K,C)) = real_zero)))))) # label(qii) # label(hypothesis) # label(non_clause). [assumption].
% 0.76/1.06 11 -(all I all J (int_leq(int_one,I) & int_leq(I,n) & int_leq(int_one,J) & int_leq(J,n) -> (I != J -> a(I,J) = real_zero) & (I = J -> a(I,J) != real_zero))) # label(di) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.76/1.06
% 0.76/1.06 ============================== end oCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------