TSTP Solution File: SWV007-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV007-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n024.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:10:11 EDT 2022
% Result : Unsatisfiable 0.46s 1.05s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV007-1 : TPTP v8.1.0. Released v1.0.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n024.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 : Wed Jun 15 09:58:18 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.46/1.05 ============================== Prover9 ===============================
% 0.46/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.05 Process 4724 was started by sandbox2 on n024.cluster.edu,
% 0.46/1.05 Wed Jun 15 09:58:19 2022
% 0.46/1.05 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_4362_n024.cluster.edu".
% 0.46/1.05 ============================== end of head ===========================
% 0.46/1.05
% 0.46/1.05 ============================== INPUT =================================
% 0.46/1.05
% 0.46/1.05 % Reading from file /tmp/Prover9_4362_n024.cluster.edu
% 0.46/1.05
% 0.46/1.05 set(prolog_style_variables).
% 0.46/1.05 set(auto2).
% 0.46/1.05 % set(auto2) -> set(auto).
% 0.46/1.05 % set(auto) -> set(auto_inference).
% 0.46/1.05 % set(auto) -> set(auto_setup).
% 0.46/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.05 % set(auto) -> set(auto_limits).
% 0.46/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.05 % set(auto) -> set(auto_denials).
% 0.46/1.05 % set(auto) -> set(auto_process).
% 0.46/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.05 % set(auto2) -> assign(stats, some).
% 0.46/1.05 % set(auto2) -> clear(echo_input).
% 0.46/1.05 % set(auto2) -> set(quiet).
% 0.46/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.05 % set(auto2) -> clear(print_given).
% 0.46/1.05 assign(lrs_ticks,-1).
% 0.46/1.05 assign(sos_limit,10000).
% 0.46/1.05 assign(order,kbo).
% 0.46/1.05 set(lex_order_vars).
% 0.46/1.05 clear(print_given).
% 0.46/1.05
% 0.46/1.05 % formulas(sos). % not echoed (23 formulas)
% 0.46/1.05
% 0.46/1.05 ============================== end of input ==========================
% 0.46/1.05
% 0.46/1.05 % From the command line: assign(max_seconds, 300).
% 0.46/1.05
% 0.46/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.05
% 0.46/1.05 % Formulas that are not ordinary clauses:
% 0.46/1.05
% 0.46/1.05 ============================== end of process non-clausal formulas ===
% 0.46/1.05
% 0.46/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.05
% 0.46/1.05 ============================== PREDICATE ELIMINATION =================
% 0.46/1.05
% 0.46/1.05 ============================== end predicate elimination =============
% 0.46/1.05
% 0.46/1.05 Auto_denials: (non-Horn, no changes).
% 0.46/1.05
% 0.46/1.05 Term ordering decisions:
% 0.46/1.05 Function symbol KB weights: i=1. n=1. k=1. m=1. one=1. a=1. predecessor=1. successor=1.
% 0.46/1.05
% 0.46/1.05 ============================== end of process initial clauses ========
% 0.46/1.05
% 0.46/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.46/1.05
% 0.46/1.05 ============================== end of clauses for search =============
% 0.46/1.05
% 0.46/1.05 ============================== SEARCH ================================
% 0.46/1.05
% 0.46/1.05 % Starting search at 0.01 seconds.
% 0.46/1.05
% 0.46/1.05 ============================== PROOF =================================
% 0.46/1.05 % SZS status Unsatisfiable
% 0.46/1.05 % SZS output start Refutation
% 0.46/1.05
% 0.46/1.05 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.46/1.05 % Length of proof is 14.
% 0.46/1.05 % Level of proof is 3.
% 0.46/1.05 % Maximum clause weight is 12.000.
% 0.46/1.05 % Given clauses 55.
% 0.46/1.05
% 0.46/1.05 2 less_than(i,m) # label(clause_5) # label(negated_conjecture). [assumption].
% 0.46/1.05 4 less_than(A,successor(A)) # label(less_than_successor) # label(axiom). [assumption].
% 0.46/1.05 7 less_than(a(m),a(k)) # label(clause_8) # label(negated_conjecture). [assumption].
% 0.46/1.05 8 less_than(A,B) | less_than(B,A) | A = B # label(all_related) # label(axiom). [assumption].
% 0.46/1.05 12 -less_than(n,m) # label(clause_4) # label(negated_conjecture). [assumption].
% 0.46/1.05 16 -less_than(A,B) | -less_than(B,A) # label(anti_symmetry_of_less_than) # label(axiom). [assumption].
% 0.46/1.05 20 less_than(A,B) | -less_than(A,C) | -less_than(C,B) # label(transitivity_of_less_than) # label(axiom). [assumption].
% 0.46/1.05 22 less_than(A,B) | C != B | -less_than(A,C) # label(equal_and_less_than_transitivity2) # label(axiom). [assumption].
% 0.46/1.05 23 less_than(A,i) | -less_than(A,successor(n)) | -less_than(a(A),a(k)) # label(clause_11) # label(negated_conjecture). [assumption].
% 0.46/1.05 32 -less_than(m,i). [resolve(16,a,2,a)].
% 0.46/1.05 61 -less_than(successor(n),m). [ur(20,a,12,a,b,4,a)].
% 0.46/1.05 90 successor(n) != m. [ur(22,a,12,a,c,4,a)].
% 0.46/1.05 94 -less_than(m,successor(n)). [resolve(23,c,7,a),unit_del(a,32)].
% 0.46/1.05 230 $F. [resolve(61,a,8,b),flip(b),unit_del(a,94),unit_del(b,90)].
% 0.46/1.05
% 0.46/1.05 % SZS output end Refutation
% 0.46/1.05 ============================== end of proof ==========================
% 0.46/1.05
% 0.46/1.05 ============================== STATISTICS ============================
% 0.46/1.05
% 0.46/1.05 Given=55. Generated=582. Kept=228. proofs=1.
% 0.46/1.05 Usable=55. Sos=173. Demods=2. Limbo=0, Disabled=23. Hints=0.
% 0.46/1.05 Megabytes=0.16.
% 0.46/1.05 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.46/1.05
% 0.46/1.05 ============================== end of statistics =====================
% 0.46/1.05
% 0.46/1.05 ============================== end of search =========================
% 0.46/1.05
% 0.46/1.05 THEOREM PROVED
% 0.46/1.05 % SZS status Unsatisfiable
% 0.46/1.05
% 0.46/1.05 Exiting with 1 proof.
% 0.46/1.05
% 0.46/1.05 Process 4724 exit (max_proofs) Wed Jun 15 09:58:19 2022
% 0.46/1.05 Prover9 interrupted
%------------------------------------------------------------------------------