TSTP Solution File: NLP003+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : NLP003+1 : TPTP v8.1.2. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n022.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:04 EDT 2023
% Result : CounterSatisfiable 1.22s 1.15s
% Output : Saturation 1.22s
% Verified :
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)
% Comments :
%------------------------------------------------------------------------------
fof(f29,axiom,
! [X0,X1,X2] :
( ( human(X1)
& have(X0,X1,X2) )
<=> ( of(X1,X2)
& owner(X1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax29) ).
fof(f31,axiom,
! [X0,X1,X2] :
( ( have(X0,X1,X2)
& event(X0) )
=> of(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax31) ).
fof(f32,axiom,
! [X0,X1] :
( of(X1,X0)
=> ? [X2] :
( have(X2,X0,X1)
& event(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ax32) ).
fof(f73,plain,
! [X0,X1,X2] :
( of(X1,X2)
| ~ have(X0,X1,X2)
| ~ event(X0) ),
inference(ennf_transformation,[],[f31]) ).
fof(f74,plain,
! [X0,X1,X2] :
( of(X1,X2)
| ~ have(X0,X1,X2)
| ~ event(X0) ),
inference(flattening,[],[f73]) ).
fof(f75,plain,
! [X0,X1] :
( ? [X2] :
( have(X2,X0,X1)
& event(X2) )
| ~ of(X1,X0) ),
inference(ennf_transformation,[],[f32]) ).
fof(f76,plain,
! [X0,X1,X2] :
( ( ( human(X1)
& have(X0,X1,X2) )
| ~ of(X1,X2)
| ~ owner(X1) )
& ( ( of(X1,X2)
& owner(X1) )
| ~ human(X1)
| ~ have(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f29]) ).
fof(f77,plain,
! [X0,X1,X2] :
( ( ( human(X1)
& have(X0,X1,X2) )
| ~ of(X1,X2)
| ~ owner(X1) )
& ( ( of(X1,X2)
& owner(X1) )
| ~ human(X1)
| ~ have(X0,X1,X2) ) ),
inference(flattening,[],[f76]) ).
fof(f78,plain,
! [X0,X1] :
( ? [X2] :
( have(X2,X0,X1)
& event(X2) )
=> ( have(sK0(X0,X1),X0,X1)
& event(sK0(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f79,plain,
! [X0,X1] :
( ( have(sK0(X0,X1),X0,X1)
& event(sK0(X0,X1)) )
| ~ of(X1,X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f75,f78]) ).
fof(f98,plain,
! [X2,X0,X1] :
( owner(X1)
| ~ human(X1)
| ~ have(X0,X1,X2) ),
inference(cnf_transformation,[],[f77]) ).
fof(f99,plain,
! [X2,X0,X1] :
( of(X1,X2)
| ~ human(X1)
| ~ have(X0,X1,X2) ),
inference(cnf_transformation,[],[f77]) ).
fof(f100,plain,
! [X2,X0,X1] :
( have(X0,X1,X2)
| ~ of(X1,X2)
| ~ owner(X1) ),
inference(cnf_transformation,[],[f77]) ).
fof(f101,plain,
! [X2,X1] :
( human(X1)
| ~ of(X1,X2)
| ~ owner(X1) ),
inference(cnf_transformation,[],[f77]) ).
fof(f102,plain,
! [X2,X0,X1] :
( of(X1,X2)
| ~ have(X0,X1,X2)
| ~ event(X0) ),
inference(cnf_transformation,[],[f74]) ).
fof(f103,plain,
! [X0,X1] :
( event(sK0(X0,X1))
| ~ of(X1,X0) ),
inference(cnf_transformation,[],[f79]) ).
fof(f104,plain,
! [X0,X1] :
( have(sK0(X0,X1),X0,X1)
| ~ of(X1,X0) ),
inference(cnf_transformation,[],[f79]) ).
cnf(c_65,plain,
( ~ of(X0,X1)
| ~ owner(X0)
| human(X0) ),
inference(cnf_transformation,[],[f101]) ).
cnf(c_66,plain,
( ~ of(X0,X1)
| ~ owner(X0)
| have(X2,X0,X1) ),
inference(cnf_transformation,[],[f100]) ).
cnf(c_67,plain,
( ~ have(X0,X1,X2)
| ~ human(X1)
| of(X1,X2) ),
inference(cnf_transformation,[],[f99]) ).
cnf(c_68,plain,
( ~ have(X0,X1,X2)
| ~ human(X1)
| owner(X1) ),
inference(cnf_transformation,[],[f98]) ).
cnf(c_69,plain,
( ~ have(X0,X1,X2)
| ~ event(X0)
| of(X1,X2) ),
inference(cnf_transformation,[],[f102]) ).
cnf(c_70,plain,
( ~ of(X0,X1)
| have(sK0(X1,X0),X1,X0) ),
inference(cnf_transformation,[],[f104]) ).
cnf(c_71,plain,
( ~ of(X0,X1)
| event(sK0(X1,X0)) ),
inference(cnf_transformation,[],[f103]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NLP003+1 : TPTP v8.1.2. Released v2.4.0.
% 0.12/0.13 % Command : run_iprover %s %d THM
% 0.13/0.34 % Computer : n022.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:43:41 EDT 2023
% 0.13/0.34 % CPUTime :
% 0.20/0.46 Running first-order theorem proving
% 0.20/0.46 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 1.22/1.15 % SZS status Started for theBenchmark.p
% 1.22/1.15 % SZS status CounterSatisfiable for theBenchmark.p
% 1.22/1.15
% 1.22/1.15 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 1.22/1.15
% 1.22/1.15 ------ iProver source info
% 1.22/1.15
% 1.22/1.15 git: date: 2023-05-31 18:12:56 +0000
% 1.22/1.15 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 1.22/1.15 git: non_committed_changes: false
% 1.22/1.15 git: last_make_outside_of_git: false
% 1.22/1.15
% 1.22/1.15 ------ Parsing...
% 1.22/1.15 ------ Clausification by vclausify_rel & Parsing by iProver...
% 1.22/1.15
% 1.22/1.15 ------ Preprocessing... sf_s rm: 7 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
% 1.22/1.15
% 1.22/1.15 ------ Preprocessing...------ preprocesses with Option_epr_horn
% 1.22/1.15 gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e
% 1.22/1.15 ------ Proving...
% 1.22/1.15 ------ Problem Properties
% 1.22/1.15
% 1.22/1.15
% 1.22/1.15 clauses 0
% 1.22/1.15 conjectures 0
% 1.22/1.15 EPR 0
% 1.22/1.15 Horn 0
% 1.22/1.15 unary 0
% 1.22/1.15 binary 0
% 1.22/1.15 lits 0
% 1.22/1.15 lits eq 0
% 1.22/1.15 fd_pure 0
% 1.22/1.15 fd_pseudo 0
% 1.22/1.15 fd_cond 0
% 1.22/1.15 fd_pseudo_cond 0
% 1.22/1.15 AC symbols 0
% 1.22/1.15
% 1.22/1.15 ------ Schedule EPR Horn non eq is on
% 1.22/1.15
% 1.22/1.15 ------ no conjectures: strip conj schedule
% 1.22/1.15
% 1.22/1.15 ------ no equalities: superposition off
% 1.22/1.15
% 1.22/1.15 ------ Option_epr_horn stripped conjectures Time Limit: Unbounded
% 1.22/1.15
% 1.22/1.15
% 1.22/1.15
% 1.22/1.15
% 1.22/1.15 % SZS status CounterSatisfiable for theBenchmark.p
% 1.22/1.15
% 1.22/1.15 % SZS output start Saturation for theBenchmark.p
% See solution above
% 1.22/1.15
% 1.22/1.15
%------------------------------------------------------------------------------