TSTP Solution File: SEU957^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SEU957^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 : n032.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 12:15:53 EDT 2022
% Result : Theorem 0.07s 0.29s
% Output : CNFRefutation 0.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 8
% Syntax : Number of formulae : 35 ( 24 unt; 7 typ; 0 def)
% Number of atoms : 92 ( 61 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 143 ( 23 ~; 9 |; 2 &; 94 @)
% ( 0 <=>; 15 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 45 ( 45 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 64 ( 0 ^ 43 !; 21 ?; 64 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $tType ).
thf(tp_b,type,
b: $tType ).
thf(tp_sK1_Xx,type,
sK1_Xx: ( b > a ) > b ).
thf(tp_sK2_SY9,type,
sK2_SY9: ( b > a ) > b ).
thf(tp_sK3_Xc,type,
sK3_Xc: ( a > $o ) > a ).
thf(tp_sK4_Xg,type,
sK4_Xg: a > b ).
thf(tp_sK5_SY13,type,
sK5_SY13: b > a ).
thf(1,conjecture,
( ? [Xc: ( a > $o ) > a] :
! [X: a > $o] :
( ? [Xt: a] : ( X @ Xt )
=> ( X @ ( Xc @ X ) ) )
=> ( ? [Xg: a > b] :
! [Y: b] :
? [X: a] :
( ( Xg @ X )
= Y )
=> ? [Xf: b > a] :
! [Xx: b,Xy: b] :
( ( ( Xf @ Xx )
= ( Xf @ Xy ) )
=> ( Xx = Xy ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM607_pme) ).
thf(2,negated_conjecture,
( ( ? [Xc: ( a > $o ) > a] :
! [X: a > $o] :
( ? [Xt: a] : ( X @ Xt )
=> ( X @ ( Xc @ X ) ) )
=> ( ? [Xg: a > b] :
! [Y: b] :
? [X: a] :
( ( Xg @ X )
= Y )
=> ? [Xf: b > a] :
! [Xx: b,Xy: b] :
( ( ( Xf @ Xx )
= ( Xf @ Xy ) )
=> ( Xx = Xy ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ? [Xc: ( a > $o ) > a] :
! [X: a > $o] :
( ? [Xt: a] : ( X @ Xt )
=> ( X @ ( Xc @ X ) ) )
=> ( ? [Xg: a > b] :
! [Y: b] :
? [X: a] :
( ( Xg @ X )
= Y )
=> ? [Xf: b > a] :
! [Xx: b,Xy: b] :
( ( ( Xf @ Xx )
= ( Xf @ Xy ) )
=> ( Xx = Xy ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ? [Xc: ( a > $o ) > a] :
! [X: a > $o] :
( ? [Xt: a] : ( X @ Xt )
=> ( X @ ( Xc @ X ) ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ? [Xg: a > b] :
! [Y: b] :
? [X: a] :
( ( Xg @ X )
= Y ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ? [Xf: b > a] :
! [Xx: b,Xy: b] :
( ( ( Xf @ Xx )
= ( Xf @ Xy ) )
=> ( Xx = Xy ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(7,plain,
( ( ~ ? [Xf: b > a] :
! [Xx: b,Xy: b] :
( ( ( Xf @ Xx )
= ( Xf @ Xy ) )
=> ( Xx = Xy ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(8,plain,
( ( ! [Xf: b > a] :
( ( ( Xf @ ( sK1_Xx @ Xf ) )
= ( Xf @ ( sK2_SY9 @ Xf ) ) )
& ( ( sK1_Xx @ Xf )
!= ( sK2_SY9 @ Xf ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[7]) ).
thf(9,plain,
( ( ! [SY10: a > $o] :
( ! [Xt: a] :
~ ( SY10 @ Xt )
| ( SY10 @ ( sK3_Xc @ SY10 ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(10,plain,
( ( ! [SY12: b] :
( ( sK4_Xg @ ( sK5_SY13 @ SY12 ) )
= SY12 ) )
= $true ),
inference(extcnf_combined,[status(esa)],[5]) ).
thf(11,plain,
( ( ! [SY12: b] :
( ( sK4_Xg @ ( sK5_SY13 @ SY12 ) )
= SY12 ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(12,plain,
( ( ! [SY10: a > $o] :
( ! [Xt: a] :
~ ( SY10 @ Xt )
| ( SY10 @ ( sK3_Xc @ SY10 ) ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(13,plain,
( ( ! [Xf: b > a] :
( ( ( Xf @ ( sK1_Xx @ Xf ) )
= ( Xf @ ( sK2_SY9 @ Xf ) ) )
& ( ( sK1_Xx @ Xf )
!= ( sK2_SY9 @ Xf ) ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(14,plain,
( ( ! [SX0: b > a] :
~ ( ( ( SX0 @ ( sK1_Xx @ SX0 ) )
!= ( SX0 @ ( sK2_SY9 @ SX0 ) ) )
| ~ ( ( ( sK1_Xx @ SX0 )
!= ( sK2_SY9 @ SX0 ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[13]) ).
thf(15,plain,
! [SV1: b] :
( ( ( sK4_Xg @ ( sK5_SY13 @ SV1 ) )
= SV1 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[11]) ).
thf(16,plain,
! [SV2: a > $o] :
( ( ! [SY14: a] :
~ ( SV2 @ SY14 )
| ( SV2 @ ( sK3_Xc @ SV2 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[12]) ).
thf(17,plain,
! [SV3: b > a] :
( ( ~ ( ( ( SV3 @ ( sK1_Xx @ SV3 ) )
!= ( SV3 @ ( sK2_SY9 @ SV3 ) ) )
| ~ ( ( ( sK1_Xx @ SV3 )
!= ( sK2_SY9 @ SV3 ) ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[14]) ).
thf(18,plain,
! [SV2: a > $o] :
( ( ( ! [SY14: a] :
~ ( SV2 @ SY14 ) )
= $true )
| ( ( SV2 @ ( sK3_Xc @ SV2 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[16]) ).
thf(19,plain,
! [SV3: b > a] :
( ( ( ( SV3 @ ( sK1_Xx @ SV3 ) )
!= ( SV3 @ ( sK2_SY9 @ SV3 ) ) )
| ~ ( ( ( sK1_Xx @ SV3 )
!= ( sK2_SY9 @ SV3 ) ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[17]) ).
thf(20,plain,
! [SV4: a,SV2: a > $o] :
( ( ( ~ ( SV2 @ SV4 ) )
= $true )
| ( ( SV2 @ ( sK3_Xc @ SV2 ) )
= $true ) ),
inference(extcnf_forall_pos,[status(thm)],[18]) ).
thf(21,plain,
! [SV3: b > a] :
( ( ( ( SV3 @ ( sK1_Xx @ SV3 ) )
!= ( SV3 @ ( sK2_SY9 @ SV3 ) ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[19]) ).
thf(22,plain,
! [SV3: b > a] :
( ( ~ ( ( ( sK1_Xx @ SV3 )
!= ( sK2_SY9 @ SV3 ) ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[19]) ).
thf(23,plain,
! [SV4: a,SV2: a > $o] :
( ( ( SV2 @ SV4 )
= $false )
| ( ( SV2 @ ( sK3_Xc @ SV2 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[20]) ).
thf(24,plain,
! [SV3: b > a] :
( ( ( SV3 @ ( sK1_Xx @ SV3 ) )
= ( SV3 @ ( sK2_SY9 @ SV3 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[21]) ).
thf(25,plain,
! [SV3: b > a] :
( ( ( ( sK1_Xx @ SV3 )
!= ( sK2_SY9 @ SV3 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[22]) ).
thf(26,plain,
! [SV3: b > a] :
( ( ( sK1_Xx @ SV3 )
= ( sK2_SY9 @ SV3 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[25]) ).
thf(27,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[15,26,24,23]) ).
thf(28,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.08 % Problem : SEU957^5 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.08 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 600
% 0.07/0.27 % DateTime : Mon Jun 20 12:51:49 EDT 2022
% 0.07/0.27 % CPUTime :
% 0.07/0.27
% 0.07/0.27 No.of.Axioms: 0
% 0.07/0.27
% 0.07/0.27 Length.of.Defs: 0
% 0.07/0.27
% 0.07/0.27 Contains.Choice.Funs: false
% 0.07/0.27 (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.29
% 0.07/0.29 ********************************
% 0.07/0.29 * All subproblems solved! *
% 0.07/0.29 ********************************
% 0.07/0.29 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:2,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:1,translation:fof_full)
% 0.07/0.29
% 0.07/0.29 %**** Beginning of derivation protocol ****
% 0.07/0.29 % SZS output start CNFRefutation
% See solution above
% 0.07/0.29
% 0.07/0.29 %**** End of derivation protocol ****
% 0.07/0.29 %**** no. of clauses in derivation: 28 ****
% 0.07/0.29 %**** clause counter: 27 ****
% 0.07/0.29
% 0.07/0.29 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:2,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:1,translation:fof_full)
%------------------------------------------------------------------------------