TSTP Solution File: PUZ049-1 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : PUZ049-1 : TPTP v8.1.2. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% 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  : 300s
% DateTime : Thu Aug 31 13:19:44 EDT 2023

% Result   : Satisfiable 10.83s 2.18s
% Output   : Model 10.83s
% Verified : 
% SZS Type : Derivation
%            Derivation depth      :    0
%            Number of leaves      :    1
% Syntax   : Number of formulae    :    1 (   0 unt;   0 def)
%            Number of atoms       :    2 (   1 equ)
%            Maximal formula atoms :    2 (   2 avg)
%            Number of connectives :    2 (   1   ~;   0   |;   0   &)
%                                         (   1 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (  15 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   0 prp; 2-12 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-2 aty)
%            Number of variables   :   12 (;  12   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
%------ Negative definition of state 
fof(lit_def,axiom,
    ! [X0_13,X0_14,X0_15,X0_16,X0_17,X0_18,X0_19,X0_20,X0_21,X0_22,X0_23,X0_24] :
      ( ~ state(X0_13,X0_14,X0_15,X0_16,X0_17,X0_18,X0_19,X0_20,X0_21,X0_22,X0_23,X0_24)
    <=> X0_13 = bb(s(s(s(o))),s(o)) ) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : PUZ049-1 : TPTP v8.1.2. Released v2.6.0.
% 0.07/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.33  % Computer : n017.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 300
% 0.13/0.34  % DateTime : Sat Aug 26 21:29:11 EDT 2023
% 0.13/0.34  % CPUTime  : 
% 0.19/0.46  Running first-order theorem proving
% 0.19/0.46  Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 10.83/2.18  % SZS status Started for theBenchmark.p
% 10.83/2.18  % SZS status Satisfiable for theBenchmark.p
% 10.83/2.18  
% 10.83/2.18  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 10.83/2.18  
% 10.83/2.18  ------  iProver source info
% 10.83/2.18  
% 10.83/2.18  git: date: 2023-05-31 18:12:56 +0000
% 10.83/2.18  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 10.83/2.18  git: non_committed_changes: false
% 10.83/2.18  git: last_make_outside_of_git: false
% 10.83/2.18  
% 10.83/2.18  ------ Parsing...successful
% 10.83/2.18  
% 10.83/2.18  
% 10.83/2.18  
% 10.83/2.18  ------ Preprocessing... sf_s  rm: 0 0s  sf_e  pe_s  pe_e 
% 10.83/2.18  
% 10.83/2.18  ------ Preprocessing... gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e 
% 10.83/2.18  ------ Proving...
% 10.83/2.18  ------ Problem Properties 
% 10.83/2.18  
% 10.83/2.18  
% 10.83/2.18  clauses                                 43
% 10.83/2.18  conjectures                             1
% 10.83/2.18  EPR                                     0
% 10.83/2.18  Horn                                    43
% 10.83/2.18  unary                                   2
% 10.83/2.18  binary                                  41
% 10.83/2.18  lits                                    84
% 10.83/2.18  lits eq                                 0
% 10.83/2.18  fd_pure                                 0
% 10.83/2.18  fd_pseudo                               0
% 10.83/2.18  fd_cond                                 0
% 10.83/2.18  fd_pseudo_cond                          0
% 10.83/2.18  AC symbols                              0
% 10.83/2.18  
% 10.83/2.18  ------ Input Options Time Limit: Unbounded
% 10.83/2.18  
% 10.83/2.18  
% 10.83/2.18  ------ 
% 10.83/2.18  Current options:
% 10.83/2.18  ------ 
% 10.83/2.18  
% 10.83/2.18  
% 10.83/2.18  
% 10.83/2.18  
% 10.83/2.18  ------ Proving...
% 10.83/2.18  
% 10.83/2.18  
% 10.83/2.18  % SZS status Satisfiable for theBenchmark.p
% 10.83/2.18  
% 10.83/2.18  ------ Building Model...Done
% 10.83/2.18  
% 10.83/2.18  %------ The model is defined over ground terms (initial term algebra).
% 10.83/2.18  %------ Predicates are defined as (\forall x_1,..,x_n  ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) 
% 10.83/2.18  %------ where \phi is a formula over the term algebra.
% 10.83/2.18  %------ If we have equality in the problem then it is also defined as a predicate above, 
% 10.83/2.18  %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 10.83/2.18  %------ See help for --sat_out_model for different model outputs.
% 10.83/2.18  %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 10.83/2.18  %------ where the first argument stands for the sort ($i in the unsorted case)
% 10.83/2.18  % SZS output start Model for theBenchmark.p
% See solution above
% 10.83/2.18  
%------------------------------------------------------------------------------