TSTP Solution File: NLP061-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NLP061-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n024.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:38 EDT 2023
% Result : Satisfiable 3.02s 1.16s
% Output : Model 3.02s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of ssSkC0
fof(lit_def,axiom,
( ssSkC0
<=> $true ) ).
%------ Negative definition of ssSkP1
fof(lit_def_001,axiom,
! [X0,X1,X2] :
( ~ ssSkP1(X0,X1,X2)
<=> ( X0 = skc7
& X1 = skc8
& X2 = skc6 ) ) ).
%------ Negative definition of ssSkP0
fof(lit_def_002,axiom,
! [X0,X1,X2] :
( ~ ssSkP0(X0,X1,X2)
<=> $false ) ).
%------ Positive definition of member
fof(lit_def_003,axiom,
! [X0,X1,X2] :
( member(X0,X1,X2)
<=> ( ? [X3] :
( X0 = skc59
& X1 = skf14(skc60,skc59,X3)
& X2 = skc60 )
| ? [X3] :
( X0 = skc6
& X1 = skf23(skc7,skc6,X3)
& X2 = skc7 ) ) ) ).
%------ Positive definition of cannon
fof(lit_def_004,axiom,
! [X0,X1] :
( cannon(X0,X1)
<=> ( ? [X2,X3] :
( X0 = skc59
& X1 = skf16(skc59,X2,X3)
& X2 != skc61 )
| ? [X2,X3] :
( X0 = skc6
& X1 = skf26(skc6,X2,X3) ) ) ) ).
%------ Positive definition of man
fof(lit_def_005,axiom,
! [X0,X1] :
( man(X0,X1)
<=> ? [X2,X3] :
( X0 = skc59
& X1 = skf18(skc59,X2,X3) ) ) ).
%------ Positive definition of of
fof(lit_def_006,axiom,
! [X0,X1,X2] :
( of(X0,X1,X2)
<=> ( ? [X3] :
( X0 = skc59
& X1 = skf16(skc59,skc61,X3)
& X2 = skc61 )
| ? [X3] :
( X0 = skc6
& X1 = skf26(skc6,skc8,X3)
& X2 = skc8 ) ) ) ).
%------ Positive definition of event
fof(lit_def_007,axiom,
! [X0,X1] :
( event(X0,X1)
<=> $false ) ).
%------ Negative definition of from_loc
fof(lit_def_008,axiom,
! [X0,X1,X2] :
( ~ from_loc(X0,X1,X2)
<=> $false ) ).
%------ Negative definition of patient
fof(lit_def_009,axiom,
! [X0,X1,X2] :
( ~ patient(X0,X1,X2)
<=> $false ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : NLP061-1 : TPTP v8.1.2. Released v2.4.0.
% 0.06/0.13 % Command : run_iprover %s %d THM
% 0.12/0.33 % Computer : n024.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 10:41:54 EDT 2023
% 0.19/0.34 % CPUTime :
% 0.19/0.46 Running first-order theorem proving
% 0.19/0.46 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 3.02/1.16 % SZS status Started for theBenchmark.p
% 3.02/1.16 % SZS status Satisfiable for theBenchmark.p
% 3.02/1.16
% 3.02/1.16 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.02/1.16
% 3.02/1.16 ------ iProver source info
% 3.02/1.16
% 3.02/1.16 git: date: 2023-05-31 18:12:56 +0000
% 3.02/1.16 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.02/1.16 git: non_committed_changes: false
% 3.02/1.16 git: last_make_outside_of_git: false
% 3.02/1.16
% 3.02/1.16 ------ Parsing...successful
% 3.02/1.16
% 3.02/1.16
% 3.02/1.16
% 3.02/1.16 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe:2:0s pe:4:0s pe_e sf_s rm: 0 0s sf_e pe_s pe_e
% 3.02/1.16
% 3.02/1.16 ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.02/1.16 ------ Proving...
% 3.02/1.16 ------ Problem Properties
% 3.02/1.16
% 3.02/1.16
% 3.02/1.16 clauses 28
% 3.02/1.16 conjectures 26
% 3.02/1.16 EPR 4
% 3.02/1.16 Horn 20
% 3.02/1.16 unary 0
% 3.02/1.16 binary 11
% 3.02/1.16 lits 121
% 3.02/1.16 lits eq 0
% 3.02/1.16 fd_pure 0
% 3.02/1.16 fd_pseudo 0
% 3.02/1.16 fd_cond 0
% 3.02/1.16 fd_pseudo_cond 0
% 3.02/1.16 AC symbols 0
% 3.02/1.16
% 3.02/1.16 ------ Schedule dynamic 5 is on
% 3.02/1.16
% 3.02/1.16 ------ no equalities: superposition off
% 3.02/1.16
% 3.02/1.16 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.02/1.16
% 3.02/1.16
% 3.02/1.16 ------
% 3.02/1.16 Current options:
% 3.02/1.16 ------
% 3.02/1.16
% 3.02/1.16
% 3.02/1.16
% 3.02/1.16
% 3.02/1.16 ------ Proving...
% 3.02/1.16
% 3.02/1.16
% 3.02/1.16 % SZS status Satisfiable for theBenchmark.p
% 3.02/1.16
% 3.02/1.16 ------ Building Model...Done
% 3.02/1.16
% 3.02/1.16 %------ The model is defined over ground terms (initial term algebra).
% 3.02/1.16 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.02/1.16 %------ where \phi is a formula over the term algebra.
% 3.02/1.16 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.02/1.16 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.02/1.16 %------ See help for --sat_out_model for different model outputs.
% 3.02/1.16 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.02/1.16 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.02/1.16 % SZS output start Model for theBenchmark.p
% See solution above
% 3.02/1.16
%------------------------------------------------------------------------------