TSTP Solution File: SYO901_11 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : SYO901_11 : TPTP v8.2.0. Released v8.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n007.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 03:39:07 EDT 2024
% Result : Theorem 0.83s 1.22s
% Output : CNFRefutation 0.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 30 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 200 ( 0 equ)
% Maximal formula atoms : 18 ( 6 avg)
% Number of connectives : 189 ( 65 ~; 60 |; 38 &)
% ( 7 <=>; 18 =>; 0 <=; 1 <~>)
% Maximal formula depth : 9 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of FOOLs : 46 ( 46 fml; 0 var)
% Number of types : 0 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 9 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 70 ( 7 sgn 39 !; 17 ?; 56 :)
% Comments :
%------------------------------------------------------------------------------
tff(f1,axiom,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'(X0,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mrel_universal) ).
tff(f2,conjecture,
( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( p(X0)
<=> q(X0) ) )
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> p(X2) )
<=> ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> q(X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',verify) ).
tff(f3,negated_conjecture,
~ ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( p(X0)
<=> q(X0) ) )
=> ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> p(X2) )
<=> ! [X2: '$ki_world'] :
( '$ki_accessible'(X0,X2)
=> q(X2) ) ) ) ),
inference(negated_conjecture,[],[f2]) ).
tff(f4,plain,
~ ( ! [X0: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X0)
=> ( p(X0)
<=> q(X0) ) )
=> ! [X1: '$ki_world'] :
( '$ki_accessible'('$ki_local_world',X1)
=> ( ! [X2: '$ki_world'] :
( '$ki_accessible'(X1,X2)
=> p(X2) )
<=> ! [X3: '$ki_world'] :
( '$ki_accessible'(X1,X3)
=> q(X3) ) ) ) ),
inference(rectify,[],[f3]) ).
tff(f5,plain,
( ? [X1: '$ki_world'] :
( ( ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'(X1,X2) )
<~> ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(X1,X3) ) )
& '$ki_accessible'('$ki_local_world',X1) )
& ! [X0: '$ki_world'] :
( ( p(X0)
<=> q(X0) )
| ~ '$ki_accessible'('$ki_local_world',X0) ) ),
inference(ennf_transformation,[],[f4]) ).
tff(f6,plain,
( ? [X1: '$ki_world'] :
( ( ? [X3: '$ki_world'] :
( ~ q(X3)
& '$ki_accessible'(X1,X3) )
| ? [X2: '$ki_world'] :
( ~ p(X2)
& '$ki_accessible'(X1,X2) ) )
& ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(X1,X3) )
| ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'(X1,X2) ) )
& '$ki_accessible'('$ki_local_world',X1) )
& ! [X0: '$ki_world'] :
( ( ( p(X0)
| ~ q(X0) )
& ( q(X0)
| ~ p(X0) ) )
| ~ '$ki_accessible'('$ki_local_world',X0) ) ),
inference(nnf_transformation,[],[f5]) ).
tff(f7,plain,
( ? [X1: '$ki_world'] :
( ( ? [X3: '$ki_world'] :
( ~ q(X3)
& '$ki_accessible'(X1,X3) )
| ? [X2: '$ki_world'] :
( ~ p(X2)
& '$ki_accessible'(X1,X2) ) )
& ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(X1,X3) )
| ! [X2: '$ki_world'] :
( p(X2)
| ~ '$ki_accessible'(X1,X2) ) )
& '$ki_accessible'('$ki_local_world',X1) )
& ! [X0: '$ki_world'] :
( ( ( p(X0)
| ~ q(X0) )
& ( q(X0)
| ~ p(X0) ) )
| ~ '$ki_accessible'('$ki_local_world',X0) ) ),
inference(flattening,[],[f6]) ).
tff(f8,plain,
( ? [X0: '$ki_world'] :
( ( ? [X1: '$ki_world'] :
( ~ q(X1)
& '$ki_accessible'(X0,X1) )
| ? [X2: '$ki_world'] :
( ~ p(X2)
& '$ki_accessible'(X0,X2) ) )
& ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(X0,X3) )
| ! [X4: '$ki_world'] :
( p(X4)
| ~ '$ki_accessible'(X0,X4) ) )
& '$ki_accessible'('$ki_local_world',X0) )
& ! [X5: '$ki_world'] :
( ( ( p(X5)
| ~ q(X5) )
& ( q(X5)
| ~ p(X5) ) )
| ~ '$ki_accessible'('$ki_local_world',X5) ) ),
inference(rectify,[],[f7]) ).
tff(f9,plain,
( ? [X0: '$ki_world'] :
( ( ? [X1: '$ki_world'] :
( ~ q(X1)
& '$ki_accessible'(X0,X1) )
| ? [X2: '$ki_world'] :
( ~ p(X2)
& '$ki_accessible'(X0,X2) ) )
& ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(X0,X3) )
| ! [X4: '$ki_world'] :
( p(X4)
| ~ '$ki_accessible'(X0,X4) ) )
& '$ki_accessible'('$ki_local_world',X0) )
=> ( ( ? [X1: '$ki_world'] :
( ~ q(X1)
& '$ki_accessible'(sK0,X1) )
| ? [X2: '$ki_world'] :
( ~ p(X2)
& '$ki_accessible'(sK0,X2) ) )
& ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(sK0,X3) )
| ! [X4: '$ki_world'] :
( p(X4)
| ~ '$ki_accessible'(sK0,X4) ) )
& '$ki_accessible'('$ki_local_world',sK0) ) ),
introduced(choice_axiom,[]) ).
tff(f10,plain,
( ? [X1: '$ki_world'] :
( ~ q(X1)
& '$ki_accessible'(sK0,X1) )
=> ( ~ q(sK1)
& '$ki_accessible'(sK0,sK1) ) ),
introduced(choice_axiom,[]) ).
tff(f11,plain,
( ? [X2: '$ki_world'] :
( ~ p(X2)
& '$ki_accessible'(sK0,X2) )
=> ( ~ p(sK2)
& '$ki_accessible'(sK0,sK2) ) ),
introduced(choice_axiom,[]) ).
tff(f12,plain,
( ( ( ~ q(sK1)
& '$ki_accessible'(sK0,sK1) )
| ( ~ p(sK2)
& '$ki_accessible'(sK0,sK2) ) )
& ( ! [X3: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(sK0,X3) )
| ! [X4: '$ki_world'] :
( p(X4)
| ~ '$ki_accessible'(sK0,X4) ) )
& '$ki_accessible'('$ki_local_world',sK0)
& ! [X5: '$ki_world'] :
( ( ( p(X5)
| ~ q(X5) )
& ( q(X5)
| ~ p(X5) ) )
| ~ '$ki_accessible'('$ki_local_world',X5) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK0,sK1,sK2])],[f8,f11,f10,f9]) ).
tff(f13,plain,
! [X0: '$ki_world',X1: '$ki_world'] : '$ki_accessible'(X0,X1),
inference(cnf_transformation,[],[f1]) ).
tff(f14,plain,
! [X5: '$ki_world'] :
( q(X5)
| ~ p(X5)
| ~ '$ki_accessible'('$ki_local_world',X5) ),
inference(cnf_transformation,[],[f12]) ).
tff(f15,plain,
! [X5: '$ki_world'] :
( p(X5)
| ~ q(X5)
| ~ '$ki_accessible'('$ki_local_world',X5) ),
inference(cnf_transformation,[],[f12]) ).
tff(f17,plain,
! [X3: '$ki_world',X4: '$ki_world'] :
( q(X3)
| ~ '$ki_accessible'(sK0,X3)
| p(X4)
| ~ '$ki_accessible'(sK0,X4) ),
inference(cnf_transformation,[],[f12]) ).
tff(f21,plain,
( ~ q(sK1)
| ~ p(sK2) ),
inference(cnf_transformation,[],[f12]) ).
cnf(c_49,plain,
'$ki_accessible'(X0_13,X1_13),
inference(cnf_transformation,[],[f13]) ).
cnf(c_50,negated_conjecture,
( ~ p(sK2)
| ~ q(sK1) ),
inference(cnf_transformation,[],[f21]) ).
cnf(c_54,negated_conjecture,
( ~ '$ki_accessible'(sK0,X0_13)
| ~ '$ki_accessible'(sK0,X1_13)
| p(X0_13)
| q(X1_13) ),
inference(cnf_transformation,[],[f17]) ).
cnf(c_56,negated_conjecture,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| ~ q(X0_13)
| p(X0_13) ),
inference(cnf_transformation,[],[f15]) ).
cnf(c_57,negated_conjecture,
( ~ '$ki_accessible'('$ki_local_world',X0_13)
| ~ p(X0_13)
| q(X0_13) ),
inference(cnf_transformation,[],[f14]) ).
cnf(c_64,plain,
( ~ q(X0_13)
| p(X0_13) ),
inference(backward_subsumption_resolution,[status(thm)],[c_56,c_49]) ).
cnf(c_65,plain,
( ~ p(X0_13)
| q(X0_13) ),
inference(backward_subsumption_resolution,[status(thm)],[c_57,c_49]) ).
cnf(c_66,plain,
( ~ '$ki_accessible'(sK0,X0_13)
| p(X1_13)
| q(X0_13) ),
inference(backward_subsumption_resolution,[status(thm)],[c_54,c_49]) ).
cnf(c_84,plain,
( p(X0_13)
| q(X1_13) ),
inference(forward_subsumption_resolution,[status(thm)],[c_66,c_49]) ).
cnf(c_91,plain,
q(X0_13),
inference(backward_subsumption_resolution,[status(thm)],[c_65,c_84]) ).
cnf(c_93,plain,
p(X0_13),
inference(backward_subsumption_resolution,[status(thm)],[c_64,c_84]) ).
cnf(c_98,plain,
~ p(sK2),
inference(backward_subsumption_resolution,[status(thm)],[c_50,c_91]) ).
cnf(c_101,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_98,c_93]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SYO901_11 : TPTP v8.2.0. Released v8.2.0.
% 0.13/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n007.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 May 2 19:53:35 EDT 2024
% 0.14/0.35 % 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.83/1.22 % SZS status Started for theBenchmark.p
% 0.83/1.22 % SZS status Theorem for theBenchmark.p
% 0.83/1.22
% 0.83/1.22 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 0.83/1.22
% 0.83/1.22 ------ iProver source info
% 0.83/1.22
% 0.83/1.22 git: date: 2024-05-02 19:28:25 +0000
% 0.83/1.22 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 0.83/1.22 git: non_committed_changes: false
% 0.83/1.22
% 0.83/1.22 ------ Parsing...
% 0.83/1.22 ------ 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.83/1.22
% 0.83/1.22
% 0.83/1.22 ------ Preprocessing...
% 0.83/1.22
% 0.83/1.22 % SZS status Theorem for theBenchmark.p
% 0.83/1.22
% 0.83/1.22 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.83/1.22
% 0.83/1.22
%------------------------------------------------------------------------------