TSTP Solution File: SEV391^5 by LEO-II---1.7.0

View Problem - Process Solution

```%------------------------------------------------------------------------------
% File     : LEO-II---1.7.0
% Problem  : SEV391^5 : TPTP v6.4.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s

% Computer : n028.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32218.75MB
% OS       : Linux 3.10.0-327.36.3.el7.x86_64
% CPULimit : 300s
% DateTime : Wed Jan 18 14:55:59 EST 2017

% Result   : Theorem 0.07s
% Output   : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   23 (  16 unt;   5 typ;   0 def)
%            Number of atoms       :   73 (  17 equ;   0 cnn)
%            Maximal formula atoms :    3 (   3 avg)
%            Number of connectives :  216 (  19   ~;  15   |;   2   &; 176   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    6 (   6   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    8 (   5 usr;   3 con; 0-3 aty)
%            Number of variables   :   33 (   0   ^  25   !;   8   ?;  33   :)

%------------------------------------------------------------------------------
thf(tp_a,type,
a: \$i ).

thf(tp_cP,type,
cP: \$i > \$i > \$i > \$o ).

thf(tp_h,type,
h: \$i > \$i ).

thf(tp_k,type,
k: \$i > \$i ).

thf(tp_sK1_Xj,type,
sK1_Xj: \$i > \$i ).

thf(1,conjecture,
? [Xv: \$i] :
! [Xj: \$i] :
? [Xq: \$i] :
( ( ( cP @ a @ ( h @ Xj ) @ Xj )
| ( cP @ Xv @ ( k @ Xj ) @ Xj ) )
=> ( cP @ Xv @ Xq @ Xj ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM87_pme) ).

thf(2,negated_conjecture,
( ( ? [Xv: \$i] :
! [Xj: \$i] :
? [Xq: \$i] :
( ( ( cP @ a @ ( h @ Xj ) @ Xj )
| ( cP @ Xv @ ( k @ Xj ) @ Xj ) )
=> ( cP @ Xv @ Xq @ Xj ) ) )
= \$false ),
inference(negate_conjecture,[status(cth)],[1]) ).

thf(3,plain,
( ( ? [Xv: \$i] :
! [Xj: \$i] :
? [Xq: \$i] :
( ( ( cP @ a @ ( h @ Xj ) @ Xj )
| ( cP @ Xv @ ( k @ Xj ) @ Xj ) )
=> ( cP @ Xv @ Xq @ Xj ) ) )
= \$false ),
inference(unfold_def,[status(thm)],[2]) ).

thf(4,plain,
( ( ~ ? [Xv: \$i] :
! [Xj: \$i] :
? [Xq: \$i] :
( ( ( cP @ a @ ( h @ Xj ) @ Xj )
| ( cP @ Xv @ ( k @ Xj ) @ Xj ) )
=> ( cP @ Xv @ Xq @ Xj ) ) )
= \$true ),
inference(polarity_switch,[status(thm)],[3]) ).

thf(5,plain,
( ( ! [Xv: \$i] :
( ( ( cP @ a @ ( h @ ( sK1_Xj @ Xv ) ) @ ( sK1_Xj @ Xv ) )
| ( cP @ Xv @ ( k @ ( sK1_Xj @ Xv ) ) @ ( sK1_Xj @ Xv ) ) )
& ! [SY3: \$i] :
~ ( cP @ Xv @ SY3 @ ( sK1_Xj @ Xv ) ) ) )
= \$true ),
inference(extcnf_combined,[status(esa)],[4]) ).

thf(6,plain,
( ( ! [Xv: \$i] :
( ( ( cP @ a @ ( h @ ( sK1_Xj @ Xv ) ) @ ( sK1_Xj @ Xv ) )
| ( cP @ Xv @ ( k @ ( sK1_Xj @ Xv ) ) @ ( sK1_Xj @ Xv ) ) )
& ! [SY3: \$i] :
~ ( cP @ Xv @ SY3 @ ( sK1_Xj @ Xv ) ) ) )
= \$true ),
inference(copy,[status(thm)],[5]) ).

thf(7,plain,
( ( ! [SX0: \$i] :
~ ( ~ ( ( cP @ a @ ( h @ ( sK1_Xj @ SX0 ) ) @ ( sK1_Xj @ SX0 ) )
| ( cP @ SX0 @ ( k @ ( sK1_Xj @ SX0 ) ) @ ( sK1_Xj @ SX0 ) ) )
| ~ ! [SX1: \$i] :
~ ( cP @ SX0 @ SX1 @ ( sK1_Xj @ SX0 ) ) ) )
= \$true ),
inference(unfold_def,[status(thm)],[6]) ).

thf(8,plain,
! [SV1: \$i] :
( ( ~ ( ~ ( ( cP @ a @ ( h @ ( sK1_Xj @ SV1 ) ) @ ( sK1_Xj @ SV1 ) )
| ( cP @ SV1 @ ( k @ ( sK1_Xj @ SV1 ) ) @ ( sK1_Xj @ SV1 ) ) )
| ~ ! [SY4: \$i] :
~ ( cP @ SV1 @ SY4 @ ( sK1_Xj @ SV1 ) ) ) )
= \$true ),
inference(extcnf_forall_pos,[status(thm)],[7]) ).

thf(9,plain,
! [SV1: \$i] :
( ( ~ ( ( cP @ a @ ( h @ ( sK1_Xj @ SV1 ) ) @ ( sK1_Xj @ SV1 ) )
| ( cP @ SV1 @ ( k @ ( sK1_Xj @ SV1 ) ) @ ( sK1_Xj @ SV1 ) ) )
| ~ ! [SY4: \$i] :
~ ( cP @ SV1 @ SY4 @ ( sK1_Xj @ SV1 ) ) )
= \$false ),
inference(extcnf_not_pos,[status(thm)],[8]) ).

thf(10,plain,
! [SV1: \$i] :
( ( ~ ( ( cP @ a @ ( h @ ( sK1_Xj @ SV1 ) ) @ ( sK1_Xj @ SV1 ) )
| ( cP @ SV1 @ ( k @ ( sK1_Xj @ SV1 ) ) @ ( sK1_Xj @ SV1 ) ) ) )
= \$false ),
inference(extcnf_or_neg,[status(thm)],[9]) ).

thf(11,plain,
! [SV1: \$i] :
( ( ~ ! [SY4: \$i] :
~ ( cP @ SV1 @ SY4 @ ( sK1_Xj @ SV1 ) ) )
= \$false ),
inference(extcnf_or_neg,[status(thm)],[9]) ).

thf(12,plain,
! [SV1: \$i] :
( ( ( cP @ a @ ( h @ ( sK1_Xj @ SV1 ) ) @ ( sK1_Xj @ SV1 ) )
| ( cP @ SV1 @ ( k @ ( sK1_Xj @ SV1 ) ) @ ( sK1_Xj @ SV1 ) ) )
= \$true ),
inference(extcnf_not_neg,[status(thm)],[10]) ).

thf(13,plain,
! [SV1: \$i] :
( ( ! [SY4: \$i] :
~ ( cP @ SV1 @ SY4 @ ( sK1_Xj @ SV1 ) ) )
= \$true ),
inference(extcnf_not_neg,[status(thm)],[11]) ).

thf(14,plain,
! [SV1: \$i] :
( ( ( cP @ a @ ( h @ ( sK1_Xj @ SV1 ) ) @ ( sK1_Xj @ SV1 ) )
= \$true )
| ( ( cP @ SV1 @ ( k @ ( sK1_Xj @ SV1 ) ) @ ( sK1_Xj @ SV1 ) )
= \$true ) ),
inference(extcnf_or_pos,[status(thm)],[12]) ).

thf(15,plain,
! [SV2: \$i,SV1: \$i] :
( ( ~ ( cP @ SV1 @ SV2 @ ( sK1_Xj @ SV1 ) ) )
= \$true ),
inference(extcnf_forall_pos,[status(thm)],[13]) ).

thf(16,plain,
! [SV2: \$i,SV1: \$i] :
( ( cP @ SV1 @ SV2 @ ( sK1_Xj @ SV1 ) )
= \$false ),
inference(extcnf_not_pos,[status(thm)],[15]) ).

thf(17,plain,
\$false = \$true,
inference(fo_atp_e,[status(thm)],[14,16]) ).

thf(18,plain,
\$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[17]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV391^5 : TPTP v6.4.0. Released v4.0.0.
% 0.00/0.04  % Command  : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.03/0.23  % Computer : n028.star.cs.uiowa.edu
% 0.03/0.23  % Model    : x86_64 x86_64
% 0.03/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.03/0.23  % Memory   : 32218.75MB
% 0.03/0.23  % OS       : Linux 3.10.0-327.36.3.el7.x86_64
% 0.03/0.23  % CPULimit : 300
% 0.03/0.23  % DateTime : Mon Jan 16 00:23:47 CST 2017
% 0.07/0.23  % CPUTime  :
% 0.07/0.24
% 0.07/0.24   No.of.Axioms: 0
% 0.07/0.24
% 0.07/0.24   Length.of.Defs: 0
% 0.07/0.24
% 0.07/0.24   Contains.Choice.Funs: false
% 0.07/0.24  (rf:0,axioms:0,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:2,loop_count:0,foatp_calls:0,translation:fof_full).
% 0.07/0.25
% 0.07/0.25  ********************************
% 0.07/0.25  *   All subproblems solved!    *
% 0.07/0.25  ********************************
% 0.07/0.25  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:0,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:17,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.07/0.26
% 0.07/0.26  %**** Beginning of derivation protocol ****
% 0.07/0.26  % SZS output start CNFRefutation
% See solution above
% 0.07/0.26  % SZS output end CNFRefutation
% 0.07/0.26
% 0.07/0.26  %**** End of derivation protocol ****
% 0.07/0.26  %**** no. of clauses in derivation: 18 ****
% 0.07/0.26  %**** clause counter: 17 ****
% 0.07/0.26
% 0.07/0.26  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:0,ps:3,u:6,ude:true,rLeibEQ:true,rAndEQ:true,use_choice:true,use_extuni:true,use_extcnf_combined:true,expand_extuni:false,foatp:e,atp_timeout:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:17,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------
```