TSTP Solution File: SWV009-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV009-1 : TPTP v8.1.0. Released v1.0.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 : Wed Jul 20 21:10:12 EDT 2022
% Result : Unsatisfiable 0.72s 1.01s
% Output : Refutation 0.72s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWV009-1 : TPTP v8.1.0. Released v1.0.0.
% 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n017.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 : Wed Jun 15 23:31:10 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.72/1.01 ============================== Prover9 ===============================
% 0.72/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.72/1.01 Process 21506 was started by sandbox2 on n017.cluster.edu,
% 0.72/1.01 Wed Jun 15 23:31:11 2022
% 0.72/1.01 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_21248_n017.cluster.edu".
% 0.72/1.01 ============================== end of head ===========================
% 0.72/1.01
% 0.72/1.01 ============================== INPUT =================================
% 0.72/1.01
% 0.72/1.01 % Reading from file /tmp/Prover9_21248_n017.cluster.edu
% 0.72/1.01
% 0.72/1.01 set(prolog_style_variables).
% 0.72/1.01 set(auto2).
% 0.72/1.01 % set(auto2) -> set(auto).
% 0.72/1.01 % set(auto) -> set(auto_inference).
% 0.72/1.01 % set(auto) -> set(auto_setup).
% 0.72/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.72/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.72/1.01 % set(auto) -> set(auto_limits).
% 0.72/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.72/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.72/1.01 % set(auto) -> set(auto_denials).
% 0.72/1.01 % set(auto) -> set(auto_process).
% 0.72/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.72/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.72/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.72/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.72/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.72/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.72/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.72/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.72/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.72/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.72/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.72/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.72/1.01 % set(auto2) -> assign(stats, some).
% 0.72/1.01 % set(auto2) -> clear(echo_input).
% 0.72/1.01 % set(auto2) -> set(quiet).
% 0.72/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.72/1.01 % set(auto2) -> clear(print_given).
% 0.72/1.01 assign(lrs_ticks,-1).
% 0.72/1.01 assign(sos_limit,10000).
% 0.72/1.01 assign(order,kbo).
% 0.72/1.01 set(lex_order_vars).
% 0.72/1.01 clear(print_given).
% 0.72/1.01
% 0.72/1.01 % formulas(sos). % not echoed (9 formulas)
% 0.72/1.01
% 0.72/1.01 ============================== end of input ==========================
% 0.72/1.01
% 0.72/1.01 % From the command line: assign(max_seconds, 300).
% 0.72/1.01
% 0.72/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.72/1.01
% 0.72/1.01 % Formulas that are not ordinary clauses:
% 0.72/1.01
% 0.72/1.01 ============================== end of process non-clausal formulas ===
% 0.72/1.01
% 0.72/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.72/1.01
% 0.72/1.01 ============================== PREDICATE ELIMINATION =================
% 0.72/1.01
% 0.72/1.01 ============================== end predicate elimination =============
% 0.72/1.01
% 0.72/1.01 Auto_denials: (non-Horn, no changes).
% 0.72/1.01
% 0.72/1.01 Term ordering decisions:
% 0.72/1.01
% 0.72/1.01 % Assigning unary symbol a kb_weight 0 and highest precedence (9).
% 0.72/1.01 Function symbol KB weights: i=1. j=1. m=1. n=1. p=1. q=1. a=0.
% 0.72/1.01
% 0.72/1.01 ============================== end of process initial clauses ========
% 0.72/1.01
% 0.72/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.72/1.01
% 0.72/1.01 ============================== end of clauses for search =============
% 0.72/1.01
% 0.72/1.01 ============================== SEARCH ================================
% 0.72/1.01
% 0.72/1.01 % Starting search at 0.01 seconds.
% 0.72/1.01
% 0.72/1.01 ============================== PROOF =================================
% 0.72/1.01 % SZS status Unsatisfiable
% 0.72/1.01 % SZS output start Refutation
% 0.72/1.01
% 0.72/1.01 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.72/1.01 % Length of proof is 13.
% 0.72/1.01 % Level of proof is 3.
% 0.72/1.01 % Maximum clause weight is 17.000.
% 0.72/1.01 % Given clauses 31.
% 0.72/1.01
% 0.72/1.01 2 less_or_equal(m,p) # label(clause_3) # label(negated_conjecture). [assumption].
% 0.72/1.01 3 less_or_equal(p,q) # label(clause_4) # label(negated_conjecture). [assumption].
% 0.72/1.01 4 less_or_equal(q,n) # label(clause_5) # label(negated_conjecture). [assumption].
% 0.72/1.01 5 less_or_equal(A,B) | less(B,A) # label(clause_1) # label(negated_conjecture). [assumption].
% 0.72/1.01 6 -less_or_equal(a(p),a(q)) # label(clause_9) # label(negated_conjecture). [assumption].
% 0.72/1.01 7 -less_or_equal(m,A) | -less_or_equal(A,B) | -less_or_equal(B,j) | less_or_equal(a(A),a(B)) # label(clause_7) # label(negated_conjecture). [assumption].
% 0.72/1.01 8 -less_or_equal(i,A) | -less_or_equal(A,B) | -less_or_equal(B,n) | less_or_equal(a(A),a(B)) # label(clause_8) # label(negated_conjecture). [assumption].
% 0.72/1.01 9 -less_or_equal(m,A) | -less(A,i) | -less(j,B) | -less_or_equal(B,n) | less_or_equal(a(A),a(B)) # label(clause_6) # label(negated_conjecture). [assumption].
% 0.72/1.01 20 -less_or_equal(q,j). [resolve(7,b,3,a),unit_del(a,2),unit_del(c,6)].
% 0.72/1.01 23 -less_or_equal(i,p). [resolve(8,b,3,a),unit_del(b,4),unit_del(c,6)].
% 0.72/1.01 26 -less_or_equal(m,A) | -less(j,B) | -less_or_equal(B,n) | less_or_equal(a(A),a(B)) | less_or_equal(i,A). [resolve(9,b,5,b)].
% 0.72/1.01 36 -less(j,q). [ur(26,a,2,a,c,4,a,d,6,a,e,23,a)].
% 0.72/1.01 37 $F. [resolve(36,a,5,b),unit_del(a,20)].
% 0.72/1.01
% 0.72/1.01 % SZS output end Refutation
% 0.72/1.01 ============================== end of proof ==========================
% 0.72/1.01
% 0.72/1.01 ============================== STATISTICS ============================
% 0.72/1.01
% 0.72/1.01 Given=31. Generated=50. Kept=36. proofs=1.
% 0.72/1.01 Usable=31. Sos=5. Demods=0. Limbo=0, Disabled=9. Hints=0.
% 0.72/1.01 Megabytes=0.06.
% 0.72/1.01 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.72/1.01
% 0.72/1.01 ============================== end of statistics =====================
% 0.72/1.01
% 0.72/1.01 ============================== end of search =========================
% 0.72/1.01
% 0.72/1.01 THEOREM PROVED
% 0.72/1.01 % SZS status Unsatisfiable
% 0.72/1.01
% 0.72/1.01 Exiting with 1 proof.
% 0.72/1.01
% 0.72/1.01 Process 21506 exit (max_proofs) Wed Jun 15 23:31:11 2022
% 0.72/1.01 Prover9 interrupted
%------------------------------------------------------------------------------