TSTP Solution File: SYO265^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO265^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 : n003.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:33:04 EDT 2022
% Result : Theorem 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 5
% Syntax : Number of formulae : 41 ( 18 unt; 4 typ; 0 def)
% Number of atoms : 231 ( 172 equ; 0 cnn)
% Maximal formula atoms : 3 ( 6 avg)
% Number of connectives : 187 ( 127 ~; 53 |; 5 &; 2 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 3 usr; 5 con; 0-2 aty)
% Number of variables : 48 ( 18 ^ 25 !; 5 ?; 48 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $tType ).
thf(tp_sK1_SV1,type,
sK1_SV1: a ).
thf(tp_sK2_SY7,type,
sK2_SY7: a ).
thf(tp_x,type,
x: a ).
thf(1,conjecture,
( ( ^ [Xx: a,Xy: a] : ( Xx = Xy )
@ x )
= ( ^ [Xz: a] :
? [Xy: a] :
( ( Xy = x )
& ( Xz = Xy ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cX5210) ).
thf(2,negated_conjecture,
( ( ( ^ [Xx: a,Xy: a] : ( Xx = Xy )
@ x )
= ( ^ [Xz: a] :
? [Xy: a] :
( ( Xy = x )
& ( Xz = Xy ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ( ^ [SY0: a] : ( x = SY0 ) )
= ( ^ [Xz: a] :
? [Xy: a] :
( ( Xy = x )
& ( Xz = Xy ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ( ( ^ [SY0: a] : ( x = SY0 ) )
!= ( ^ [Xz: a] :
? [Xy: a] :
( ( Xy = x )
& ( Xz = Xy ) ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[3]) ).
thf(5,plain,
( ( ( ( ^ [SY0: a] : ( x = SY0 ) )
!= ( ^ [Xz: a] :
? [Xy: a] :
( ( Xy = x )
& ( Xz = Xy ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(6,plain,
( ( ( ( ^ [SX0: a] : ( x = SX0 ) )
!= ( ^ [SX0: a] :
~ ! [SX1: a] :
~ ~ ( ( SX1 != x )
| ( SX0 != SX1 ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(7,plain,
( ( ( ^ [SX0: a] : ( x = SX0 ) )
= ( ^ [SX0: a] :
~ ! [SX1: a] :
~ ~ ( ( SX1 != x )
| ( SX0 != SX1 ) ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[6]) ).
thf(8,plain,
( ( ! [SV1: a] :
( ( x = SV1 )
= ( ~ ! [SY6: a] :
~ ~ ( ( SY6 != x )
| ( SV1 != SY6 ) ) ) ) )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[7]) ).
thf(9,plain,
( ( ( ^ [SX0: a] : ( x = SX0 ) )
= ( ^ [SX0: a] :
~ ! [SX1: a] :
~ ~ ( ( SX1 != x )
| ( SX0 != SX1 ) ) ) )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[7]) ).
thf(10,plain,
( ( ( x = sK1_SV1 )
= ( ~ ! [SY7: a] :
~ ~ ( ( SY7 != x )
| ( sK1_SV1 != SY7 ) ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[8]) ).
thf(11,plain,
( ( ~ ( ( x = sK1_SV1 )
| ~ ! [SY7: a] :
~ ~ ( ( SY7 != x )
| ( sK1_SV1 != SY7 ) ) )
| ~ ( ( x != sK1_SV1 )
| ~ ~ ! [SY7: a] :
~ ~ ( ( SY7 != x )
| ( sK1_SV1 != SY7 ) ) ) )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[10]) ).
thf(12,plain,
( ( ( x = sK1_SV1 )
= ( ~ ! [SY7: a] :
~ ~ ( ( SY7 != x )
| ( sK1_SV1 != SY7 ) ) ) )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[10]) ).
thf(13,plain,
( ( ~ ( ( x = sK1_SV1 )
| ~ ! [SY7: a] :
~ ~ ( ( SY7 != x )
| ( sK1_SV1 != SY7 ) ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[11]) ).
thf(14,plain,
( ( ~ ( ( x != sK1_SV1 )
| ~ ~ ! [SY7: a] :
~ ~ ( ( SY7 != x )
| ( sK1_SV1 != SY7 ) ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[11]) ).
thf(15,plain,
( ( ( x = sK1_SV1 )
| ~ ! [SY7: a] :
~ ~ ( ( SY7 != x )
| ( sK1_SV1 != SY7 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[13]) ).
thf(16,plain,
( ( ( x != sK1_SV1 )
| ~ ~ ! [SY7: a] :
~ ~ ( ( SY7 != x )
| ( sK1_SV1 != SY7 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[14]) ).
thf(17,plain,
( ( ( x = sK1_SV1 )
= $true )
| ( ( ~ ! [SY7: a] :
~ ~ ( ( SY7 != x )
| ( sK1_SV1 != SY7 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[15]) ).
thf(18,plain,
( ( ( ( x != sK1_SV1 ) )
= $true )
| ( ( ~ ~ ! [SY7: a] :
~ ~ ( ( SY7 != x )
| ( sK1_SV1 != SY7 ) ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[16]) ).
thf(19,plain,
( ( ( ! [SY7: a] :
~ ~ ( ( SY7 != x )
| ( sK1_SV1 != SY7 ) ) )
= $false )
| ( ( x = sK1_SV1 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[17]) ).
thf(20,plain,
( ( ( x = sK1_SV1 )
= $false )
| ( ( ~ ~ ! [SY7: a] :
~ ~ ( ( SY7 != x )
| ( sK1_SV1 != SY7 ) ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[18]) ).
thf(21,plain,
( ( ( ~ ~ ( ( sK2_SY7 != x )
| ( sK1_SV1 != sK2_SY7 ) ) )
= $false )
| ( ( x = sK1_SV1 )
= $true ) ),
inference(extcnf_forall_neg,[status(esa)],[19]) ).
thf(22,plain,
( ( ( ~ ! [SY7: a] :
~ ~ ( ( SY7 != x )
| ( sK1_SV1 != SY7 ) ) )
= $false )
| ( ( x = sK1_SV1 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[20]) ).
thf(23,plain,
( ( ( ~ ( ( sK2_SY7 != x )
| ( sK1_SV1 != sK2_SY7 ) ) )
= $true )
| ( ( x = sK1_SV1 )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[21]) ).
thf(24,plain,
( ( ( ! [SY7: a] :
~ ~ ( ( SY7 != x )
| ( sK1_SV1 != SY7 ) ) )
= $true )
| ( ( x = sK1_SV1 )
= $false ) ),
inference(extcnf_not_neg,[status(thm)],[22]) ).
thf(25,plain,
( ( ( ( sK2_SY7 != x )
| ( sK1_SV1 != sK2_SY7 ) )
= $false )
| ( ( x = sK1_SV1 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[23]) ).
thf(26,plain,
! [SV2: a] :
( ( ( ~ ~ ( ( SV2 != x )
| ( sK1_SV1 != SV2 ) ) )
= $true )
| ( ( x = sK1_SV1 )
= $false ) ),
inference(extcnf_forall_pos,[status(thm)],[24]) ).
thf(27,plain,
( ( ( ( sK2_SY7 != x ) )
= $false )
| ( ( x = sK1_SV1 )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[25]) ).
thf(28,plain,
( ( ( ( sK1_SV1 != sK2_SY7 ) )
= $false )
| ( ( x = sK1_SV1 )
= $true ) ),
inference(extcnf_or_neg,[status(thm)],[25]) ).
thf(29,plain,
! [SV2: a] :
( ( ( ~ ( ( SV2 != x )
| ( sK1_SV1 != SV2 ) ) )
= $false )
| ( ( x = sK1_SV1 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[26]) ).
thf(30,plain,
( ( ( sK2_SY7 = x )
= $true )
| ( ( x = sK1_SV1 )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[27]) ).
thf(31,plain,
( ( ( sK1_SV1 = sK2_SY7 )
= $true )
| ( ( x = sK1_SV1 )
= $true ) ),
inference(extcnf_not_neg,[status(thm)],[28]) ).
thf(32,plain,
! [SV2: a] :
( ( ( ( SV2 != x )
| ( sK1_SV1 != SV2 ) )
= $true )
| ( ( x = sK1_SV1 )
= $false ) ),
inference(extcnf_not_neg,[status(thm)],[29]) ).
thf(33,plain,
! [SV2: a] :
( ( ( ( SV2 != x ) )
= $true )
| ( ( ( sK1_SV1 != SV2 ) )
= $true )
| ( ( x = sK1_SV1 )
= $false ) ),
inference(extcnf_or_pos,[status(thm)],[32]) ).
thf(34,plain,
! [SV2: a] :
( ( ( SV2 = x )
= $false )
| ( ( ( sK1_SV1 != SV2 ) )
= $true )
| ( ( x = sK1_SV1 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[33]) ).
thf(35,plain,
! [SV2: a] :
( ( ( sK1_SV1 = SV2 )
= $false )
| ( ( SV2 = x )
= $false )
| ( ( x = sK1_SV1 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[34]) ).
thf(36,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[9,35,31,30,12]) ).
thf(37,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[36]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SYO265^5 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n003.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jul 9 11:17:58 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.13/0.35
% 0.13/0.35 No.of.Axioms: 0
% 0.13/0.35
% 0.13/0.35 Length.of.Defs: 0
% 0.13/0.35
% 0.13/0.35 Contains.Choice.Funs: false
% 0.13/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.13/0.38
% 0.13/0.38 ********************************
% 0.13/0.38 * All subproblems solved! *
% 0.13/0.38 ********************************
% 0.13/0.38 % 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:36,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.13/0.38
% 0.13/0.38 %**** Beginning of derivation protocol ****
% 0.13/0.38 % SZS output start CNFRefutation
% See solution above
% 0.13/0.38
% 0.13/0.38 %**** End of derivation protocol ****
% 0.13/0.38 %**** no. of clauses in derivation: 37 ****
% 0.13/0.38 %**** clause counter: 36 ****
% 0.13/0.38
% 0.13/0.38 % 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:36,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------