TSTP Solution File: NLP230-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NLP230-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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:23 EDT 2023
% Result : Satisfiable 2.14s 1.15s
% Output : Model 2.14s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of ssSkC0
fof(lit_def,axiom,
( ssSkC0
<=> $false ) ).
%------ Positive definition of proposition
fof(lit_def_001,axiom,
! [X0,X1] :
( proposition(X0,X1)
<=> ( ( X0 = skc46
& X1 = skc57 )
| ( X0 = skc46
& X1 = skc47 ) ) ) ).
%------ Negative definition of accessible_world
fof(lit_def_002,axiom,
! [X0,X1] :
( ~ accessible_world(X0,X1)
<=> $false ) ).
%------ Positive definition of think_believe_consider
fof(lit_def_003,axiom,
! [X0,X1] :
( think_believe_consider(X0,X1)
<=> ( ( X0 = skc46
& X1 = skc58 )
| ( X0 = skc46
& X1 = skc48 ) ) ) ).
%------ Negative definition of present
fof(lit_def_004,axiom,
! [X0,X1] :
( ~ present(X0,X1)
<=> $false ) ).
%------ Negative definition of event
fof(lit_def_005,axiom,
! [X0,X1] :
( ~ event(X0,X1)
<=> $false ) ).
%------ Positive definition of vincent_forename
fof(lit_def_006,axiom,
! [X0,X1] :
( vincent_forename(X0,X1)
<=> ( ( X0 = skc46
& X1 = skc59 )
| ( X0 = skc46
& X1 = skc49 ) ) ) ).
%------ Negative definition of forename
fof(lit_def_007,axiom,
! [X0,X1] :
( ~ forename(X0,X1)
<=> $false ) ).
%------ Positive definition of man
fof(lit_def_008,axiom,
! [X0,X1] :
( man(X0,X1)
<=> ( ( X0 = skc46
& X1 = skc60 )
| ( X0 = skc46
& X1 = skc55 )
| ( X0 = skc46
& X1 = skc52 )
| ( X0 = skc46
& X1 = skc50 ) ) ) ).
%------ Positive definition of jules_forename
fof(lit_def_009,axiom,
! [X0,X1] :
( jules_forename(X0,X1)
<=> ( ( X0 = skc46
& X1 = skc56 )
| ( X0 = skc46
& X1 = skc51 ) ) ) ).
%------ Negative definition of smoke
fof(lit_def_010,axiom,
! [X0,X1] :
( ~ smoke(X0,X1)
<=> $false ) ).
%------ Positive definition of theme
fof(lit_def_011,axiom,
! [X0,X1,X2] :
( theme(X0,X1,X2)
<=> ( ( X0 = skc46
& X1 = skc58
& X2 = skc57 )
| ( X0 = skc46
& X1 = skc48
& X2 = skc47 ) ) ) ).
%------ Positive definition of agent
fof(lit_def_012,axiom,
! [X0,X1,X2] :
( agent(X0,X1,X2)
<=> ( ( X0 = skc46
& X1 = skc58
& X2 = skc60 )
| ( X0 = skc46
& X1 = skc48
& X2 = skc50 )
| ( X0 = skc47
& X1 = skc53
& X2 = skc52 ) ) ) ).
%------ Positive definition of of
fof(lit_def_013,axiom,
! [X0,X1,X2] :
( of(X0,X1,X2)
<=> ( ( X0 = skc46
& X1 = skc59
& X2 = skc60 )
| ( X0 = skc46
& X1 = skc56
& X2 = skc55 )
| ( X0 = skc46
& X1 = skc51
& X2 = skc52 )
| ( X0 = skc46
& X1 = skc49
& X2 = skc50 ) ) ) ).
%------ Positive definition of sP0_iProver_split
fof(lit_def_014,axiom,
( sP0_iProver_split
<=> $false ) ).
%------ Positive definition of sP1_iProver_split
fof(lit_def_015,axiom,
( sP1_iProver_split
<=> $false ) ).
%------ Positive definition of sP2_iProver_split
fof(lit_def_016,axiom,
( sP2_iProver_split
<=> $false ) ).
%------ Positive definition of sP3_iProver_split
fof(lit_def_017,axiom,
( sP3_iProver_split
<=> $false ) ).
%------ Positive definition of sP4_iProver_split
fof(lit_def_018,axiom,
( sP4_iProver_split
<=> $false ) ).
%------ Positive definition of sP5_iProver_split
fof(lit_def_019,axiom,
( sP5_iProver_split
<=> $true ) ).
%------ Positive definition of sP6_iProver_split
fof(lit_def_020,axiom,
( sP6_iProver_split
<=> $false ) ).
%------ Positive definition of sP7_iProver_split
fof(lit_def_021,axiom,
( sP7_iProver_split
<=> $false ) ).
%------ Positive definition of sP8_iProver_split
fof(lit_def_022,axiom,
( sP8_iProver_split
<=> $false ) ).
%------ Positive definition of sP9_iProver_split
fof(lit_def_023,axiom,
( sP9_iProver_split
<=> $false ) ).
%------ Positive definition of sP10_iProver_split
fof(lit_def_024,axiom,
( sP10_iProver_split
<=> $false ) ).
%------ Positive definition of sP11_iProver_split
fof(lit_def_025,axiom,
( sP11_iProver_split
<=> $false ) ).
%------ Positive definition of sP12_iProver_split
fof(lit_def_026,axiom,
( sP12_iProver_split
<=> $false ) ).
%------ Positive definition of sP13_iProver_split
fof(lit_def_027,axiom,
( sP13_iProver_split
<=> $false ) ).
%------ Positive definition of sP14_iProver_split
fof(lit_def_028,axiom,
( sP14_iProver_split
<=> $true ) ).
%------ Positive definition of sP15_iProver_split
fof(lit_def_029,axiom,
( sP15_iProver_split
<=> $false ) ).
%------ Positive definition of sP16_iProver_split
fof(lit_def_030,axiom,
( sP16_iProver_split
<=> $false ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NLP230-1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n011.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:51:07 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 2.14/1.15 % SZS status Started for theBenchmark.p
% 2.14/1.15 % SZS status Satisfiable for theBenchmark.p
% 2.14/1.15
% 2.14/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 2.14/1.15
% 2.14/1.15 ------ iProver source info
% 2.14/1.15
% 2.14/1.15 git: date: 2023-05-31 18:12:56 +0000
% 2.14/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 2.14/1.15 git: non_committed_changes: false
% 2.14/1.15 git: last_make_outside_of_git: false
% 2.14/1.15
% 2.14/1.15 ------ Parsing...successful
% 2.14/1.15
% 2.14/1.15
% 2.14/1.15
% 2.14/1.15 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 2.14/1.15
% 2.14/1.15 ------ Preprocessing... gs_s sp: 24 0s gs_e snvd_s sp: 0 0s snvd_e
% 2.14/1.15 ------ Proving...
% 2.14/1.15 ------ Problem Properties
% 2.14/1.15
% 2.14/1.15
% 2.14/1.15 clauses 96
% 2.14/1.15 conjectures 83
% 2.14/1.15 EPR 84
% 2.14/1.15 Horn 51
% 2.14/1.15 unary 0
% 2.14/1.15 binary 75
% 2.14/1.15 lits 315
% 2.14/1.15 lits eq 0
% 2.14/1.15 fd_pure 0
% 2.14/1.15 fd_pseudo 0
% 2.14/1.15 fd_cond 0
% 2.14/1.15 fd_pseudo_cond 0
% 2.14/1.15 AC symbols 0
% 2.14/1.15
% 2.14/1.15 ------ Schedule dynamic 5 is on
% 2.14/1.15
% 2.14/1.15 ------ no equalities: superposition off
% 2.14/1.15
% 2.14/1.15 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 2.14/1.15
% 2.14/1.15
% 2.14/1.15 ------
% 2.14/1.15 Current options:
% 2.14/1.15 ------
% 2.14/1.15
% 2.14/1.15
% 2.14/1.15
% 2.14/1.15
% 2.14/1.15 ------ Proving...
% 2.14/1.15
% 2.14/1.15
% 2.14/1.15 % SZS status Satisfiable for theBenchmark.p
% 2.14/1.15
% 2.14/1.15 ------ Building Model...Done
% 2.14/1.15
% 2.14/1.15 %------ The model is defined over ground terms (initial term algebra).
% 2.14/1.15 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 2.14/1.15 %------ where \phi is a formula over the term algebra.
% 2.14/1.15 %------ If we have equality in the problem then it is also defined as a predicate above,
% 2.14/1.15 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 2.14/1.15 %------ See help for --sat_out_model for different model outputs.
% 2.14/1.15 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 2.14/1.15 %------ where the first argument stands for the sort ($i in the unsorted case)
% 2.14/1.15 % SZS output start Model for theBenchmark.p
% See solution above
% 2.14/1.15
%------------------------------------------------------------------------------