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 : n028.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 : CounterSatisfiable 3.89s 1.14s
% Output : Model 3.89s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of smoke
fof(lit_def,axiom,
! [X0,X1] :
( smoke(X0,X1)
<=> ( ( X0 = sK20(sK39)
& X1 = sK21(sK20(sK39),sK10(sK39)) )
| ( X0 = sK35(sK8)
& X1 = sK36(sK35(sK8),sK25(sK8)) ) ) ) ).
%------ Negative definition of present
fof(lit_def_001,axiom,
! [X0,X1] :
( ~ present(X0,X1)
<=> ( ( X0 = sK8
& X1 != sK29(sK8)
& X1 != sK34(sK8) )
| ( X0 = sK39
& X1 != sK14(sK39)
& X1 != sK19(sK39) ) ) ) ).
%------ Positive definition of agent
fof(lit_def_002,axiom,
! [X0,X1,X2] :
( agent(X0,X1,X2)
<=> ( ( X0 = sK8
& X1 = sK29(sK8)
& X2 = sK27(sK8) )
| ( X0 = sK8
& X1 = sK34(sK8)
& X2 = sK23(sK8) )
| ( X0 = sK39
& X1 = sK14(sK39)
& X2 = sK12(sK39) )
| ( X0 = sK39
& X1 = sK19(sK39)
& X2 = sK10(sK39) )
| ( X0 = sK15(sK39)
& X1 = sK22(sK15(sK39),sK38(sK15(sK39)))
& X2 = sK38(sK15(sK39)) )
| ( X0 = sK20(sK39)
& X1 = sK21(sK20(sK39),sK10(sK39))
& X2 = sK10(sK39) )
| ( X0 = sK35(sK8)
& X1 = sK36(sK35(sK8),sK25(sK8))
& X2 = sK25(sK8) ) ) ) ).
%------ Negative definition of event
fof(lit_def_003,axiom,
! [X0,X1] :
( ~ event(X0,X1)
<=> $false ) ).
%------ Positive definition of accessible_world
fof(lit_def_004,axiom,
! [X0,X1] :
( accessible_world(X0,X1)
<=> ( ( X0 = sK8
& X1 = sK30(sK8) )
| ( X0 = sK8
& X1 = sK35(sK8) )
| ( X0 = sK39
& X1 = sK15(sK39) )
| ( X0 = sK39
& X1 = sK20(sK39) ) ) ) ).
%------ Negative definition of think_believe_consider
fof(lit_def_005,axiom,
! [X0,X1] :
( ~ think_believe_consider(X0,X1)
<=> $false ) ).
%------ Positive definition of theme
fof(lit_def_006,axiom,
! [X0,X1,X2] :
( theme(X0,X1,X2)
<=> ( ( X0 = sK8
& X1 = sK29(sK8)
& X2 = sK30(sK8) )
| ( X0 = sK8
& X1 = sK34(sK8)
& X2 = sK35(sK8) )
| ( X0 = sK39
& X1 = sK14(sK39)
& X2 = sK15(sK39) )
| ( X0 = sK39
& X1 = sK19(sK39)
& X2 = sK20(sK39) ) ) ) ).
%------ Negative definition of proposition
fof(lit_def_007,axiom,
! [X0,X1] :
( ~ proposition(X0,X1)
<=> $false ) ).
%------ Positive definition of man
fof(lit_def_008,axiom,
! [X0,X1] :
( man(X0,X1)
<=> ( ( X0 = sK8
& X1 = sK25(sK8) )
| ( X0 = sK8
& X1 = sK23(sK8) )
| ( X0 = sK8
& X1 = sK27(sK8) )
| ( X0 = sK8
& X1 = sK32(sK8) )
| ( X0 = sK39
& X1 = sK10(sK39) )
| ( X0 = sK39
& X1 = sK12(sK39) )
| ( X0 = sK39
& X1 = sK17(sK39) )
| ( X0 = sK20(sK39)
& X1 = sK38(sK20(sK39)) ) ) ) ).
%------ Positive definition of forename
fof(lit_def_009,axiom,
! [X0,X1] :
( forename(X0,X1)
<=> ( ( X0 = sK8
& X1 = sK24(sK8) )
| ( X0 = sK8
& X1 = sK26(sK8) )
| ( X0 = sK8
& X1 = sK28(sK8) )
| ( X0 = sK8
& X1 = sK31(sK8) )
| ( X0 = sK39
& X1 = sK9(sK39) )
| ( X0 = sK39
& X1 = sK11(sK39) )
| ( X0 = sK39
& X1 = sK13(sK39) )
| ( X0 = sK39
& X1 = sK16(sK39) ) ) ) ).
%------ Positive definition of jules_forename
fof(lit_def_010,axiom,
! [X0,X1] :
( jules_forename(X0,X1)
<=> ( ( X0 = sK8
& X1 = sK26(sK8) )
| ( X0 = sK8
& X1 = sK31(sK8) )
| ( X0 = sK39
& X1 = sK9(sK39) )
| ( X0 = sK39
& X1 = sK16(sK39) ) ) ) ).
%------ Positive definition of of
fof(lit_def_011,axiom,
! [X0,X1,X2] :
( of(X0,X1,X2)
<=> ( ( X0 = sK8
& X1 = sK24(sK8)
& X2 = sK23(sK8) )
| ( X0 = sK8
& X1 = sK26(sK8)
& X2 = sK25(sK8) )
| ( X0 = sK8
& X1 = sK28(sK8)
& X2 = sK27(sK8) )
| ( X0 = sK8
& X1 = sK31(sK8)
& X2 = sK32(sK8) )
| ( X0 = sK39
& X1 = sK9(sK39)
& X2 = sK10(sK39) )
| ( X0 = sK39
& X1 = sK11(sK39)
& X2 = sK10(sK39) )
| ( X0 = sK39
& X1 = sK13(sK39)
& X2 = sK12(sK39) )
| ( X0 = sK39
& X1 = sK16(sK39)
& X2 = sK17(sK39) ) ) ) ).
%------ Positive definition of vincent_forename
fof(lit_def_012,axiom,
! [X0,X1] :
( vincent_forename(X0,X1)
<=> ( ( X0 = sK8
& X1 = sK24(sK8) )
| ( X0 = sK8
& X1 = sK28(sK8) )
| ( X0 = sK39
& X1 = sK11(sK39) )
| ( X0 = sK39
& X1 = sK13(sK39) ) ) ) ).
%------ Positive definition of sP6
fof(lit_def_013,axiom,
( sP6
<=> $true ) ).
%------ 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
<=> $true ) ).
%------ 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
<=> $false ) ).
%------ Positive definition of sP6_iProver_split
fof(lit_def_020,axiom,
( sP6_iProver_split
<=> $true ) ).
%------ 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 ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.15 % Problem : NLP230+1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.16 % Command : run_iprover %s %d THM
% 0.17/0.36 % Computer : n028.cluster.edu
% 0.17/0.36 % Model : x86_64 x86_64
% 0.17/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.36 % Memory : 8042.1875MB
% 0.17/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.36 % CPULimit : 300
% 0.17/0.36 % WCLimit : 300
% 0.17/0.36 % DateTime : Thu Aug 24 11:17:50 EDT 2023
% 0.17/0.36 % CPUTime :
% 0.22/0.49 Running first-order theorem proving
% 0.22/0.49 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.89/1.14 % SZS status Started for theBenchmark.p
% 3.89/1.14 % SZS status CounterSatisfiable for theBenchmark.p
% 3.89/1.14
% 3.89/1.14 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.89/1.14
% 3.89/1.14 ------ iProver source info
% 3.89/1.14
% 3.89/1.14 git: date: 2023-05-31 18:12:56 +0000
% 3.89/1.14 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.89/1.14 git: non_committed_changes: false
% 3.89/1.14 git: last_make_outside_of_git: false
% 3.89/1.14
% 3.89/1.14 ------ Parsing...
% 3.89/1.14 ------ Clausification by vclausify_rel & Parsing by iProver...
% 3.89/1.14
% 3.89/1.14 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe:8:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 3.89/1.14
% 3.89/1.14 ------ Preprocessing... gs_s sp: 12 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.89/1.14 ------ Proving...
% 3.89/1.14 ------ Problem Properties
% 3.89/1.14
% 3.89/1.14
% 3.89/1.14 clauses 88
% 3.89/1.14 conjectures 0
% 3.89/1.14 EPR 7
% 3.89/1.14 Horn 47
% 3.89/1.14 unary 0
% 3.89/1.14 binary 67
% 3.89/1.14 lits 299
% 3.89/1.14 lits eq 0
% 3.89/1.14 fd_pure 0
% 3.89/1.14 fd_pseudo 0
% 3.89/1.14 fd_cond 0
% 3.89/1.14 fd_pseudo_cond 0
% 3.89/1.14 AC symbols 0
% 3.89/1.14
% 3.89/1.14 ------ Schedule dynamic 5 is on
% 3.89/1.14
% 3.89/1.14 ------ no conjectures: strip conj schedule
% 3.89/1.14
% 3.89/1.14 ------ no equalities: superposition off
% 3.89/1.14
% 3.89/1.14 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.89/1.14
% 3.89/1.14
% 3.89/1.14 ------
% 3.89/1.14 Current options:
% 3.89/1.14 ------
% 3.89/1.14
% 3.89/1.14
% 3.89/1.14
% 3.89/1.14
% 3.89/1.14 ------ Proving...
% 3.89/1.14
% 3.89/1.14
% 3.89/1.14 % SZS status CounterSatisfiable for theBenchmark.p
% 3.89/1.14
% 3.89/1.14 ------ Building Model...Done
% 3.89/1.14
% 3.89/1.14 %------ The model is defined over ground terms (initial term algebra).
% 3.89/1.14 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.89/1.14 %------ where \phi is a formula over the term algebra.
% 3.89/1.14 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.89/1.14 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.89/1.14 %------ See help for --sat_out_model for different model outputs.
% 3.89/1.14 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.89/1.14 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.89/1.14 % SZS output start Model for theBenchmark.p
% See solution above
% 3.89/1.14
%------------------------------------------------------------------------------