TSTP Solution File: SYO513^1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO513^1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n017.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 : Thu Jul 21 17:35:16 EDT 2022
% Result : Theorem 0.21s 0.41s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 4
% Syntax : Number of formulae : 31 ( 18 unt; 3 typ; 0 def)
% Number of atoms : 155 ( 35 equ; 0 cnn)
% Maximal formula atoms : 2 ( 5 avg)
% Number of connectives : 188 ( 33 ~; 14 |; 2 &; 135 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 63 ( 63 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 40 ( 0 ^ 32 !; 8 ?; 40 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_sK1_P,type,
sK1_P: ( ( $o > $o ) > $o ) > $o > $o ).
thf(tp_sK2_SY3,type,
sK2_SY3: ( ( $o > $o ) > $o ) > $o ).
thf(tp_sK3_Eigen,type,
sK3_Eigen: ( $o > $o ) > $o ).
thf(1,conjecture,
? [C: ( $o > $o ) > $o] :
! [P: $o > $o] :
( ? [X: $o] : ( P @ X )
=> ( P @ ( C @ P ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',choiceo) ).
thf(2,negated_conjecture,
( ( ? [C: ( $o > $o ) > $o] :
! [P: $o > $o] :
( ? [X: $o] : ( P @ X )
=> ( P @ ( C @ P ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ? [C: ( $o > $o ) > $o] :
! [P: $o > $o] :
( ? [X: $o] : ( P @ X )
=> ( P @ ( C @ P ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ~ ? [C: ( $o > $o ) > $o] :
! [P: $o > $o] :
( ? [X: $o] : ( P @ X )
=> ( P @ ( C @ P ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [C: ( $o > $o ) > $o] :
( ( sK1_P @ C @ ( sK2_SY3 @ C ) )
& ~ ( sK1_P @ C @ ( C @ ( sK1_P @ C ) ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(6,plain,
( ( ! [C: ( $o > $o ) > $o] :
( ( sK1_P @ C @ ( sK2_SY3 @ C ) )
& ~ ( sK1_P @ C @ ( C @ ( sK1_P @ C ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[5]) ).
thf(7,plain,
( ( ! [SX0: ( $o > $o ) > $o] :
~ ( ~ ( sK1_P @ SX0 @ ( sK2_SY3 @ SX0 ) )
| ~ ~ ( sK1_P @ SX0 @ ( SX0 @ ( sK1_P @ SX0 ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(8,plain,
! [SV1: ( $o > $o ) > $o] :
( ( ~ ( ~ ( sK1_P @ SV1 @ ( sK2_SY3 @ SV1 ) )
| ~ ~ ( sK1_P @ SV1 @ ( SV1 @ ( sK1_P @ SV1 ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[7]) ).
thf(9,plain,
! [SV1: ( $o > $o ) > $o] :
( ( ~ ( sK1_P @ SV1 @ ( sK2_SY3 @ SV1 ) )
| ~ ~ ( sK1_P @ SV1 @ ( SV1 @ ( sK1_P @ SV1 ) ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[8]) ).
thf(10,plain,
! [SV1: ( $o > $o ) > $o] :
( ( ~ ( sK1_P @ SV1 @ ( sK2_SY3 @ SV1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[9]) ).
thf(11,plain,
! [SV1: ( $o > $o ) > $o] :
( ( ~ ~ ( sK1_P @ SV1 @ ( SV1 @ ( sK1_P @ SV1 ) ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[9]) ).
thf(12,plain,
! [SV1: ( $o > $o ) > $o] :
( ( sK1_P @ SV1 @ ( sK2_SY3 @ SV1 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[10]) ).
thf(13,plain,
! [SV1: ( $o > $o ) > $o] :
( ( ~ ( sK1_P @ SV1 @ ( SV1 @ ( sK1_P @ SV1 ) ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[11]) ).
thf(14,plain,
! [SV1: ( $o > $o ) > $o] :
( ( sK1_P @ SV1 @ ( SV1 @ ( sK1_P @ SV1 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[13]) ).
thf(15,plain,
( ( sK1_P @ sK3_Eigen @ ( sK3_Eigen @ ( sK1_P @ sK3_Eigen ) ) )
= $false ),
inference(instantiate,[status(thm)],[14:[bind(SV1,$thf( sK3_Eigen ))]]) ).
thf(16,plain,
! [SV1: ( $o > $o ) > $o] :
( ( ~ ~ ! [SV2: $o] :
~ ( sK1_P @ SV1 @ SV2 )
| ( sK1_P @ SV1 @ ( sK3_Eigen @ ( sK1_P @ SV1 ) ) ) )
= $true ),
inference(choice,[status(thm)],[14]) ).
thf(17,plain,
! [SV3: ( $o > $o ) > $o] :
( ( ~ ~ ! [SX0: $o] :
~ ( sK1_P @ SV3 @ SX0 )
| ( sK1_P @ SV3 @ ( sK3_Eigen @ ( sK1_P @ SV3 ) ) ) )
= $true ),
inference(rename,[status(thm)],[16]) ).
thf(18,plain,
! [SV3: ( $o > $o ) > $o] :
( ( ( ~ ~ ! [SX0: $o] :
~ ( sK1_P @ SV3 @ SX0 ) )
= $true )
| ( ( sK1_P @ SV3 @ ( sK3_Eigen @ ( sK1_P @ SV3 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[17]) ).
thf(19,plain,
! [SV3: ( $o > $o ) > $o] :
( ( ( ~ ! [SX0: $o] :
~ ( sK1_P @ SV3 @ SX0 ) )
= $false )
| ( ( sK1_P @ SV3 @ ( sK3_Eigen @ ( sK1_P @ SV3 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[18]) ).
thf(20,plain,
! [SV3: ( $o > $o ) > $o] :
( ( ( ! [SX0: $o] :
~ ( sK1_P @ SV3 @ SX0 ) )
= $true )
| ( ( sK1_P @ SV3 @ ( sK3_Eigen @ ( sK1_P @ SV3 ) ) )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[19]) ).
thf(21,plain,
! [SV4: $o,SV3: ( $o > $o ) > $o] :
( ( ( ~ ( sK1_P @ SV3 @ SV4 ) )
= $true )
| ( ( sK1_P @ SV3 @ ( sK3_Eigen @ ( sK1_P @ SV3 ) ) )
= $true ) ),
inference(extcnf_forall_special_pos,[status(thm)],[20]) ).
thf(22,plain,
! [SV3: ( $o > $o ) > $o] :
( ( ( ~ ( sK1_P @ SV3 @ $true ) )
= $true )
| ( ( sK1_P @ SV3 @ ( sK3_Eigen @ ( sK1_P @ SV3 ) ) )
= $true ) ),
inference(extcnf_forall_special_pos,[status(thm)],[20]) ).
thf(23,plain,
! [SV3: ( $o > $o ) > $o] :
( ( ( ~ ( sK1_P @ SV3 @ $false ) )
= $true )
| ( ( sK1_P @ SV3 @ ( sK3_Eigen @ ( sK1_P @ SV3 ) ) )
= $true ) ),
inference(extcnf_forall_special_pos,[status(thm)],[20]) ).
thf(24,plain,
! [SV4: $o,SV3: ( $o > $o ) > $o] :
( ( ( sK1_P @ SV3 @ SV4 )
= $false )
| ( ( sK1_P @ SV3 @ ( sK3_Eigen @ ( sK1_P @ SV3 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[21]) ).
thf(25,plain,
! [SV3: ( $o > $o ) > $o] :
( ( ( sK1_P @ SV3 @ $true )
= $false )
| ( ( sK1_P @ SV3 @ ( sK3_Eigen @ ( sK1_P @ SV3 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[22]) ).
thf(26,plain,
! [SV3: ( $o > $o ) > $o] :
( ( ( sK1_P @ SV3 @ $false )
= $false )
| ( ( sK1_P @ SV3 @ ( sK3_Eigen @ ( sK1_P @ SV3 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[23]) ).
thf(27,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[12,26,25,24,15,14]) ).
thf(28,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO513^1 : TPTP v8.1.0. Released v4.1.0.
% 0.14/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.15/0.35 % Computer : n017.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 : 600
% 0.15/0.35 % DateTime : Fri Jul 8 22:23:31 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.21/0.35
% 0.21/0.35 No.of.Axioms: 0
% 0.21/0.35
% 0.21/0.35 Length.of.Defs: 0
% 0.21/0.35
% 0.21/0.35 Contains.Choice.Funs: false
% 0.21/0.35 (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.21/0.38 *** Modified list of choice operators: sK3_Eigen ***
% 0.21/0.41
% 0.21/0.41 ********************************
% 0.21/0.41 * All subproblems solved! *
% 0.21/0.41 ********************************
% 0.21/0.41 % 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:27,loop_count:0,foatp_calls:2,translation:fof_full)
% 0.21/0.41
% 0.21/0.41 %**** Beginning of derivation protocol ****
% 0.21/0.41 % SZS output start CNFRefutation
% See solution above
% 0.21/0.41
% 0.21/0.41 %**** End of derivation protocol ****
% 0.21/0.41 %**** no. of clauses in derivation: 28 ****
% 0.21/0.41 %**** clause counter: 27 ****
% 0.21/0.41
% 0.21/0.41 % 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:27,loop_count:0,foatp_calls:2,translation:fof_full)
%------------------------------------------------------------------------------