TSTP Solution File: NLP267_17 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NLP267_17 : TPTP v8.2.0. Released v8.2.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 : Fri May 3 02:45:39 EDT 2024
% Result : Theorem 0.80s 1.18s
% Output : CNFRefutation 0.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 24 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 115 ( 0 equ)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 56 ( 25 ~; 18 |; 7 &)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 60 ( 60 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 12 ( 11 usr; 8 prp; 0-3 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 23 ( 3 sgn 14 !; 2 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
tff(f1,axiom,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'('#idx(b_s)',X0,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p','mrel_universal_#idx(b_s)') ).
tff(f4,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(b_s)','$ki_local_world',X0)
=> ( ( class(X0,second)
& dest(X0,paris) )
=> price(X0,seventy) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).
tff(f9,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(b_s)','$ki_local_world',X0)
=> ( class(X0,second)
& dest(X0,paris) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).
tff(f10,conjecture,
! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(b_s)','$ki_local_world',X0)
=> price(X0,seventy) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',verify) ).
tff(f11,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('#idx(b_s)','$ki_local_world',X0)
=> price(X0,seventy) ),
inference(negated_conjecture,[],[f10]) ).
tff(f14,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ class(X0,second)
| ~ dest(X0,paris)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(ennf_transformation,[],[f4]) ).
tff(f15,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ class(X0,second)
| ~ dest(X0,paris)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(flattening,[],[f14]) ).
tff(f24,plain,
! [X0: '$ki_world'] :
( ( class(X0,second)
& dest(X0,paris) )
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(ennf_transformation,[],[f9]) ).
tff(f25,plain,
? [X0: '$ki_world'] :
( ~ price(X0,seventy)
& '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(ennf_transformation,[],[f11]) ).
tff(f26,plain,
( ? [X0: '$ki_world'] :
( ~ price(X0,seventy)
& '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) )
=> ( ~ price(sK0,seventy)
& '$ki_accessible'('#idx(b_s)','$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f27,plain,
( ~ price(sK0,seventy)
& '$ki_accessible'('#idx(b_s)','$ki_local_world',sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f25,f26]) ).
tff(f28,plain,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'('#idx(b_s)',X0,X1),
inference(cnf_transformation,[],[f1]) ).
tff(f31,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ class(X0,second)
| ~ dest(X0,paris)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(cnf_transformation,[],[f15]) ).
tff(f36,plain,
! [X0: '$ki_world'] :
( dest(X0,paris)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(cnf_transformation,[],[f24]) ).
tff(f37,plain,
! [X0: '$ki_world'] :
( class(X0,second)
| ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0) ),
inference(cnf_transformation,[],[f24]) ).
tff(f39,plain,
~ price(sK0,seventy),
inference(cnf_transformation,[],[f27]) ).
cnf(c_49,plain,
'$ki_accessible'('#idx(b_s)',X0_13,X1_13),
inference(cnf_transformation,[],[f28]) ).
cnf(c_52,plain,
( ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0_13)
| ~ dest(X0_13,paris)
| ~ class(X0_13,second)
| price(X0_13,seventy) ),
inference(cnf_transformation,[],[f31]) ).
cnf(c_57,plain,
( ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0_13)
| class(X0_13,second) ),
inference(cnf_transformation,[],[f37]) ).
cnf(c_58,plain,
( ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0_13)
| dest(X0_13,paris) ),
inference(cnf_transformation,[],[f36]) ).
cnf(c_59,negated_conjecture,
~ price(sK0,seventy),
inference(cnf_transformation,[],[f39]) ).
cnf(c_77,plain,
( ~ '$ki_accessible'('#idx(b_s)','$ki_local_world',X0_13)
| price(X0_13,seventy) ),
inference(global_subsumption_just,[status(thm)],[c_52,c_58,c_57,c_52]) ).
cnf(c_85,plain,
price(X0_13,seventy),
inference(backward_subsumption_resolution,[status(thm)],[c_77,c_49]) ).
cnf(c_97,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_59,c_85]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : NLP267_17 : TPTP v8.2.0. Released v8.2.0.
% 0.10/0.13 % Command : run_iprover %s %d THM
% 0.14/0.34 % Computer : n022.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Thu May 2 18:18:42 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.21/0.47 Running first-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox2/benchmark/theBenchmark.p 300
% 0.80/1.18 % SZS status Started for theBenchmark.p
% 0.80/1.18 % SZS status Theorem for theBenchmark.p
% 0.80/1.18
% 0.80/1.18 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.80/1.18
% 0.80/1.18 ------ iProver source info
% 0.80/1.18
% 0.80/1.18 git: date: 2024-05-02 19:28:25 +0000
% 0.80/1.18 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.80/1.18 git: non_committed_changes: false
% 0.80/1.18
% 0.80/1.18 ------ Parsing...
% 0.80/1.18 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Global Options Modified: tff_prep: switching off prep_sem_filter, sub_typing, pure_diseq_elim
% 0.80/1.18
% 0.80/1.18
% 0.80/1.18 ------ Preprocessing...
% 0.80/1.18
% 0.80/1.18 % SZS status Theorem for theBenchmark.p
% 0.80/1.18
% 0.80/1.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.80/1.18
% 0.80/1.18
%------------------------------------------------------------------------------