TSTP Solution File: NLP267_1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : NLP267_1 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n011.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.82s 1.19s
% Output : CNFRefutation 0.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of formulae : 25 ( 6 unt; 0 typ; 0 def)
% Number of atoms : 104 ( 0 equ)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 57 ( 26 ~; 19 |; 5 &)
% ( 0 <=>; 7 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 3 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 48 ( 48 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 11 ( 10 usr; 7 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 18 ( 0 sgn 12 !; 2 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
tff(f2,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ( class(X0,second)
& dest(X0,paris) )
=> price(X0,seventy) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',law2) ).
tff(f5,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> dest(X0,paris) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',belief1) ).
tff(f6,axiom,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> class(X0,second) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',belief2) ).
tff(f7,conjecture,
! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> price(X0,seventy) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f8,negated_conjecture,
~ ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> price(X0,seventy) ),
inference(negated_conjecture,[],[f7]) ).
tff(f11,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ class(X0,second)
| ~ dest(X0,paris)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f2]) ).
tff(f12,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ class(X0,second)
| ~ dest(X0,paris)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(flattening,[],[f11]) ).
tff(f17,plain,
! [X0: '$ki_world'] :
( dest(X0,paris)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f5]) ).
tff(f18,plain,
! [X0: '$ki_world'] :
( class(X0,second)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f6]) ).
tff(f19,plain,
? [X0: '$ki_world'] :
( ~ price(X0,seventy)
& '$ki_accessible'('$ki_local_world',X0) ),
inference(ennf_transformation,[],[f8]) ).
tff(f20,plain,
( ? [X0: '$ki_world'] :
( ~ price(X0,seventy)
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ~ price(sK0,seventy)
& '$ki_accessible'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f21,plain,
( ~ price(sK0,seventy)
& '$ki_accessible'('$ki_local_world',sK0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0])],[f19,f20]) ).
tff(f23,plain,
! [X0: '$ki_world'] :
( price(X0,seventy)
| ~ class(X0,second)
| ~ dest(X0,paris)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f12]) ).
tff(f26,plain,
! [X0: '$ki_world'] :
( dest(X0,paris)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f17]) ).
tff(f27,plain,
! [X0: '$ki_world'] :
( class(X0,second)
| ~ '$ki_accessible'('$ki_local_world',X0) ),
inference(cnf_transformation,[],[f18]) ).
tff(f28,plain,
'$ki_accessible'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f21]) ).
tff(f29,plain,
~ price(sK0,seventy),
inference(cnf_transformation,[],[f21]) ).
cnf(c_50,plain,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| ~ dest(X0_13,paris)
| ~ class(X0_13,second)
| price(X0_13,seventy) ),
inference(cnf_transformation,[],[f23]) ).
cnf(c_53,plain,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| dest(X0_13,paris) ),
inference(cnf_transformation,[],[f26]) ).
cnf(c_54,plain,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| class(X0_13,second) ),
inference(cnf_transformation,[],[f27]) ).
cnf(c_55,negated_conjecture,
~ price(sK0,seventy),
inference(cnf_transformation,[],[f29]) ).
cnf(c_56,negated_conjecture,
'$ki_accessible'('$ki_local_world',sK0),
inference(cnf_transformation,[],[f28]) ).
cnf(c_69,plain,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| price(X0_13,seventy) ),
inference(global_subsumption_just,[status(thm)],[c_50,c_54,c_53,c_50]) ).
cnf(c_98,plain,
price(sK0,seventy),
inference(resolution,[status(thm)],[c_69,c_56]) ).
cnf(c_99,plain,
$false,
inference(prop_impl_just,[status(thm)],[c_98,c_55]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NLP267_1 : TPTP v8.2.0. Released v8.2.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.15/0.35 % Computer : n011.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Thu May 2 18:35:03 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.49 Running first-order theorem proving
% 0.21/0.49 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.82/1.19 % SZS status Started for theBenchmark.p
% 0.82/1.19 % SZS status Theorem for theBenchmark.p
% 0.82/1.19
% 0.82/1.19 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.82/1.19
% 0.82/1.19 ------ iProver source info
% 0.82/1.19
% 0.82/1.19 git: date: 2024-05-02 19:28:25 +0000
% 0.82/1.19 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.82/1.19 git: non_committed_changes: false
% 0.82/1.19
% 0.82/1.19 ------ Parsing...
% 0.82/1.19 ------ 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.82/1.19
% 0.82/1.19
% 0.82/1.19 ------ Preprocessing... pe_s pe:1:0s pe:2:0s
% 0.82/1.19
% 0.82/1.19 % SZS status Theorem for theBenchmark.p
% 0.82/1.19
% 0.82/1.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.82/1.19
% 0.82/1.19
%------------------------------------------------------------------------------