TSTP Solution File: NLP029-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NLP029-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n008.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:20 EDT 2023
% Result : Satisfiable 3.04s 1.18s
% Output : Model 3.04s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
%------ Positive definition of ssSkC0
fof(lit_def,axiom,
( ssSkC0
<=> $true ) ).
%------ Positive definition of group
fof(lit_def_001,axiom,
! [X0,X1] :
( group(X0,X1)
<=> ( X0 = skc4
& X1 = skc5 ) ) ).
%------ Positive definition of three
fof(lit_def_002,axiom,
! [X0,X1] :
( three(X0,X1)
<=> ( X0 = skc63
& X1 = skc64 ) ) ).
%------ Negative definition of ssSkP2
fof(lit_def_003,axiom,
! [X0,X1] :
( ~ ssSkP2(X0,X1)
<=> $false ) ).
%------ Negative definition of ssSkP3
fof(lit_def_004,axiom,
! [X0,X1] :
( ~ ssSkP3(X0,X1)
<=> $false ) ).
%------ Positive definition of member
fof(lit_def_005,axiom,
! [X0,X1,X2] :
( member(X0,X1,X2)
<=> $false ) ).
%------ Negative definition of guy
fof(lit_def_006,axiom,
! [X0,X1] :
( ~ guy(X0,X1)
<=> ? [X2] :
( X0 = skc63
& X1 = skf35(skc63,X2) ) ) ).
%------ Negative definition of young
fof(lit_def_007,axiom,
! [X0,X1] :
( ~ young(X0,X1)
<=> ? [X2] :
( X0 = skc63
& X1 = skf15(skc63,X2) ) ) ).
%------ Positive definition of hamburger
fof(lit_def_008,axiom,
! [X0,X1] :
( hamburger(X0,X1)
<=> ( ( X0 = skc4
& X1 = skf29(skc4,skc5) )
| ( X0 = skc4
& X1 = skf34(skc4,skc5) ) ) ) ).
%------ Negative definition of ssSkP1
fof(lit_def_009,axiom,
! [X0,X1,X2] :
( ~ ssSkP1(X0,X1,X2)
<=> $false ) ).
%------ Negative definition of ssSkP0
fof(lit_def_010,axiom,
! [X0,X1,X2,X3] :
( ~ ssSkP0(X0,X1,X2,X3)
<=> $false ) ).
%------ Positive definition of table
fof(lit_def_011,axiom,
! [X0,X1] :
( table(X0,X1)
<=> $false ) ).
%------ Positive definition of sit
fof(lit_def_012,axiom,
! [X0,X1] :
( sit(X0,X1)
<=> $false ) ).
%------ Positive definition of sP0_iProver_split
fof(lit_def_013,axiom,
( sP0_iProver_split
<=> $false ) ).
%------ Positive definition of sP1_iProver_split
fof(lit_def_014,axiom,
( sP1_iProver_split
<=> $true ) ).
%------ Positive definition of sP2_iProver_split
fof(lit_def_015,axiom,
( sP2_iProver_split
<=> $true ) ).
%------ Positive definition of sP3_iProver_split
fof(lit_def_016,axiom,
( sP3_iProver_split
<=> $false ) ).
%------ Positive definition of sP4_iProver_split
fof(lit_def_017,axiom,
( sP4_iProver_split
<=> $false ) ).
%------ Positive definition of sP5_iProver_split
fof(lit_def_018,axiom,
( sP5_iProver_split
<=> $true ) ).
%------ Positive definition of sP6_iProver_split
fof(lit_def_019,axiom,
( sP6_iProver_split
<=> $false ) ).
%------ Positive definition of sP7_iProver_split
fof(lit_def_020,axiom,
( sP7_iProver_split
<=> $true ) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NLP029-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 24 12:26:03 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 3.04/1.18 % SZS status Started for theBenchmark.p
% 3.04/1.18 % SZS status Satisfiable for theBenchmark.p
% 3.04/1.18
% 3.04/1.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 3.04/1.18
% 3.04/1.18 ------ iProver source info
% 3.04/1.18
% 3.04/1.18 git: date: 2023-05-31 18:12:56 +0000
% 3.04/1.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 3.04/1.18 git: non_committed_changes: false
% 3.04/1.18 git: last_make_outside_of_git: false
% 3.04/1.18
% 3.04/1.18 ------ Parsing...successful
% 3.04/1.18
% 3.04/1.18
% 3.04/1.18
% 3.04/1.18 ------ Preprocessing... sf_s rm: 0 0s sf_e pe_s pe:1:0s pe_e
% 3.04/1.18
% 3.04/1.18 ------ Preprocessing... gs_s sp: 8 0s gs_e snvd_s sp: 0 0s snvd_e
% 3.04/1.18 ------ Proving...
% 3.04/1.18 ------ Problem Properties
% 3.04/1.18
% 3.04/1.18
% 3.04/1.18 clauses 56
% 3.04/1.18 conjectures 40
% 3.04/1.18 EPR 16
% 3.04/1.18 Horn 39
% 3.04/1.18 unary 0
% 3.04/1.18 binary 11
% 3.04/1.18 lits 186
% 3.04/1.18 lits eq 0
% 3.04/1.18 fd_pure 0
% 3.04/1.18 fd_pseudo 0
% 3.04/1.18 fd_cond 0
% 3.04/1.18 fd_pseudo_cond 0
% 3.04/1.18 AC symbols 0
% 3.04/1.18
% 3.04/1.18 ------ Schedule dynamic 5 is on
% 3.04/1.18
% 3.04/1.18 ------ no equalities: superposition off
% 3.04/1.18
% 3.04/1.18 ------ Input Options "--resolution_flag false --inst_lit_sel_side none" Time Limit: 10.
% 3.04/1.18
% 3.04/1.18
% 3.04/1.18 ------
% 3.04/1.18 Current options:
% 3.04/1.18 ------
% 3.04/1.18
% 3.04/1.18
% 3.04/1.18
% 3.04/1.18
% 3.04/1.18 ------ Proving...
% 3.04/1.18
% 3.04/1.18
% 3.04/1.18 % SZS status Satisfiable for theBenchmark.p
% 3.04/1.18
% 3.04/1.18 ------ Building Model...Done
% 3.04/1.18
% 3.04/1.18 %------ The model is defined over ground terms (initial term algebra).
% 3.04/1.18 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 3.04/1.18 %------ where \phi is a formula over the term algebra.
% 3.04/1.18 %------ If we have equality in the problem then it is also defined as a predicate above,
% 3.04/1.18 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 3.04/1.18 %------ See help for --sat_out_model for different model outputs.
% 3.04/1.18 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 3.04/1.18 %------ where the first argument stands for the sort ($i in the unsorted case)
% 3.04/1.18 % SZS output start Model for theBenchmark.p
% See solution above
% 3.04/1.18
%------------------------------------------------------------------------------