TSTP Solution File: NLP026-1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NLP026-1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n001.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:19 EDT 2023
% Result : Satisfiable 4.26s 1.23s
% Output : Model 4.26s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NLP026-1 : TPTP v8.1.2. Released v2.4.0.
% 0.00/0.14 % Command : run_iprover %s %d THM
% 0.17/0.35 % Computer : n001.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 24 12:41:26 EDT 2023
% 0.17/0.35 % CPUTime :
% 0.20/0.48 Running first-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 4.26/1.23 % SZS status Started for theBenchmark.p
% 4.26/1.23 % SZS status Satisfiable for theBenchmark.p
% 4.26/1.23
% 4.26/1.23 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 4.26/1.23
% 4.26/1.23 ------ iProver source info
% 4.26/1.23
% 4.26/1.23 git: date: 2023-05-31 18:12:56 +0000
% 4.26/1.23 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 4.26/1.23 git: non_committed_changes: false
% 4.26/1.23 git: last_make_outside_of_git: false
% 4.26/1.23
% 4.26/1.23 ------ Parsing...successful
% 4.26/1.23
% 4.26/1.23
% 4.26/1.23
% 4.26/1.23 ------ 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
% 4.26/1.23
% 4.26/1.23 ------ Preprocessing... gs_s sp: 4 0s gs_e snvd_s sp: 0 0s snvd_e
% 4.26/1.23 ------ Proving...
% 4.26/1.23 ------ Problem Properties
% 4.26/1.23
% 4.26/1.23
% 4.26/1.23 clauses 48
% 4.26/1.23 conjectures 38
% 4.26/1.23 EPR 9
% 4.26/1.23 Horn 35
% 4.26/1.23 unary 0
% 4.26/1.23 binary 11
% 4.26/1.23 lits 163
% 4.26/1.23 lits eq 0
% 4.26/1.23 fd_pure 0
% 4.26/1.23 fd_pseudo 0
% 4.26/1.23 fd_cond 0
% 4.26/1.23 fd_pseudo_cond 0
% 4.26/1.23 AC symbols 0
% 4.26/1.23
% 4.26/1.23 ------ Input Options Time Limit: Unbounded
% 4.26/1.23
% 4.26/1.23
% 4.26/1.23 ------
% 4.26/1.23 Current options:
% 4.26/1.23 ------
% 4.26/1.23
% 4.26/1.23
% 4.26/1.23
% 4.26/1.23
% 4.26/1.23 ------ Proving...
% 4.26/1.23
% 4.26/1.23
% 4.26/1.23 % SZS status Satisfiable for theBenchmark.p
% 4.26/1.23
% 4.26/1.23 ------ Building Model...Done
% 4.26/1.23
% 4.26/1.23 %------ The model is defined over ground terms (initial term algebra).
% 4.26/1.23 %------ Predicates are defined as (\forall x_1,..,x_n ((~)P(x_1,..,x_n) <=> (\phi(x_1,..,x_n))))
% 4.26/1.23 %------ where \phi is a formula over the term algebra.
% 4.26/1.23 %------ If we have equality in the problem then it is also defined as a predicate above,
% 4.26/1.23 %------ with "=" on the right-hand-side of the definition interpreted over the term algebra term_algebra_type
% 4.26/1.23 %------ See help for --sat_out_model for different model outputs.
% 4.26/1.23 %------ equality_sorted(X0,X1,X2) can be used in the place of usual "="
% 4.26/1.23 %------ where the first argument stands for the sort ($i in the unsorted case)
% 4.26/1.23 % SZS output start Model for theBenchmark.p
% 4.26/1.23
% 4.26/1.23 %------ Positive definition of ssSkC0
% 4.26/1.23 fof(lit_def,axiom,
% 4.26/1.23 ( ssSkC0 <=>
% 4.26/1.23 $true
% 4.26/1.23 )
% 4.26/1.23 ).
% 4.26/1.23
% 4.26/1.23 %------ Negative definition of group
% 4.26/1.23 fof(lit_def,axiom,
% 4.26/1.23 (! [X0_15,X0_14] :
% 4.26/1.23 ( ~(group(X0_15,X0_14)) <=>
% 4.26/1.23 $false
% 4.26/1.23 )
% 4.26/1.23 )
% 4.26/1.23 ).
% 4.26/1.23
% 4.26/1.23 %------ Positive definition of table
% 4.26/1.23 fof(lit_def,axiom,
% 4.26/1.23 (! [X0_15,X0_13] :
% 4.26/1.23 ( table(X0_15,X0_13) <=>
% 4.26/1.23 (
% 4.26/1.23 (
% 4.26/1.23 ( X0_15=skc64 & X0_13=skc66 )
% 4.26/1.23 )
% 4.26/1.23
% 4.26/1.23 )
% 4.26/1.23 )
% 4.26/1.23 )
% 4.26/1.23 ).
% 4.26/1.23
% 4.26/1.23 %------ Positive definition of ssSkP3
% 4.26/1.23 fof(lit_def,axiom,
% 4.26/1.23 (! [X0_14,X0_15] :
% 4.26/1.23 ( ssSkP3(X0_14,X0_15) <=>
% 4.26/1.23 (
% 4.26/1.23 (
% 4.26/1.23 ( X0_14=skc6 & X0_15=skc5 )
% 4.26/1.23 )
% 4.26/1.23
% 4.26/1.23 )
% 4.26/1.23 )
% 4.26/1.23 )
% 4.26/1.23 ).
% 4.26/1.23
% 4.26/1.23 %------ Positive definition of ssSkP2
% 4.26/1.23 fof(lit_def,axiom,
% 4.26/1.23 (! [X0_13,X0_14,X0_15] :
% 4.26/1.23 ( ssSkP2(X0_13,X0_14,X0_15) <=>
% 4.26/1.23 (
% 4.26/1.23 (
% 4.26/1.23 ( X0_14=skc6 & X0_15=skc5 )
% 4.26/1.23 )
% 4.26/1.23
% 4.26/1.23 )
% 4.26/1.23 )
% 4.26/1.23 )
% 4.26/1.23 ).
% 4.26/1.23
% 4.26/1.23 %------ Negative definition of member
% 4.26/1.23 fof(lit_def,axiom,
% 4.26/1.23 (! [X0_15,X0_16,X0_14] :
% 4.26/1.23 ( ~(member(X0_15,X0_16,X0_14)) <=>
% 4.26/1.23 (
% 4.26/1.23 (
% 4.26/1.23 ( X0_15=skc64 & X0_14=skc65 )
% 4.26/1.23 &
% 4.26/1.23 ( X0_16!=skf17(skc65,skc64,X0_16,X0_13) )
% 4.26/1.23 &
% 4.26/1.23 ( X0_16!=skf26(skc64,X0_13,skc65) )
% 4.26/1.23 &
% 4.26/1.23 ( X0_16!=skf22(X0_16,skc64,skc65) )
% 4.26/1.23 &
% 4.26/1.23 ( X0_16!=skf31(skc64,skc65) )
% 4.26/1.23 &
% 4.26/1.23 ( X0_16!=skf26(skc64,X1_13,skc65) )
% 4.26/1.23 &
% 4.26/1.23 ! [X1_13] : ( X0_16!=skf17(skc65,skc64,X0_16,X1_13) )
% 4.26/1.23 )
% 4.26/1.23
% 4.26/1.23 |
% 4.26/1.23 (
% 4.26/1.23 ( X0_15=skc5 & X0_14=skc6 )
% 4.26/1.23 )
% 4.26/1.23
% 4.26/1.23 |
% 4.26/1.23 ? [X0_13] :
% 4.26/1.23 (
% 4.26/1.23 ( X0_15=skc5 & X0_16=skf26(skc5,X0_13,skc6) & X0_14=skc6 )
% 4.26/1.23 )
% 4.26/1.23
% 4.26/1.23 |
% 4.26/1.23 (
% 4.26/1.23 ( X0_15=skc5 & X0_16=skf31(skc5,skc6) & X0_14=skc6 )
% 4.26/1.23 )
% 4.26/1.23
% 4.26/1.23 |
% 4.26/1.23 ? [X1_16] :
% 4.26/1.23 (
% 4.26/1.23 ( X0_15=skc5 & X0_16=skf22(X1_16,skc5,skc6) & X0_14=skc6 )
% 4.26/1.23 )
% 4.26/1.23
% 4.26/1.23 |
% 4.26/1.23 ? [X1_16,X0_13] :
% 4.26/1.23 (
% 4.26/1.23 ( X0_15=skc5 & X0_16=skf17(skc6,skc5,X1_16,X0_13) & X0_14=skc6 )
% 4.26/1.23 )
% 4.26/1.23
% 4.26/1.23 )
% 4.26/1.23 )
% 4.26/1.23 )
% 4.26/1.23 ).
% 4.26/1.23
% 4.26/1.23 %------ Positive definition of ssSkP1
% 4.26/1.23 fof(lit_def,axiom,
% 4.26/1.23 (! [X0_16,X0_14,X0_15] :
% 4.26/1.23 ( ssSkP1(X0_16,X0_14,X0_15) <=>
% 4.26/1.23 (
% 4.26/1.23 (
% 4.26/1.23 ( X0_14=skc6 & X0_15=skc5 )
% 4.26/1.23 )
% 4.26/1.23
% 4.26/1.23 )
% 4.26/1.23 )
% 4.26/1.23 )
% 4.26/1.23 ).
% 4.26/1.23
% 4.26/1.23 %------ Positive definition of ssSkP0
% 4.26/1.23 fof(lit_def,axiom,
% 4.26/1.23 (! [X0_16,X0_13,X0_14,X0_15] :
% 4.26/1.23 ( ssSkP0(X0_16,X0_13,X0_14,X0_15) <=>
% 4.26/1.23 (
% 4.26/1.23 (
% 4.26/1.23 ( X0_14=skc6 & X0_15=skc5 )
% 4.26/1.23 )
% 4.26/1.23
% 4.26/1.23 )
% 4.26/1.23 )
% 4.26/1.23 )
% 4.26/1.23 ).
% 4.26/1.23
% 4.26/1.23 %------ Positive definition of three
% 4.26/1.23 fof(lit_def,axiom,
% 4.26/1.23 (! [X0_15,X0_14] :
% 4.26/1.23 ( three(X0_15,X0_14) <=>
% 4.26/1.23 (
% 4.26/1.23 ? [X0_16] :
% 4.26/1.23 (
% 4.26/1.23 ( X0_15=skc5 & X0_14=skf29(skc5,X0_16) )
% 4.26/1.23 )
% 4.26/1.23
% 4.26/1.23 )
% 4.26/1.23 )
% 4.26/1.23 )
% 4.26/1.23 ).
% 4.26/1.23
% 4.26/1.23 %------ Positive definition of event
% 4.26/1.23 fof(lit_def,axiom,
% 4.26/1.23 (! [X0_15,X0_17] :
% 4.26/1.23 ( event(X0_15,X0_17) <=>
% 4.26/1.23 $false
% 4.26/1.23 )
% 4.26/1.23 )
% 4.26/1.23 ).
% 4.26/1.23
% 4.26/1.23 %------ Negative definition of agent
% 4.26/1.23 fof(lit_def,axiom,
% 4.26/1.23 (! [X0_15,X0_17,X0_16] :
% 4.26/1.23 ( ~(agent(X0_15,X0_17,X0_16)) <=>
% 4.26/1.23 $false
% 4.26/1.23 )
% 4.26/1.23 )
% 4.26/1.23 ).
% 4.26/1.23
% 4.26/1.23 %------ Negative definition of at
% 4.26/1.23 fof(lit_def,axiom,
% 4.26/1.23 (! [X0_15,X0_17,X0_13] :
% 4.26/1.23 ( ~(at(X0_15,X0_17,X0_13)) <=>
% 4.26/1.23 $false
% 4.26/1.23 )
% 4.26/1.23 )
% 4.26/1.23 ).
% 4.26/1.23
% 4.26/1.23 %------ Negative definition of young
% 4.26/1.23 fof(lit_def,axiom,
% 4.26/1.23 (! [X0_15,X0_16] :
% 4.26/1.23 ( ~(young(X0_15,X0_16)) <=>
% 4.26/1.23 $false
% 4.26/1.23 )
% 4.26/1.23 )
% 4.26/1.23 ).
% 4.26/1.23
% 4.26/1.23 %------ Negative definition of guy
% 4.26/1.23 fof(lit_def,axiom,
% 4.26/1.23 (! [X0_15,X0_16] :
% 4.26/1.23 ( ~(guy(X0_15,X0_16)) <=>
% 4.26/1.23 $false
% 4.26/1.23 )
% 4.26/1.23 )
% 4.26/1.23 ).
% 4.26/1.23
% 4.26/1.23 %------ Positive definition of sP0_iProver_split
% 4.26/1.23 fof(lit_def,axiom,
% 4.26/1.23 ( sP0_iProver_split <=>
% 4.26/1.23 $true
% 4.26/1.23 )
% 4.26/1.23 ).
% 4.26/1.23
% 4.26/1.23 %------ Positive definition of sP1_iProver_split
% 4.26/1.23 fof(lit_def,axiom,
% 4.26/1.23 ( sP1_iProver_split <=>
% 4.26/1.23 $false
% 4.26/1.23 )
% 4.26/1.23 ).
% 4.26/1.23
% 4.26/1.23 %------ Positive definition of sP2_iProver_split
% 4.26/1.23 fof(lit_def,axiom,
% 4.26/1.23 ( sP2_iProver_split <=>
% 4.26/1.23 $true
% 4.26/1.23 )
% 4.26/1.23 ).
% 4.26/1.23
% 4.26/1.23 %------ Positive definition of sP3_iProver_split
% 4.26/1.23 fof(lit_def,axiom,
% 4.26/1.23 ( sP3_iProver_split <=>
% 4.26/1.23 $false
% 4.26/1.23 )
% 4.26/1.23 ).
% 4.26/1.23 % SZS output end Model for theBenchmark.p
% 4.26/1.23
%------------------------------------------------------------------------------