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

View Problem - Process Solution

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

% Computer : n004.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 09:54:07 EDT 2023

% Result   : Satisfiable 2.59s 1.16s
% Output   : Model 2.59s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : NLP008-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13  % Command  : run_iprover %s %d THM
% 0.13/0.34  % Computer : n004.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  : 300
% 0.13/0.34  % DateTime : Thu Aug 24 12:13:23 EDT 2023
% 0.13/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
% 2.59/1.16  % SZS status Started for theBenchmark.p
% 2.59/1.16  % SZS status Satisfiable for theBenchmark.p
% 2.59/1.16  
% 2.59/1.16  %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.59/1.16  
% 2.59/1.16  ------  iProver source info
% 2.59/1.16  
% 2.59/1.16  git: date: 2023-05-31 18:12:56 +0000
% 2.59/1.16  git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.59/1.16  git: non_committed_changes: false
% 2.59/1.16  git: last_make_outside_of_git: false
% 2.59/1.16  
% 2.59/1.16  ------ Parsing...successful
% 2.59/1.16  
% 2.59/1.16  ------  preprocesses with Option_epr_non_horn_eq
% 2.59/1.16  
% 2.59/1.16  
% 2.59/1.16  ------ Preprocessing... sup_sim: 0  sf_s  rm: 1 0s  sf_e  pe_s  pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e  sup_sim: 0  sf_s  rm: 14 0s  sf_e  pe_s  pe_e 
% 2.59/1.16  
% 2.59/1.16  ------ Preprocessing...------  preprocesses with Option_epr_non_horn_eq
% 2.59/1.16   gs_s  sp: 0 0s  gs_e  snvd_s sp: 0 0s snvd_e ------  preprocesses with Option_epr_non_horn_eq
% 2.59/1.16  
% 2.59/1.16  
% 2.59/1.16  ------ Preprocessing... sf_s  rm: 1 0s  sf_e  sf_s  rm: 0 0s  sf_e 
% 2.59/1.16  ------ Proving...
% 2.59/1.16  ------ Problem Properties 
% 2.59/1.16  
% 2.59/1.16  
% 2.59/1.16  clauses                                 31
% 2.59/1.16  conjectures                             29
% 2.59/1.16  EPR                                     31
% 2.59/1.16  Horn                                    21
% 2.59/1.16  unary                                   7
% 2.59/1.16  binary                                  22
% 2.59/1.16  lits                                    80
% 2.59/1.16  lits eq                                 4
% 2.59/1.16  fd_pure                                 0
% 2.59/1.16  fd_pseudo                               0
% 2.59/1.16  fd_cond                                 0
% 2.59/1.16  fd_pseudo_cond                          2
% 2.59/1.16  AC symbols                              0
% 2.59/1.16  
% 2.59/1.16  ------ Schedule EPR non Horn eq is on
% 2.59/1.16  
% 2.59/1.16  ------ Option_epr_non_horn_eq Time Limit: Unbounded
% 2.59/1.16  
% 2.59/1.16  
% 2.59/1.16  ------ 
% 2.59/1.16  Current options:
% 2.59/1.16  ------ 
% 2.59/1.16  
% 2.59/1.16  
% 2.59/1.16  
% 2.59/1.16  
% 2.59/1.16  ------ Proving...
% 2.59/1.16  
% 2.59/1.16  
% 2.59/1.16  % SZS status Satisfiable for theBenchmark.p
% 2.59/1.16  
% 2.59/1.16  ------ Building Model...Done
% 2.59/1.16  
% 2.59/1.16  %------ The model is defined over ground terms (initial term algebra).
% 2.59/1.16  %------ Predicates are defined as (\forall x_1,..,x_n  ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n)))) 
% 2.59/1.16  %------ where \phi is a formula over the term algebra.
% 2.59/1.16  %------ If we have equality in the problem then it is also defined as a predicate above, 
% 2.59/1.16  %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.59/1.16  %------ See help for --sat_out_model for different model outputs.
% 2.59/1.16  %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.59/1.16  %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.59/1.16  % SZS output start Model for theBenchmark.p
% 2.59/1.16  
% 2.59/1.16  %------ Negative definition of equality_sorted 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0_12,X0_1,X1_1] : 
% 2.59/1.16        ( ~(equality_sorted(X0_12,X0_1,X1_1)) <=>
% 2.59/1.16             (
% 2.59/1.16                (
% 2.59/1.16                  ( X0_12=iProver_young_1_$i & X0_13=skc21 )
% 2.59/1.16                 &
% 2.59/1.16                  ( X1_13!=skc21 )
% 2.59/1.16                 &
% 2.59/1.16                  ( X1_13!=skc15 )
% 2.59/1.16                )
% 2.59/1.16  
% 2.59/1.16               | 
% 2.59/1.16                (
% 2.59/1.16                  ( X0_12=iProver_young_1_$i & X0_13=skc21 & X1_13=skc15 )
% 2.59/1.16                )
% 2.59/1.16  
% 2.59/1.16               | 
% 2.59/1.16                (
% 2.59/1.16                  ( X0_12=iProver_young_1_$i & X0_13=skc16 )
% 2.59/1.16                 &
% 2.59/1.16                  ( X1_13!=skc16 )
% 2.59/1.16                 &
% 2.59/1.16                  ( X1_13!=skc15 )
% 2.59/1.16                )
% 2.59/1.16  
% 2.59/1.16               | 
% 2.59/1.16                (
% 2.59/1.16                  ( X0_12=iProver_young_1_$i & X0_13=skc16 & X1_13=skc15 )
% 2.59/1.16                )
% 2.59/1.16  
% 2.59/1.16               | 
% 2.59/1.16                (
% 2.59/1.16                  ( X0_12=iProver_young_1_$i & X0_13=skc15 & X1_13=skc16 )
% 2.59/1.16                )
% 2.59/1.16  
% 2.59/1.16               | 
% 2.59/1.16                (
% 2.59/1.16                  ( X0_12=iProver_young_1_$i & X1_13=skc21 )
% 2.59/1.16                 &
% 2.59/1.16                  ( X0_13!=skc21 )
% 2.59/1.16                )
% 2.59/1.16  
% 2.59/1.16               | 
% 2.59/1.16                (
% 2.59/1.16                  ( X0_12=iProver_young_1_$i & X1_13=skc16 )
% 2.59/1.16                 &
% 2.59/1.16                  ( X0_13!=skc16 )
% 2.59/1.16                )
% 2.59/1.16  
% 2.59/1.16             )
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Positive definition of city 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0] : 
% 2.59/1.16        ( city(X0) <=>
% 2.59/1.16            $false
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Positive definition of event 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0] : 
% 2.59/1.16        ( event(X0) <=>
% 2.59/1.16            $false
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Positive definition of lonely 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0] : 
% 2.59/1.16        ( lonely(X0) <=>
% 2.59/1.16            $false
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Positive definition of chevy 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0] : 
% 2.59/1.16        ( chevy(X0) <=>
% 2.59/1.16            $false
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Negative definition of seat 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0_14] : 
% 2.59/1.16        ( ~(seat(X0_14)) <=>
% 2.59/1.16            $false
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Positive definition of young 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0_13] : 
% 2.59/1.16        ( young(X0_13) <=>
% 2.59/1.16            $true
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Positive definition of fellow 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0_13] : 
% 2.59/1.16        ( fellow(X0_13) <=>
% 2.59/1.16            $true
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Positive definition of old 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0] : 
% 2.59/1.16        ( old(X0) <=>
% 2.59/1.16            $false
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Positive definition of street 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0] : 
% 2.59/1.16        ( street(X0) <=>
% 2.59/1.16            $false
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Negative definition of front 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0_14] : 
% 2.59/1.16        ( ~(front(X0_14)) <=>
% 2.59/1.16            $false
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Positive definition of ssSkC0 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16        ( ssSkC0 <=>
% 2.59/1.16            $true
% 2.59/1.16        )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Positive definition of dirty 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0] : 
% 2.59/1.16        ( dirty(X0) <=>
% 2.59/1.16            $false
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Positive definition of white 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0] : 
% 2.59/1.16        ( white(X0) <=>
% 2.59/1.16            $false
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Positive definition of car 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0] : 
% 2.59/1.16        ( car(X0) <=>
% 2.59/1.16            $false
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Positive definition of way 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0] : 
% 2.59/1.16        ( way(X0) <=>
% 2.59/1.16            $false
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Positive definition of hollywood 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0] : 
% 2.59/1.16        ( hollywood(X0) <=>
% 2.59/1.16            $false
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Negative definition of man 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0_13] : 
% 2.59/1.16        ( ~(man(X0_13)) <=>
% 2.59/1.16             (
% 2.59/1.16                (
% 2.59/1.16                  ( X0_13=skc21 )
% 2.59/1.16                )
% 2.59/1.16  
% 2.59/1.16             )
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Negative definition of furniture 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0_14] : 
% 2.59/1.16        ( ~(furniture(X0_14)) <=>
% 2.59/1.16             (
% 2.59/1.16                (
% 2.59/1.16                  ( X0_14=skc22 )
% 2.59/1.16                )
% 2.59/1.16  
% 2.59/1.16             )
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Positive definition of down 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0,X1] : 
% 2.59/1.16        ( down(X0,X1) <=>
% 2.59/1.16            $false
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Positive definition of barrel 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0,X1] : 
% 2.59/1.16        ( barrel(X0,X1) <=>
% 2.59/1.16            $false
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  
% 2.59/1.16  %------ Positive definition of in 
% 2.59/1.16  fof(lit_def,axiom,
% 2.59/1.16      (! [X0_13,X0_14] : 
% 2.59/1.16        ( in(X0_13,X0_14) <=>
% 2.59/1.16             (
% 2.59/1.16                (
% 2.59/1.16                  ( X0_13=skc21 & X0_14=skc22 )
% 2.59/1.16                )
% 2.59/1.16  
% 2.59/1.16               | 
% 2.59/1.16                (
% 2.59/1.16                  ( X0_13=skc16 & X0_14=skc17 )
% 2.59/1.16                )
% 2.59/1.16  
% 2.59/1.16               | 
% 2.59/1.16                (
% 2.59/1.16                  ( X0_13=skc15 & X0_14=skc18 )
% 2.59/1.16                )
% 2.59/1.16  
% 2.59/1.16               | 
% 2.59/1.16                (
% 2.59/1.16                  ( X0_14=skc18 )
% 2.59/1.16                 &
% 2.59/1.16                  ( X0_13!=skc16 )
% 2.59/1.16                )
% 2.59/1.16  
% 2.59/1.16             )
% 2.59/1.16        )
% 2.59/1.16      )
% 2.59/1.16     ).
% 2.59/1.16  % SZS output end Model for theBenchmark.p
% 2.59/1.16  
%------------------------------------------------------------------------------