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

View Problem - Process Solution

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

% Computer : n014.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:18:07 EDT 2022

% Result   : Unsatisfiable 0.48s 1.03s
% Output   : Refutation 0.48s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SYN323-1 : TPTP v8.1.0. Released v1.2.0.
% 0.12/0.14  % Command  : tptp2X_and_run_prover9 %d %s
% 0.13/0.35  % Computer : n014.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Mon Jul 11 20:26:49 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.48/1.03  ============================== Prover9 ===============================
% 0.48/1.03  Prover9 (32) version 2009-11A, November 2009.
% 0.48/1.03  Process 31266 was started by sandbox on n014.cluster.edu,
% 0.48/1.03  Mon Jul 11 20:26:50 2022
% 0.48/1.03  The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_31112_n014.cluster.edu".
% 0.48/1.03  ============================== end of head ===========================
% 0.48/1.03  
% 0.48/1.03  ============================== INPUT =================================
% 0.48/1.03  
% 0.48/1.03  % Reading from file /tmp/Prover9_31112_n014.cluster.edu
% 0.48/1.03  
% 0.48/1.03  set(prolog_style_variables).
% 0.48/1.03  set(auto2).
% 0.48/1.03      % set(auto2) -> set(auto).
% 0.48/1.03      % set(auto) -> set(auto_inference).
% 0.48/1.03      % set(auto) -> set(auto_setup).
% 0.48/1.03      % set(auto_setup) -> set(predicate_elim).
% 0.48/1.03      % set(auto_setup) -> assign(eq_defs, unfold).
% 0.48/1.03      % set(auto) -> set(auto_limits).
% 0.48/1.03      % set(auto_limits) -> assign(max_weight, "100.000").
% 0.48/1.03      % set(auto_limits) -> assign(sos_limit, 20000).
% 0.48/1.03      % set(auto) -> set(auto_denials).
% 0.48/1.03      % set(auto) -> set(auto_process).
% 0.48/1.03      % set(auto2) -> assign(new_constants, 1).
% 0.48/1.03      % set(auto2) -> assign(fold_denial_max, 3).
% 0.48/1.03      % set(auto2) -> assign(max_weight, "200.000").
% 0.48/1.03      % set(auto2) -> assign(max_hours, 1).
% 0.48/1.03      % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.48/1.03      % set(auto2) -> assign(max_seconds, 0).
% 0.48/1.03      % set(auto2) -> assign(max_minutes, 5).
% 0.48/1.03      % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.48/1.03      % set(auto2) -> set(sort_initial_sos).
% 0.48/1.03      % set(auto2) -> assign(sos_limit, -1).
% 0.48/1.03      % set(auto2) -> assign(lrs_ticks, 3000).
% 0.48/1.03      % set(auto2) -> assign(max_megs, 400).
% 0.48/1.03      % set(auto2) -> assign(stats, some).
% 0.48/1.03      % set(auto2) -> clear(echo_input).
% 0.48/1.03      % set(auto2) -> set(quiet).
% 0.48/1.03      % set(auto2) -> clear(print_initial_clauses).
% 0.48/1.03      % set(auto2) -> clear(print_given).
% 0.48/1.03  assign(lrs_ticks,-1).
% 0.48/1.03  assign(sos_limit,10000).
% 0.48/1.03  assign(order,kbo).
% 0.48/1.03  set(lex_order_vars).
% 0.48/1.03  clear(print_given).
% 0.48/1.03  
% 0.48/1.03  % formulas(sos).  % not echoed (4 formulas)
% 0.48/1.03  
% 0.48/1.03  ============================== end of input ==========================
% 0.48/1.03  
% 0.48/1.03  % From the command line: assign(max_seconds, 300).
% 0.48/1.03  
% 0.48/1.03  ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.48/1.03  
% 0.48/1.03  % Formulas that are not ordinary clauses:
% 0.48/1.03  
% 0.48/1.03  ============================== end of process non-clausal formulas ===
% 0.48/1.03  
% 0.48/1.03  ============================== PROCESS INITIAL CLAUSES ===============
% 0.48/1.03  
% 0.48/1.03  ============================== PREDICATE ELIMINATION =================
% 0.48/1.03  1 -f(a,A) | -g(A,a) # label(clause4) # label(negated_conjecture).  [assumption].
% 0.48/1.03  2 f(A,a) | g(A,a) # label(clause1) # label(negated_conjecture).  [assumption].
% 0.48/1.03  3 -f(a,A) | g(A,a) # label(clause2) # label(negated_conjecture).  [assumption].
% 0.48/1.03  Derived: g(a,a) | g(a,a).  [resolve(3,a,2,a)].
% 0.48/1.03  4 f(A,a) | -g(A,a) # label(clause3) # label(negated_conjecture).  [assumption].
% 0.48/1.03  Derived: -g(a,a) | -g(a,a).  [resolve(4,a,1,a)].
% 0.48/1.03  
% 0.48/1.03  ============================== end predicate elimination =============
% 0.48/1.03  
% 0.48/1.03  Auto_denials:  (non-Horn, no changes).
% 0.48/1.03  
% 0.48/1.03  Term ordering decisions:
% 0.48/1.03  Function symbol KB weights:  a=1.
% 0.48/1.03  
% 0.48/1.03  ============================== PROOF =================================
% 0.48/1.03  % SZS status Unsatisfiable
% 0.48/1.03  % SZS output start Refutation
% 0.48/1.03  
% 0.48/1.03  % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.48/1.03  % Length of proof is 8.
% 0.48/1.03  % Level of proof is 3.
% 0.48/1.03  % Maximum clause weight is 3.000.
% 0.48/1.03  % Given clauses 0.
% 0.48/1.03  
% 0.48/1.03  1 -f(a,A) | -g(A,a) # label(clause4) # label(negated_conjecture).  [assumption].
% 0.48/1.03  2 f(A,a) | g(A,a) # label(clause1) # label(negated_conjecture).  [assumption].
% 0.48/1.03  3 -f(a,A) | g(A,a) # label(clause2) # label(negated_conjecture).  [assumption].
% 0.48/1.03  4 f(A,a) | -g(A,a) # label(clause3) # label(negated_conjecture).  [assumption].
% 0.48/1.03  5 g(a,a) | g(a,a).  [resolve(3,a,2,a)].
% 0.48/1.03  6 g(a,a).  [copy(5),merge(b)].
% 0.48/1.03  7 -g(a,a) | -g(a,a).  [resolve(4,a,1,a)].
% 0.48/1.03  8 $F.  [copy(7),merge(b),unit_del(a,6)].
% 0.48/1.03  
% 0.48/1.03  % SZS output end Refutation
% 0.48/1.03  ============================== end of proof ==========================
% 0.48/1.03  
% 0.48/1.03  ============================== STATISTICS ============================
% 0.48/1.03  
% 0.48/1.03  Given=0. Generated=2. Kept=1. proofs=1.
% 0.48/1.03  Usable=0. Sos=0. Demods=0. Limbo=1, Disabled=6. Hints=0.
% 0.48/1.03  Megabytes=0.01.
% 0.48/1.03  User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.48/1.03  
% 0.48/1.03  ============================== end of statistics =====================
% 0.48/1.03  
% 0.48/1.03  ============================== end of search =========================
% 0.48/1.03  
% 0.48/1.03  THEOREM PROVED
% 0.48/1.03  % SZS status Unsatisfiable
% 0.48/1.03  
% 0.48/1.03  Exiting with 1 proof.
% 0.48/1.03  
% 0.48/1.03  Process 31266 exit (max_proofs) Mon Jul 11 20:26:50 2022
% 0.48/1.03  Prover9 interrupted
%------------------------------------------------------------------------------