TSTP Solution File: SYN066-1 by Prover9---1109a

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Prover9---1109a
% Problem  : SYN066-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_prover9 %d %s

% Computer : n013.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 : Thu Jul 21 11:16:01 EDT 2022

% Result   : Unsatisfiable 0.71s 0.99s
% Output   : Refutation 0.71s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SYN066-1 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.12  % Command  : tptp2X_and_run_prover9 %d %s
% 0.12/0.33  % Computer : n013.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 : Mon Jul 11 23:56:44 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.71/0.99  ============================== Prover9 ===============================
% 0.71/0.99  Prover9 (32) version 2009-11A, November 2009.
% 0.71/0.99  Process 1477 was started by sandbox on n013.cluster.edu,
% 0.71/0.99  Mon Jul 11 23:56:45 2022
% 0.71/0.99  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_1321_n013.cluster.edu".
% 0.71/0.99  ============================== end of head ===========================
% 0.71/0.99  
% 0.71/0.99  ============================== INPUT =================================
% 0.71/0.99  
% 0.71/0.99  % Reading from file /tmp/Prover9_1321_n013.cluster.edu
% 0.71/0.99  
% 0.71/0.99  set(prolog_style_variables).
% 0.71/0.99  set(auto2).
% 0.71/0.99      % set(auto2) -> set(auto).
% 0.71/0.99      % set(auto) -> set(auto_inference).
% 0.71/0.99      % set(auto) -> set(auto_setup).
% 0.71/0.99      % set(auto_setup) -> set(predicate_elim).
% 0.71/0.99      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/0.99      % set(auto) -> set(auto_limits).
% 0.71/0.99      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/0.99      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/0.99      % set(auto) -> set(auto_denials).
% 0.71/0.99      % set(auto) -> set(auto_process).
% 0.71/0.99      % set(auto2) -> assign(new_constants, 1).
% 0.71/0.99      % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/0.99      % set(auto2) -> assign(max_weight, "200.000").
% 0.71/0.99      % set(auto2) -> assign(max_hours, 1).
% 0.71/0.99      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/0.99      % set(auto2) -> assign(max_seconds, 0).
% 0.71/0.99      % set(auto2) -> assign(max_minutes, 5).
% 0.71/0.99      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/0.99      % set(auto2) -> set(sort_initial_sos).
% 0.71/0.99      % set(auto2) -> assign(sos_limit, -1).
% 0.71/0.99      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/0.99      % set(auto2) -> assign(max_megs, 400).
% 0.71/0.99      % set(auto2) -> assign(stats, some).
% 0.71/0.99      % set(auto2) -> clear(echo_input).
% 0.71/0.99      % set(auto2) -> set(quiet).
% 0.71/0.99      % set(auto2) -> clear(print_initial_clauses).
% 0.71/0.99      % set(auto2) -> clear(print_given).
% 0.71/0.99  assign(lrs_ticks,-1).
% 0.71/0.99  assign(sos_limit,10000).
% 0.71/0.99  assign(order,kbo).
% 0.71/0.99  set(lex_order_vars).
% 0.71/0.99  clear(print_given).
% 0.71/0.99  
% 0.71/0.99  % formulas(sos).  % not echoed (6 formulas)
% 0.71/0.99  
% 0.71/0.99  ============================== end of input ==========================
% 0.71/0.99  
% 0.71/0.99  % From the command line: assign(max_seconds, 300).
% 0.71/0.99  
% 0.71/0.99  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/0.99  
% 0.71/0.99  % Formulas that are not ordinary clauses:
% 0.71/0.99  
% 0.71/0.99  ============================== end of process non-clausal formulas ===
% 0.71/0.99  
% 0.71/0.99  ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/0.99  
% 0.71/0.99  ============================== PREDICATE ELIMINATION =================
% 0.71/0.99  1 -big_q(A,B) | big_r(C,C) # label(clause_5) # label(axiom).  [assumption].
% 0.71/0.99  2 big_p(A,B) | big_q(i(A,B),A) # label(clause_4) # label(axiom).  [assumption].
% 0.71/0.99  Derived: big_r(A,A) | big_p(B,C).  [resolve(1,a,2,b)].
% 0.71/0.99  3 -big_p(f(A,B),g(A)) | big_q(h(A,B),g(A)) # label(clause_3) # label(axiom).  [assumption].
% 0.71/0.99  Derived: -big_p(f(A,B),g(A)) | big_r(C,C).  [resolve(3,b,1,a)].
% 0.71/0.99  4 big_r(A,A) | big_p(B,C).  [resolve(1,a,2,b)].
% 0.71/0.99  5 -big_r(a,A) # label(clause_6) # label(negated_conjecture).  [assumption].
% 0.71/0.99  Derived: big_p(A,B).  [resolve(4,a,5,a)].
% 0.71/0.99  6 -big_p(f(A,B),g(A)) | big_r(C,C).  [resolve(3,b,1,a)].
% 0.71/0.99  Derived: -big_p(f(A,B),g(A)).  [resolve(6,b,5,a)].
% 0.71/0.99  
% 0.71/0.99  ============================== end predicate elimination =============
% 0.71/0.99  
% 0.71/0.99  Auto_denials:  (no changes).
% 0.71/0.99  
% 0.71/0.99  Term ordering decisions:
% 0.71/0.99  
% 0.71/0.99  % Assigning unary symbol g kb_weight 0 and highest precedence (3).
% 0.71/0.99  Function symbol KB weights:  f=1. g=0.
% 0.71/0.99  
% 0.71/0.99  ============================== PROOF =================================
% 0.71/0.99  % SZS status Unsatisfiable
% 0.71/0.99  % SZS output start Refutation
% 0.71/0.99  
% 0.71/0.99  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.71/0.99  % Length of proof is 9.
% 0.71/0.99  % Level of proof is 3.
% 0.71/0.99  % Maximum clause weight is 6.000.
% 0.71/0.99  % Given clauses 0.
% 0.71/0.99  
% 0.71/0.99  1 -big_q(A,B) | big_r(C,C) # label(clause_5) # label(axiom).  [assumption].
% 0.71/0.99  2 big_p(A,B) | big_q(i(A,B),A) # label(clause_4) # label(axiom).  [assumption].
% 0.71/0.99  3 -big_p(f(A,B),g(A)) | big_q(h(A,B),g(A)) # label(clause_3) # label(axiom).  [assumption].
% 0.71/0.99  4 big_r(A,A) | big_p(B,C).  [resolve(1,a,2,b)].
% 0.71/0.99  5 -big_r(a,A) # label(clause_6) # label(negated_conjecture).  [assumption].
% 0.71/0.99  6 -big_p(f(A,B),g(A)) | big_r(C,C).  [resolve(3,b,1,a)].
% 0.71/0.99  9 big_p(A,B).  [resolve(4,a,5,a)].
% 0.71/0.99  10 -big_p(f(A,B),g(A)).  [resolve(6,b,5,a)].
% 0.71/0.99  11 $F.  [resolve(10,a,9,a)].
% 0.71/0.99  
% 0.71/0.99  % SZS output end Refutation
% 0.71/0.99  ============================== end of proof ==========================
% 0.71/0.99  
% 0.71/0.99  ============================== STATISTICS ============================
% 0.71/0.99  
% 0.71/0.99  Given=0. Generated=4. Kept=4. proofs=1.
% 0.71/0.99  Usable=0. Sos=0. Demods=0. Limbo=3, Disabled=10. Hints=0.
% 0.71/0.99  Megabytes=0.02.
% 0.71/0.99  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.71/0.99  
% 0.71/0.99  ============================== end of statistics =====================
% 0.71/0.99  
% 0.71/0.99  ============================== end of search =========================
% 0.71/0.99  
% 0.71/0.99  THEOREM PROVED
% 0.71/0.99  % SZS status Unsatisfiable
% 0.71/0.99  
% 0.71/0.99  Exiting with 1 proof.
% 0.71/0.99  
% 0.71/0.99  Process 1477 exit (max_proofs) Mon Jul 11 23:56:45 2022
% 0.71/0.99  Prover9 interrupted
%------------------------------------------------------------------------------