TSTP Solution File: SWV002-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SWV002-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n011.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:10 EDT 2022
% Result : Unsatisfiable 0.75s 1.06s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV002-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n011.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 14 14:22:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.75/1.05 ============================== Prover9 ===============================
% 0.75/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.05 Process 1807 was started by sandbox on n011.cluster.edu,
% 0.75/1.05 Tue Jun 14 14:22:50 2022
% 0.75/1.05 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1629_n011.cluster.edu".
% 0.75/1.05 ============================== end of head ===========================
% 0.75/1.05
% 0.75/1.05 ============================== INPUT =================================
% 0.75/1.05
% 0.75/1.05 % Reading from file /tmp/Prover9_1629_n011.cluster.edu
% 0.75/1.05
% 0.75/1.05 set(prolog_style_variables).
% 0.75/1.05 set(auto2).
% 0.75/1.05 % set(auto2) -> set(auto).
% 0.75/1.05 % set(auto) -> set(auto_inference).
% 0.75/1.05 % set(auto) -> set(auto_setup).
% 0.75/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.05 % set(auto) -> set(auto_limits).
% 0.75/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.05 % set(auto) -> set(auto_denials).
% 0.75/1.05 % set(auto) -> set(auto_process).
% 0.75/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.06 % set(auto2) -> assign(stats, some).
% 0.75/1.06 % set(auto2) -> clear(echo_input).
% 0.75/1.06 % set(auto2) -> set(quiet).
% 0.75/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.06 % set(auto2) -> clear(print_given).
% 0.75/1.06 assign(lrs_ticks,-1).
% 0.75/1.06 assign(sos_limit,10000).
% 0.75/1.06 assign(order,kbo).
% 0.75/1.06 set(lex_order_vars).
% 0.75/1.06 clear(print_given).
% 0.75/1.06
% 0.75/1.06 % formulas(sos). % not echoed (23 formulas)
% 0.75/1.06
% 0.75/1.06 ============================== end of input ==========================
% 0.75/1.06
% 0.75/1.06 % From the command line: assign(max_seconds, 300).
% 0.75/1.06
% 0.75/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.06
% 0.75/1.06 % Formulas that are not ordinary clauses:
% 0.75/1.06
% 0.75/1.06 ============================== end of process non-clausal formulas ===
% 0.75/1.06
% 0.75/1.06 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.06
% 0.75/1.06 ============================== PREDICATE ELIMINATION =================
% 0.75/1.06
% 0.75/1.06 ============================== end predicate elimination =============
% 0.75/1.06
% 0.75/1.06 Auto_denials: (non-Horn, no changes).
% 0.75/1.06
% 0.75/1.06 Term ordering decisions:
% 0.75/1.06 Function symbol KB weights: i=1. j=1. k=1. n=1. one=1. q=1. a=1. predecessor=1. successor=1.
% 0.75/1.06
% 0.75/1.06 ============================== end of process initial clauses ========
% 0.75/1.06
% 0.75/1.06 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.06
% 0.75/1.06 ============================== end of clauses for search =============
% 0.75/1.06
% 0.75/1.06 ============================== SEARCH ================================
% 0.75/1.06
% 0.75/1.06 % Starting search at 0.01 seconds.
% 0.75/1.06
% 0.75/1.06 ============================== PROOF =================================
% 0.75/1.06 % SZS status Unsatisfiable
% 0.75/1.06 % SZS output start Refutation
% 0.75/1.06
% 0.75/1.06 % Proof 1 at 0.05 (+ 0.00) seconds.
% 0.75/1.06 % Length of proof is 16.
% 0.75/1.06 % Level of proof is 5.
% 0.75/1.06 % Maximum clause weight is 11.000.
% 0.75/1.06 % Given clauses 122.
% 0.75/1.06
% 0.75/1.06 7 less_than(a(j),a(k)) # label(clause_5) # label(negated_conjecture). [assumption].
% 0.75/1.06 8 less_than(a(q),a(j)) # label(clause_11) # label(negated_conjecture). [assumption].
% 0.75/1.06 9 less_than(A,B) | less_than(B,A) | A = B # label(all_related) # label(axiom). [assumption].
% 0.75/1.06 10 -less_than(A,A) # label(x_not_less_than_x) # label(axiom). [assumption].
% 0.75/1.06 13 -less_than(q,i) # label(clause_9) # label(negated_conjecture). [assumption].
% 0.75/1.06 14 -less_than(j,q) # label(clause_10) # label(negated_conjecture). [assumption].
% 0.75/1.06 19 less_than(A,B) | -less_than(A,C) | -less_than(C,B) # label(transitivity_of_less_than) # label(axiom). [assumption].
% 0.75/1.06 20 less_than(A,B) | C != A | -less_than(C,B) # label(equal_and_less_than_transitivity1) # label(axiom). [assumption].
% 0.75/1.06 22 less_than(A,i) | -less_than(A,j) | -less_than(a(A),a(k)) # label(clause_6) # label(negated_conjecture). [assumption].
% 0.75/1.06 27 less_than(q,j) | q = j. [resolve(14,a,9,b)].
% 0.75/1.06 40 less_than(a(q),A) | -less_than(a(j),A). [resolve(19,b,8,a)].
% 0.75/1.06 77 a(q) != a(j). [ur(20,a,10,a,c,8,a)].
% 0.75/1.06 424 less_than(a(q),a(k)). [resolve(40,b,7,a)].
% 0.75/1.06 447 -less_than(q,j). [resolve(424,a,22,c),unit_del(a,13)].
% 0.75/1.06 456 q = j. [back_unit_del(27),unit_del(a,447)].
% 0.75/1.06 458 $F. [back_rewrite(77),rewrite([456(1)]),xx(a)].
% 0.75/1.06
% 0.75/1.06 % SZS output end Refutation
% 0.75/1.06 ============================== end of proof ==========================
% 0.75/1.06
% 0.75/1.06 ============================== STATISTICS ============================
% 0.75/1.06
% 0.75/1.06 Given=122. Generated=1713. Kept=457. proofs=1.
% 0.75/1.06 Usable=114. Sos=249. Demods=3. Limbo=2, Disabled=115. Hints=0.
% 0.75/1.06 Megabytes=0.30.
% 0.75/1.06 User_CPU=0.05, System_CPU=0.00, Wall_clock=0.
% 0.75/1.06
% 0.75/1.06 ============================== end of statistics =====================
% 0.75/1.06
% 0.75/1.06 ============================== end of search =========================
% 0.75/1.06
% 0.75/1.06 THEOREM PROVED
% 0.75/1.06 % SZS status Unsatisfiable
% 0.75/1.06
% 0.75/1.06 Exiting with 1 proof.
% 0.75/1.06
% 0.75/1.06 Process 1807 exit (max_proofs) Tue Jun 14 14:22:50 2022
% 0.75/1.06 Prover9 interrupted
%------------------------------------------------------------------------------