TSTP Solution File: LCL655+1.001 by iProver---3.8

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : iProver---3.8
% Problem  : LCL655+1.001 : TPTP v8.1.2. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_iprover %s %d THM

% Computer : n025.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 07:46:48 EDT 2023

% Result   : CounterSatisfiable 3.60s 1.13s
% Output   : Model 3.60s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
%------ Negative definition of r1 
fof(lit_def,axiom,
    ! [X0,X1] :
      ( ~ r1(X0,X1)
    <=> ( ( X0 = sK2
          & X1 = sK3 )
        | ( X0 = sK1
          & X1 = sK7(sK1) )
        | ( X0 = sK3
          & X1 != sK2
          & X1 != sK3
          & X1 != sK7(sK1)
          & X1 != sK7(sK3)
          & X1 != sK6(sK3) )
        | ( X0 = sK3
          & X1 = sK2 )
        | ( X0 = sK3
          & X1 = sK7(sK1) )
        | ( X0 = sK3
          & X1 = sK7(sK3) )
        | ( X0 = sK0
          & X1 = sK3 )
        | ( X0 = sK0
          & X1 = sK7(sK1) )
        | ( X0 = sK7(sK2)
          & X1 = sK3 )
        | ? [X2] :
            ( X0 = sK7(X2)
            & X1 = sK2 )
        | ? [X2] :
            ( X0 = sK7(X2)
            & X1 = sK3 )
        | ( X0 = sK7(sK7(sK1))
          & X1 = sK3 )
        | ( X1 = sK3
          & X0 != sK1
          & X0 != sK3 )
        | ( X1 = sK7(sK1)
          & X0 != sK1
          & X0 != sK7(sK1) ) ) ) ).

%------ Positive definition of p1 
fof(lit_def_001,axiom,
    ! [X0] :
      ( p1(X0)
    <=> ( X0 = sK1
        | X0 = sK3
        | X0 = sK0
        | ? [X1] : X0 = sK6(X1)
        | X0 = sK6(sK3)
        | ? [X1] : X0 = sK9(X1) ) ) ).

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