TSTP Solution File: NLP190+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NLP190+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n002.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:55:59 EDT 2023
% Result : CounterSatisfiable 0.45s 1.15s
% Output : Model 0.45s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of sP14
fof(lit_def,axiom,
( sP14
<=> $false ) ).
%------ Negative definition of behind
fof(lit_def_001,axiom,
! [X0,X1,X2] :
( ~ behind(X0,X1,X2)
<=> $false ) ).
%------ Negative definition of be
fof(lit_def_002,axiom,
! [X0,X1,X2,X3] :
( ~ be(X0,X1,X2,X3)
<=> $false ) ).
%------ Positive definition of state
fof(lit_def_003,axiom,
! [X0,X1] :
( state(X0,X1)
<=> ( ( X0 = sK55
& X1 = sK31(sK55) )
| ( X0 = sK55
& X1 = sK33(sK24(sK55),sK55,sK18(sK55,sK24(sK55),sK29(sK55))) )
| ( X0 = sK55
& X1 = sK33(sK24(sK55),sK55,sK17(sK55,sK29(sK55))) ) ) ) ).
%------ Negative definition of group
fof(lit_def_004,axiom,
! [X0,X1] :
( ~ group(X0,X1)
<=> $false ) ).
%------ Positive definition of sP12
fof(lit_def_005,axiom,
! [X0,X1,X2] :
( sP12(X0,X1,X2)
<=> $false ) ).
%------ Negative definition of two
fof(lit_def_006,axiom,
! [X0,X1] :
( ~ two(X0,X1)
<=> $false ) ).
%------ Negative definition of in
fof(lit_def_007,axiom,
! [X0,X1,X2] :
( ~ in(X0,X1,X2)
<=> $false ) ).
%------ Negative definition of down
fof(lit_def_008,axiom,
! [X0,X1,X2] :
( ~ down(X0,X1,X2)
<=> $false ) ).
%------ Positive definition of barrel
fof(lit_def_009,axiom,
! [X0,X1] :
( barrel(X0,X1)
<=> ( X0 = sK55
& X1 = sK28(sK55) ) ) ).
%------ Negative definition of present
fof(lit_def_010,axiom,
! [X0,X1] :
( ~ present(X0,X1)
<=> $false ) ).
%------ Negative definition of agent
fof(lit_def_011,axiom,
! [X0,X1,X2] :
( ~ agent(X0,X1,X2)
<=> $false ) ).
%------ Negative definition of event
fof(lit_def_012,axiom,
! [X0,X1] :
( ~ event(X0,X1)
<=> $false ) ).
%------ Positive definition of lonely
fof(lit_def_013,axiom,
! [X0,X1] :
( lonely(X0,X1)
<=> ( X0 = sK55
& X1 = sK27(sK55) ) ) ).
%------ Negative definition of street
fof(lit_def_014,axiom,
! [X0,X1] :
( ~ street(X0,X1)
<=> $false ) ).
%------ Positive definition of placename
fof(lit_def_015,axiom,
! [X0,X1] :
( placename(X0,X1)
<=> ( X0 = sK55
& X1 = sK26(sK55) ) ) ).
%------ Negative definition of hollywood_placename
fof(lit_def_016,axiom,
! [X0,X1] :
( ~ hollywood_placename(X0,X1)
<=> $false ) ).
%------ Negative definition of city
fof(lit_def_017,axiom,
! [X0,X1] :
( ~ city(X0,X1)
<=> $false ) ).
%------ Negative definition of of
fof(lit_def_018,axiom,
! [X0,X1,X2] :
( ~ of(X0,X1,X2)
<=> $false ) ).
%------ Positive definition of old
fof(lit_def_019,axiom,
! [X0,X1] :
( old(X0,X1)
<=> ( X0 = sK55
& X1 = sK25(sK55) ) ) ).
%------ Negative definition of dirty
fof(lit_def_020,axiom,
! [X0,X1] :
( ~ dirty(X0,X1)
<=> $false ) ).
%------ Negative definition of white
fof(lit_def_021,axiom,
! [X0,X1] :
( ~ white(X0,X1)
<=> $false ) ).
%------ Negative definition of chevy
fof(lit_def_022,axiom,
! [X0,X1] :
( ~ chevy(X0,X1)
<=> $false ) ).
%------ Positive definition of frontseat
fof(lit_def_023,axiom,
! [X0,X1] :
( frontseat(X0,X1)
<=> ( X0 = sK55
& X1 = sK24(sK55) ) ) ).
%------ Positive definition of wheel
fof(lit_def_024,axiom,
! [X0,X1] :
( wheel(X0,X1)
<=> ( X0 = sK55
& X1 = sK23(sK55) ) ) ).
%------ Positive definition of forename
fof(lit_def_025,axiom,
! [X0,X1] :
( forename(X0,X1)
<=> ( X0 = sK55
& X1 = sK22(sK55) ) ) ).
%------ Negative definition of jules_forename
fof(lit_def_026,axiom,
! [X0,X1] :
( ~ jules_forename(X0,X1)
<=> $false ) ).
%------ Positive definition of man
fof(lit_def_027,axiom,
! [X0,X1] :
( man(X0,X1)
<=> ( X0 = sK55
& X1 = sK21(sK55) ) ) ).
%------ Positive definition of member
fof(lit_def_028,axiom,
! [X0,X1,X2] :
( member(X0,X1,X2)
<=> ( ( X0 = sK55
& X1 = sK17(sK55,sK29(sK55))
& X2 = sK29(sK55) )
| ( X0 = sK55
& X1 = sK18(sK55,sK24(sK55),X2)
& X2 != sK29(sK55) ) ) ) ).
%------ Positive definition of sP5
fof(lit_def_029,axiom,
! [X0,X1,X2] :
( sP5(X0,X1,X2)
<=> $false ) ).
%------ Positive definition of sP0_iProver_split
fof(lit_def_030,axiom,
( sP0_iProver_split
<=> $true ) ).
%------ Positive definition of sP1_iProver_split
fof(lit_def_031,axiom,
( sP1_iProver_split
<=> $false ) ).
%------ Positive definition of sP2_iProver_split
fof(lit_def_032,axiom,
( sP2_iProver_split
<=> $false ) ).
%------ Positive definition of sP3_iProver_split
fof(lit_def_033,axiom,
( sP3_iProver_split
<=> $false ) ).
%------ Positive definition of sP4_iProver_split
fof(lit_def_034,axiom,
( sP4_iProver_split
<=> $false ) ).
%------ Positive definition of sP5_iProver_split
fof(lit_def_035,axiom,
( sP5_iProver_split
<=> $false ) ).
%------ Positive definition of sP6_iProver_split
fof(lit_def_036,axiom,
( sP6_iProver_split
<=> $false ) ).
%------ Positive definition of sP7_iProver_split
fof(lit_def_037,axiom,
( sP7_iProver_split
<=> $false ) ).
%------ Positive definition of sP8_iProver_split
fof(lit_def_038,axiom,
( sP8_iProver_split
<=> $false ) ).
%------ Positive definition of sP9_iProver_split
fof(lit_def_039,axiom,
( sP9_iProver_split
<=> $false ) ).
%------ Positive definition of sP10_iProver_split
fof(lit_def_040,axiom,
( sP10_iProver_split
<=> $false ) ).
%------ Positive definition of sP11_iProver_split
fof(lit_def_041,axiom,
( sP11_iProver_split
<=> $true ) ).
%------ Positive definition of sP12_iProver_split
fof(lit_def_042,axiom,
( sP12_iProver_split
<=> $false ) ).
%------ Positive definition of sP13_iProver_split
fof(lit_def_043,axiom,
( sP13_iProver_split
<=> $false ) ).
%------ Positive definition of sP14_iProver_split
fof(lit_def_044,axiom,
( sP14_iProver_split
<=> $false ) ).
%------ Positive definition of sP15_iProver_split
fof(lit_def_045,axiom,
( sP15_iProver_split
<=> $false ) ).
%------ Positive definition of sP16_iProver_split
fof(lit_def_046,axiom,
( sP16_iProver_split
<=> $false ) ).
%------ Positive definition of sP17_iProver_split
fof(lit_def_047,axiom,
( sP17_iProver_split
<=> $false ) ).
%------ Positive definition of sP18_iProver_split
fof(lit_def_048,axiom,
( sP18_iProver_split
<=> $false ) ).
%------ Positive definition of sP19_iProver_split
fof(lit_def_049,axiom,
( sP19_iProver_split
<=> $false ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : NLP190+1 : TPTP v8.1.2. Released v2.4.0.
% 0.07/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n002.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 10:54:01 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
% 0.45/1.15 % SZS status Started for theBenchmark.p
% 0.45/1.15 % SZS status CounterSatisfiable for theBenchmark.p
% 0.45/1.15
% 0.45/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 0.45/1.15
% 0.45/1.15 ------ iProver source info
% 0.45/1.15
% 0.45/1.15 git: date: 2023-05-31 18:12:56 +0000
% 0.45/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 0.45/1.15 git: non_committed_changes: false
% 0.45/1.15 git: last_make_outside_of_git: false
% 0.45/1.15
% 0.45/1.15 ------ Parsing...
% 0.45/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 0.45/1.15
% 0.45/1.15 ------ 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 sf_s rm: 2 0s sf_e pe_s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 0.45/1.15
% 0.45/1.15 ------ Preprocessing... gs_s sp: 40 0s gs_e snvd_s sp: 0 0s snvd_e
% 0.45/1.15 ------ Proving...
% 0.45/1.15 ------ Problem Properties
% 0.45/1.15
% 0.45/1.15
% 0.45/1.15 clauses 110
% 0.45/1.15 conjectures 0
% 0.45/1.15 EPR 20
% 0.45/1.15 Horn 46
% 0.45/1.15 unary 0
% 0.45/1.15 binary 60
% 0.45/1.15 lits 464
% 0.45/1.15 lits eq 0
% 0.45/1.15 fd_pure 0
% 0.45/1.15 fd_pseudo 0
% 0.45/1.15 fd_cond 0
% 0.45/1.15 fd_pseudo_cond 0
% 0.45/1.15 AC symbols 0
% 0.45/1.15
% 0.45/1.15 ------ Schedule dynamic 5 is on
% 0.45/1.15
% 0.45/1.15 ------ no conjectures: strip conj schedule
% 0.45/1.15
% 0.45/1.15 ------ no equalities: superposition off
% 0.45/1.15
% 0.45/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 0.45/1.15
% 0.45/1.15
% 0.45/1.15 ------
% 0.45/1.15 Current options:
% 0.45/1.15 ------
% 0.45/1.15
% 0.45/1.15
% 0.45/1.15
% 0.45/1.15
% 0.45/1.15 ------ Proving...
% 0.45/1.15
% 0.45/1.15
% 0.45/1.15 % SZS status CounterSatisfiable for theBenchmark.p
% 0.45/1.15
% 0.45/1.15 ------ Building Model...Done
% 0.45/1.15
% 0.45/1.15 %------ The model is defined over ground terms (initial term algebra).
% 0.45/1.15 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 0.45/1.15 %------ where \phi is a formula over the term algebra.
% 0.45/1.15 %------ If we have equality in the problem then it is also defined as a predicate above,
% 0.45/1.15 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 0.45/1.15 %------ See help for --sat_out_model for different model outputs.
% 0.45/1.15 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 0.45/1.15 %------ where the first argument stands for the sort ($i in the unsorted case)
% 0.45/1.15 % SZS output start Model for theBenchmark.p
% See solution above
% 0.45/1.15
%------------------------------------------------------------------------------