TSTP Solution File: SEV408^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SEV408^5 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n021.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 : 600s
% DateTime : Tue Jul 19 17:36:35 EDT 2022
% Result : Theorem 0.12s 0.37s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 4
% Syntax : Number of formulae : 28 ( 16 unt; 3 typ; 0 def)
% Number of atoms : 107 ( 32 equ; 0 cnn)
% Maximal formula atoms : 2 ( 4 avg)
% Number of connectives : 248 ( 63 ~; 28 |; 8 &; 141 @)
% ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 82 ( 82 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 52 ( 0 ^ 44 !; 8 ?; 52 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_cF,type,
cF: ( $i > $o ) > $o ).
thf(tp_sK1_A,type,
sK1_A: ( ( $i > $o ) > $o ) > $i > $o ).
thf(tp_sK2_SY5,type,
sK2_SY5: ( $i > $o ) > ( ( $i > $o ) > $o ) > $i ).
thf(1,conjecture,
? [G: ( $i > $o ) > $o] :
! [A: $i > $o] :
( ( G @ A )
=> ? [B: $i > $o] :
( ( cF @ B )
& ! [Xx: $i] :
( ( A @ Xx )
=> ( B @ Xx ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cBLEDSOE2_pme) ).
thf(2,negated_conjecture,
( ( ? [G: ( $i > $o ) > $o] :
! [A: $i > $o] :
( ( G @ A )
=> ? [B: $i > $o] :
( ( cF @ B )
& ! [Xx: $i] :
( ( A @ Xx )
=> ( B @ Xx ) ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ? [G: ( $i > $o ) > $o] :
! [A: $i > $o] :
( ( G @ A )
=> ? [B: $i > $o] :
( ( cF @ B )
& ! [Xx: $i] :
( ( A @ Xx )
=> ( B @ Xx ) ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ~ ? [G: ( $i > $o ) > $o] :
! [A: $i > $o] :
( ( G @ A )
=> ? [B: $i > $o] :
( ( cF @ B )
& ! [Xx: $i] :
( ( A @ Xx )
=> ( B @ Xx ) ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [G: ( $i > $o ) > $o] :
( ( G @ ( sK1_A @ G ) )
& ! [SY4: $i > $o] :
( ( ( sK1_A @ G @ ( sK2_SY5 @ SY4 @ G ) )
& ~ ( SY4 @ ( sK2_SY5 @ SY4 @ G ) ) )
| ~ ( cF @ SY4 ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(6,plain,
( ( ! [G: ( $i > $o ) > $o] :
( ( G @ ( sK1_A @ G ) )
& ! [SY4: $i > $o] :
( ( ( sK1_A @ G @ ( sK2_SY5 @ SY4 @ G ) )
& ~ ( SY4 @ ( sK2_SY5 @ SY4 @ G ) ) )
| ~ ( cF @ SY4 ) ) ) )
= $true ),
inference(copy,[status(thm)],[5]) ).
thf(7,plain,
( ( ! [SX0: ( $i > $o ) > $o] :
~ ( ~ ( SX0 @ ( sK1_A @ SX0 ) )
| ~ ! [SX1: $i > $o] :
( ~ ( ~ ( sK1_A @ SX0 @ ( sK2_SY5 @ SX1 @ SX0 ) )
| ~ ~ ( SX1 @ ( sK2_SY5 @ SX1 @ SX0 ) ) )
| ~ ( cF @ SX1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(8,plain,
! [SV1: ( $i > $o ) > $o] :
( ( ~ ( ~ ( SV1 @ ( sK1_A @ SV1 ) )
| ~ ! [SY6: $i > $o] :
( ~ ( ~ ( sK1_A @ SV1 @ ( sK2_SY5 @ SY6 @ SV1 ) )
| ~ ~ ( SY6 @ ( sK2_SY5 @ SY6 @ SV1 ) ) )
| ~ ( cF @ SY6 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[7]) ).
thf(9,plain,
! [SV1: ( $i > $o ) > $o] :
( ( ~ ( SV1 @ ( sK1_A @ SV1 ) )
| ~ ! [SY6: $i > $o] :
( ~ ( ~ ( sK1_A @ SV1 @ ( sK2_SY5 @ SY6 @ SV1 ) )
| ~ ~ ( SY6 @ ( sK2_SY5 @ SY6 @ SV1 ) ) )
| ~ ( cF @ SY6 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[8]) ).
thf(10,plain,
! [SV1: ( $i > $o ) > $o] :
( ( ~ ( SV1 @ ( sK1_A @ SV1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[9]) ).
thf(11,plain,
! [SV1: ( $i > $o ) > $o] :
( ( ~ ! [SY6: $i > $o] :
( ~ ( ~ ( sK1_A @ SV1 @ ( sK2_SY5 @ SY6 @ SV1 ) )
| ~ ~ ( SY6 @ ( sK2_SY5 @ SY6 @ SV1 ) ) )
| ~ ( cF @ SY6 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[9]) ).
thf(12,plain,
! [SV1: ( $i > $o ) > $o] :
( ( SV1 @ ( sK1_A @ SV1 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[10]) ).
thf(13,plain,
! [SV1: ( $i > $o ) > $o] :
( ( ! [SY6: $i > $o] :
( ~ ( ~ ( sK1_A @ SV1 @ ( sK2_SY5 @ SY6 @ SV1 ) )
| ~ ~ ( SY6 @ ( sK2_SY5 @ SY6 @ SV1 ) ) )
| ~ ( cF @ SY6 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[11]) ).
thf(14,plain,
! [SV2: $i > $o,SV1: ( $i > $o ) > $o] :
( ( ~ ( ~ ( sK1_A @ SV1 @ ( sK2_SY5 @ SV2 @ SV1 ) )
| ~ ~ ( SV2 @ ( sK2_SY5 @ SV2 @ SV1 ) ) )
| ~ ( cF @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[13]) ).
thf(15,plain,
! [SV2: $i > $o,SV1: ( $i > $o ) > $o] :
( ( ( ~ ( ~ ( sK1_A @ SV1 @ ( sK2_SY5 @ SV2 @ SV1 ) )
| ~ ~ ( SV2 @ ( sK2_SY5 @ SV2 @ SV1 ) ) ) )
= $true )
| ( ( ~ ( cF @ SV2 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[14]) ).
thf(16,plain,
! [SV2: $i > $o,SV1: ( $i > $o ) > $o] :
( ( ( ~ ( sK1_A @ SV1 @ ( sK2_SY5 @ SV2 @ SV1 ) )
| ~ ~ ( SV2 @ ( sK2_SY5 @ SV2 @ SV1 ) ) )
= $false )
| ( ( ~ ( cF @ SV2 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[15]) ).
thf(17,plain,
! [SV2: $i > $o,SV1: ( $i > $o ) > $o] :
( ( ( ~ ( sK1_A @ SV1 @ ( sK2_SY5 @ SV2 @ SV1 ) ) )
= $false )
| ( ( ~ ( cF @ SV2 ) )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[16]) ).
thf(18,plain,
! [SV1: ( $i > $o ) > $o,SV2: $i > $o] :
( ( ( ~ ~ ( SV2 @ ( sK2_SY5 @ SV2 @ SV1 ) ) )
= $false )
| ( ( ~ ( cF @ SV2 ) )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[16]) ).
thf(19,plain,
! [SV2: $i > $o,SV1: ( $i > $o ) > $o] :
( ( ( sK1_A @ SV1 @ ( sK2_SY5 @ SV2 @ SV1 ) )
= $true )
| ( ( ~ ( cF @ SV2 ) )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[17]) ).
thf(20,plain,
! [SV1: ( $i > $o ) > $o,SV2: $i > $o] :
( ( ( ~ ( SV2 @ ( sK2_SY5 @ SV2 @ SV1 ) ) )
= $true )
| ( ( ~ ( cF @ SV2 ) )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[18]) ).
thf(21,plain,
! [SV1: ( $i > $o ) > $o,SV2: $i > $o] :
( ( ( cF @ SV2 )
= $false )
| ( ( sK1_A @ SV1 @ ( sK2_SY5 @ SV2 @ SV1 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[19]) ).
thf(22,plain,
! [SV1: ( $i > $o ) > $o,SV2: $i > $o] :
( ( ( SV2 @ ( sK2_SY5 @ SV2 @ SV1 ) )
= $false )
| ( ( ~ ( cF @ SV2 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[20]) ).
thf(23,plain,
! [SV1: ( $i > $o ) > $o,SV2: $i > $o] :
( ( ( cF @ SV2 )
= $false )
| ( ( SV2 @ ( sK2_SY5 @ SV2 @ SV1 ) )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[22]) ).
thf(24,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[12,23,21]) ).
thf(25,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SEV408^5 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.34 % Computer : n021.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 28 16:54:26 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34
% 0.12/0.34 No.of.Axioms: 0
% 0.12/0.34
% 0.12/0.34 Length.of.Defs: 0
% 0.12/0.34
% 0.12/0.34 Contains.Choice.Funs: false
% 0.12/0.34 (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.12/0.37
% 0.12/0.37 ********************************
% 0.12/0.37 * All subproblems solved! *
% 0.12/0.37 ********************************
% 0.12/0.37 % 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:24,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.12/0.37
% 0.12/0.37 %**** Beginning of derivation protocol ****
% 0.12/0.37 % SZS output start CNFRefutation
% See solution above
% 0.12/0.37
% 0.12/0.37 %**** End of derivation protocol ****
% 0.12/0.37 %**** no. of clauses in derivation: 25 ****
% 0.12/0.37 %**** clause counter: 24 ****
% 0.12/0.37
% 0.12/0.37 % 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:24,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------