TSTP Solution File: NLP192+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NLP192+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% 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 : 300s
% DateTime : Thu Aug 31 09:56:00 EDT 2023
% Result : CounterSatisfiable 3.77s 1.16s
% Output : Model 3.77s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of sP14
fof(lit_def,axiom,
( sP14
<=> $false ) ).
%------ Positive definition of actual_world
fof(lit_def_001,axiom,
! [X0_13] :
( actual_world(X0_13)
<=> X0_13 = sK54 ) ).
%------ Negative definition of behind
fof(lit_def_002,axiom,
! [X0_13,X0_17,X0_14] :
( ~ behind(X0_13,X0_17,X0_14)
<=> $false ) ).
%------ Positive definition of be
fof(lit_def_003,axiom,
! [X0_13,X0_16,X0_14,X0_17] :
( be(X0_13,X0_16,X0_14,X0_17)
<=> ( X0_13 = sK54
& X0_16 = sK30(sK54)
& X0_14 = sK21(sK54)
& X0_17 = sK31(sK54) ) ) ).
%------ Positive definition of state
fof(lit_def_004,axiom,
! [X0_13,X0_16] :
( state(X0_13,X0_16)
<=> ( X0_13 = sK54
& X0_16 = sK30(sK54) ) ) ).
%------ Positive definition of coat
fof(lit_def_005,axiom,
! [X0_13,X0_14] :
( coat(X0_13,X0_14)
<=> $false ) ).
%------ Negative definition of group
fof(lit_def_006,axiom,
! [X0_13,X0_15] :
( ~ group(X0_13,X0_15)
<=> $false ) ).
%------ Positive definition of sP12
fof(lit_def_007,axiom,
! [X0_13,X0_15,X1_15] :
( sP12(X0_13,X0_15,X1_15)
<=> $false ) ).
%------ Negative definition of two
fof(lit_def_008,axiom,
! [X0_13,X0_15] :
( ~ two(X0_13,X0_15)
<=> $false ) ).
%------ Negative definition of in
fof(lit_def_009,axiom,
! [X0_13,X0_17,X0_14] :
( ~ in(X0_13,X0_17,X0_14)
<=> $false ) ).
%------ Negative definition of down
fof(lit_def_010,axiom,
! [X0_13,X0_17,X0_14] :
( ~ down(X0_13,X0_17,X0_14)
<=> $false ) ).
%------ Negative definition of barrel
fof(lit_def_011,axiom,
! [X0_13,X0_17] :
( ~ barrel(X0_13,X0_17)
<=> $false ) ).
%------ Negative definition of present
fof(lit_def_012,axiom,
! [X0_13,X0_17] :
( ~ present(X0_13,X0_17)
<=> $false ) ).
%------ Negative definition of agent
fof(lit_def_013,axiom,
! [X0_13,X0_17,X0_14] :
( ~ agent(X0_13,X0_17,X0_14)
<=> $false ) ).
%------ Positive definition of event
fof(lit_def_014,axiom,
! [X0_13,X0_17] :
( event(X0_13,X0_17)
<=> ( X0_13 = sK54
& X0_17 = sK27(sK54) ) ) ).
%------ Negative definition of lonely
fof(lit_def_015,axiom,
! [X0_13,X0_14] :
( ~ lonely(X0_13,X0_14)
<=> $false ) ).
%------ Negative definition of street
fof(lit_def_016,axiom,
! [X0_13,X0_14] :
( ~ street(X0_13,X0_14)
<=> $false ) ).
%------ Negative definition of placename
fof(lit_def_017,axiom,
! [X0_13,X0_18] :
( ~ placename(X0_13,X0_18)
<=> $false ) ).
%------ Positive definition of hollywood_placename
fof(lit_def_018,axiom,
! [X0_13,X0_18] :
( hollywood_placename(X0_13,X0_18)
<=> ( X0_13 = sK54
& X0_18 = sK25(sK54) ) ) ).
%------ Positive definition of city
fof(lit_def_019,axiom,
! [X0_13,X0_14] :
( city(X0_13,X0_14)
<=> ( X0_13 = sK54
& X0_14 = sK26(sK54) ) ) ).
%------ Negative definition of of
fof(lit_def_020,axiom,
! [X0_13,X0_18,X0_14] :
( ~ of(X0_13,X0_18,X0_14)
<=> $false ) ).
%------ Negative definition of old
fof(lit_def_021,axiom,
! [X0_13,X0_14] :
( ~ old(X0_13,X0_14)
<=> $false ) ).
%------ Negative definition of dirty
fof(lit_def_022,axiom,
! [X0_13,X0_14] :
( ~ dirty(X0_13,X0_14)
<=> $false ) ).
%------ Negative definition of white
fof(lit_def_023,axiom,
! [X0_13,X0_14] :
( ~ white(X0_13,X0_14)
<=> $false ) ).
%------ Positive definition of chevy
fof(lit_def_024,axiom,
! [X0_13,X0_14] :
( chevy(X0_13,X0_14)
<=> ( X0_13 = sK54
& X0_14 = sK24(sK54) ) ) ).
%------ Positive definition of frontseat
fof(lit_def_025,axiom,
! [X0_13,X0_14] :
( frontseat(X0_13,X0_14)
<=> ( X0_13 = sK54
& X0_14 = sK23(sK54) ) ) ).
%------ Positive definition of wheel
fof(lit_def_026,axiom,
! [X0_13,X0_14] :
( wheel(X0_13,X0_14)
<=> ( X0_13 = sK54
& X0_14 = sK26(sK54) ) ) ).
%------ Negative definition of forename
fof(lit_def_027,axiom,
! [X0_13,X0_18] :
( ~ forename(X0_13,X0_18)
<=> $false ) ).
%------ Positive definition of jules_forename
fof(lit_def_028,axiom,
! [X0_13,X0_18] :
( jules_forename(X0_13,X0_18)
<=> ( X0_13 = sK54
& X0_18 = sK22(sK54) ) ) ).
%------ Positive definition of man
fof(lit_def_029,axiom,
! [X0_13,X0_14] :
( man(X0_13,X0_14)
<=> ( X0_13 = sK54
& X0_14 = sK21(sK54) ) ) ).
%------ Positive definition of member
fof(lit_def_030,axiom,
! [X0_13,X0_14,X0_15] :
( member(X0_13,X0_14,X0_15)
<=> $false ) ).
%------ Positive definition of sP5
fof(lit_def_031,axiom,
! [X0_13,X0_15,X1_15] :
( sP5(X0_13,X0_15,X1_15)
<=> $false ) ).
%------ Positive definition of sP0_iProver_split
fof(lit_def_032,axiom,
( sP0_iProver_split
<=> $true ) ).
%------ Positive definition of sP1_iProver_split
fof(lit_def_033,axiom,
( sP1_iProver_split
<=> $false ) ).
%------ Positive definition of sP2_iProver_split
fof(lit_def_034,axiom,
( sP2_iProver_split
<=> $false ) ).
%------ Positive definition of sP3_iProver_split
fof(lit_def_035,axiom,
( sP3_iProver_split
<=> $false ) ).
%------ Positive definition of sP4_iProver_split
fof(lit_def_036,axiom,
( sP4_iProver_split
<=> $false ) ).
%------ Positive definition of sP5_iProver_split
fof(lit_def_037,axiom,
( sP5_iProver_split
<=> $false ) ).
%------ Positive definition of sP6_iProver_split
fof(lit_def_038,axiom,
( sP6_iProver_split
<=> $false ) ).
%------ Positive definition of sP7_iProver_split
fof(lit_def_039,axiom,
( sP7_iProver_split
<=> $false ) ).
%------ Positive definition of sP8_iProver_split
fof(lit_def_040,axiom,
( sP8_iProver_split
<=> $false ) ).
%------ Positive definition of sP9_iProver_split
fof(lit_def_041,axiom,
( sP9_iProver_split
<=> $false ) ).
%------ Positive definition of sP10_iProver_split
fof(lit_def_042,axiom,
( sP10_iProver_split
<=> $false ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NLP192+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.13 % Command : run_iprover %s %d THM
% 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 : 300
% 0.12/0.33 % DateTime : Thu Aug 24 12:32:47 EDT 2023
% 0.12/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.77/1.16 % SZS status Started for theBenchmark.p
% 3.77/1.16 % SZS status CounterSatisfiable for theBenchmark.p
% 3.77/1.16
% 3.77/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.77/1.16
% 3.77/1.16 ------ iProver source info
% 3.77/1.16
% 3.77/1.16 git: date: 2023-05-31 18:12:56 +0000
% 3.77/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.77/1.16 git: non_committed_changes: false
% 3.77/1.16 git: last_make_outside_of_git: false
% 3.77/1.16
% 3.77/1.16 ------ Parsing...
% 3.77/1.16 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.77/1.16
% 3.77/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe:16:0s pe_e
% 3.77/1.16
% 3.77/1.16 ------ Preprocessing... gs_s sp: 16 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.77/1.16 ------ Proving...
% 3.77/1.16 ------ Problem Properties
% 3.77/1.16
% 3.77/1.16
% 3.77/1.16 clauses 113
% 3.77/1.16 conjectures 1
% 3.77/1.16 EPR 13
% 3.77/1.16 Horn 52
% 3.77/1.16 unary 0
% 3.77/1.16 binary 62
% 3.77/1.16 lits 685
% 3.77/1.16 lits eq 0
% 3.77/1.16 fd_pure 0
% 3.77/1.16 fd_pseudo 0
% 3.77/1.16 fd_cond 0
% 3.77/1.16 fd_pseudo_cond 0
% 3.77/1.16 AC symbols 0
% 3.77/1.16
% 3.77/1.16 ------ Input Options Time Limit: Unbounded
% 3.77/1.16
% 3.77/1.16
% 3.77/1.16 ------
% 3.77/1.16 Current options:
% 3.77/1.16 ------
% 3.77/1.16
% 3.77/1.16
% 3.77/1.16
% 3.77/1.16
% 3.77/1.16 ------ Proving...
% 3.77/1.16
% 3.77/1.16
% 3.77/1.16 % SZS status CounterSatisfiable for theBenchmark.p
% 3.77/1.16
% 3.77/1.16 ------ Building Model...Done
% 3.77/1.16
% 3.77/1.16 %------ The model is defined over ground terms (initial term algebra).
% 3.77/1.16 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.77/1.16 %------ where \phi is a formula over the term algebra.
% 3.77/1.16 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.77/1.16 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.77/1.16 %------ See help for --sat_out_model for different model outputs.
% 3.77/1.16 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.77/1.16 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.77/1.16 % SZS output start Model for theBenchmark.p
% See solution above
% 3.77/1.16
%------------------------------------------------------------------------------