TSTP Solution File: SYO217^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO217^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 : n007.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:32:48 EDT 2022
% Result : Theorem 0.15s 0.40s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 7
% Syntax : Number of formulae : 50 ( 36 unt; 6 typ; 0 def)
% Number of atoms : 208 ( 66 equ; 0 cnn)
% Maximal formula atoms : 2 ( 4 avg)
% Number of connectives : 248 ( 40 ~; 33 |; 2 &; 162 @)
% ( 6 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 2 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 18 ( 18 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 4 con; 0-2 aty)
% Number of variables : 61 ( 0 ^ 61 !; 0 ?; 61 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_a,type,
a: $tType ).
thf(tp_b,type,
b: $tType ).
thf(tp_sK1_Xr,type,
sK1_Xr: b > a > $o ).
thf(tp_sK2_SY4,type,
sK2_SY4: b > a > $o ).
thf(tp_sK3_SV1,type,
sK3_SV1: b ).
thf(tp_sK4_SV2,type,
sK4_SV2: a ).
thf(1,conjecture,
! [Xr: b > a > $o,Xs: b > a > $o] :
( ! [Xx: b,Xy: a] :
( ( Xr @ Xx @ Xy )
<=> ( Xs @ Xx @ Xy ) )
=> ( Xr = Xs ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM174) ).
thf(2,negated_conjecture,
( ( ! [Xr: b > a > $o,Xs: b > a > $o] :
( ! [Xx: b,Xy: a] :
( ( Xr @ Xx @ Xy )
<=> ( Xs @ Xx @ Xy ) )
=> ( Xr = Xs ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [Xr: b > a > $o,Xs: b > a > $o] :
( ! [Xx: b,Xy: a] :
( ( Xr @ Xx @ Xy )
<=> ( Xs @ Xx @ Xy ) )
=> ( Xr = Xs ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [SY4: b > a > $o] :
( ! [SY5: b,SY6: a] :
( ( sK1_Xr @ SY5 @ SY6 )
<=> ( SY4 @ SY5 @ SY6 ) )
=> ( sK1_Xr = SY4 ) ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[3]) ).
thf(5,plain,
( ( ! [SY7: b,SY8: a] :
( ( sK1_Xr @ SY7 @ SY8 )
<=> ( sK2_SY4 @ SY7 @ SY8 ) )
=> ( sK1_Xr = sK2_SY4 ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[4]) ).
thf(6,plain,
( ( ! [SY7: b,SY8: a] :
( ( sK1_Xr @ SY7 @ SY8 )
<=> ( sK2_SY4 @ SY7 @ SY8 ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[5]) ).
thf(7,plain,
( ( sK1_Xr = sK2_SY4 )
= $false ),
inference(standard_cnf,[status(thm)],[5]) ).
thf(8,plain,
( ( ( sK1_Xr != sK2_SY4 ) )
= $true ),
inference(polarity_switch,[status(thm)],[7]) ).
thf(9,plain,
( ( ! [SY7: b,SY8: a] :
( ~ ( sK1_Xr @ SY7 @ SY8 )
| ( sK2_SY4 @ SY7 @ SY8 ) )
& ! [SY7: b,SY8: a] :
( ~ ( sK2_SY4 @ SY7 @ SY8 )
| ( sK1_Xr @ SY7 @ SY8 ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(10,plain,
( ( ! [SY7: b,SY8: a] :
( ~ ( sK1_Xr @ SY7 @ SY8 )
| ( sK2_SY4 @ SY7 @ SY8 ) )
& ! [SY7: b,SY8: a] :
( ~ ( sK2_SY4 @ SY7 @ SY8 )
| ( sK1_Xr @ SY7 @ SY8 ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(11,plain,
( ( ( sK1_Xr != sK2_SY4 ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(12,plain,
( ( ~ ( ~ ! [SX0: b,SX1: a] :
( ~ ( sK1_Xr @ SX0 @ SX1 )
| ( sK2_SY4 @ SX0 @ SX1 ) )
| ~ ! [SX0: b,SX1: a] :
( ~ ( sK2_SY4 @ SX0 @ SX1 )
| ( sK1_Xr @ SX0 @ SX1 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(13,plain,
( ( sK1_Xr = sK2_SY4 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(14,plain,
( ( ~ ! [SX0: b,SX1: a] :
( ~ ( sK1_Xr @ SX0 @ SX1 )
| ( sK2_SY4 @ SX0 @ SX1 ) )
| ~ ! [SX0: b,SX1: a] :
( ~ ( sK2_SY4 @ SX0 @ SX1 )
| ( sK1_Xr @ SX0 @ SX1 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[12]) ).
thf(15,plain,
( ( ! [SV1: b] :
( ( sK1_Xr @ SV1 )
= ( sK2_SY4 @ SV1 ) ) )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[13]) ).
thf(16,plain,
( ( sK1_Xr = sK2_SY4 )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[13]) ).
thf(17,plain,
( ( ~ ! [SX0: b,SX1: a] :
( ~ ( sK1_Xr @ SX0 @ SX1 )
| ( sK2_SY4 @ SX0 @ SX1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[14]) ).
thf(18,plain,
( ( ~ ! [SX0: b,SX1: a] :
( ~ ( sK2_SY4 @ SX0 @ SX1 )
| ( sK1_Xr @ SX0 @ SX1 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[14]) ).
thf(19,plain,
( ( ( sK1_Xr @ sK3_SV1 )
= ( sK2_SY4 @ sK3_SV1 ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[15]) ).
thf(20,plain,
( ( ! [SX0: b,SX1: a] :
( ~ ( sK1_Xr @ SX0 @ SX1 )
| ( sK2_SY4 @ SX0 @ SX1 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[17]) ).
thf(21,plain,
( ( ! [SX0: b,SX1: a] :
( ~ ( sK2_SY4 @ SX0 @ SX1 )
| ( sK1_Xr @ SX0 @ SX1 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[18]) ).
thf(22,plain,
( ( ! [SV2: a] :
( ( sK1_Xr @ sK3_SV1 @ SV2 )
= ( sK2_SY4 @ sK3_SV1 @ SV2 ) ) )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[19]) ).
thf(23,plain,
( ( ( sK1_Xr @ sK3_SV1 )
= ( sK2_SY4 @ sK3_SV1 ) )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[19]) ).
thf(24,plain,
! [SV3: b] :
( ( ! [SY9: a] :
( ~ ( sK1_Xr @ SV3 @ SY9 )
| ( sK2_SY4 @ SV3 @ SY9 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(25,plain,
! [SV4: b] :
( ( ! [SY10: a] :
( ~ ( sK2_SY4 @ SV4 @ SY10 )
| ( sK1_Xr @ SV4 @ SY10 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[21]) ).
thf(26,plain,
( ( ( sK1_Xr @ sK3_SV1 @ sK4_SV2 )
= ( sK2_SY4 @ sK3_SV1 @ sK4_SV2 ) )
= $false ),
inference(extcnf_forall_neg,[status(esa)],[22]) ).
thf(27,plain,
! [SV5: a,SV3: b] :
( ( ~ ( sK1_Xr @ SV3 @ SV5 )
| ( sK2_SY4 @ SV3 @ SV5 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[24]) ).
thf(28,plain,
! [SV6: a,SV4: b] :
( ( ~ ( sK2_SY4 @ SV4 @ SV6 )
| ( sK1_Xr @ SV4 @ SV6 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[25]) ).
thf(29,plain,
( ( ~ ( ( sK1_Xr @ sK3_SV1 @ sK4_SV2 )
| ( sK2_SY4 @ sK3_SV1 @ sK4_SV2 ) )
| ~ ( ~ ( sK1_Xr @ sK3_SV1 @ sK4_SV2 )
| ~ ( sK2_SY4 @ sK3_SV1 @ sK4_SV2 ) ) )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[26]) ).
thf(30,plain,
( ( ( sK1_Xr @ sK3_SV1 @ sK4_SV2 )
= ( sK2_SY4 @ sK3_SV1 @ sK4_SV2 ) )
= $false ),
inference(extcnf_equal_neg,[status(thm)],[26]) ).
thf(31,plain,
! [SV5: a,SV3: b] :
( ( ( ~ ( sK1_Xr @ SV3 @ SV5 ) )
= $true )
| ( ( sK2_SY4 @ SV3 @ SV5 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[27]) ).
thf(32,plain,
! [SV6: a,SV4: b] :
( ( ( ~ ( sK2_SY4 @ SV4 @ SV6 ) )
= $true )
| ( ( sK1_Xr @ SV4 @ SV6 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[28]) ).
thf(33,plain,
( ( ~ ( ( sK1_Xr @ sK3_SV1 @ sK4_SV2 )
| ( sK2_SY4 @ sK3_SV1 @ sK4_SV2 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[29]) ).
thf(34,plain,
( ( ~ ( ~ ( sK1_Xr @ sK3_SV1 @ sK4_SV2 )
| ~ ( sK2_SY4 @ sK3_SV1 @ sK4_SV2 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[29]) ).
thf(35,plain,
! [SV5: a,SV3: b] :
( ( ( sK1_Xr @ SV3 @ SV5 )
= $false )
| ( ( sK2_SY4 @ SV3 @ SV5 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[31]) ).
thf(36,plain,
! [SV6: a,SV4: b] :
( ( ( sK2_SY4 @ SV4 @ SV6 )
= $false )
| ( ( sK1_Xr @ SV4 @ SV6 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[32]) ).
thf(37,plain,
( ( ( sK1_Xr @ sK3_SV1 @ sK4_SV2 )
| ( sK2_SY4 @ sK3_SV1 @ sK4_SV2 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[33]) ).
thf(38,plain,
( ( ~ ( sK1_Xr @ sK3_SV1 @ sK4_SV2 )
| ~ ( sK2_SY4 @ sK3_SV1 @ sK4_SV2 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[34]) ).
thf(39,plain,
( ( ( sK1_Xr @ sK3_SV1 @ sK4_SV2 )
= $true )
| ( ( sK2_SY4 @ sK3_SV1 @ sK4_SV2 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[37]) ).
thf(40,plain,
( ( ( ~ ( sK1_Xr @ sK3_SV1 @ sK4_SV2 ) )
= $true )
| ( ( ~ ( sK2_SY4 @ sK3_SV1 @ sK4_SV2 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[38]) ).
thf(41,plain,
( ( ( sK1_Xr @ sK3_SV1 @ sK4_SV2 )
= $false )
| ( ( ~ ( sK2_SY4 @ sK3_SV1 @ sK4_SV2 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[40]) ).
thf(42,plain,
( ( ( sK2_SY4 @ sK3_SV1 @ sK4_SV2 )
= $false )
| ( ( sK1_Xr @ sK3_SV1 @ sK4_SV2 )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[41]) ).
thf(43,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[16,42,39,36,35,30,23]) ).
thf(44,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[43]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SYO217^5 : TPTP v8.1.0. Released v4.0.0.
% 0.15/0.15 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.15/0.36 % Computer : n007.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 600
% 0.15/0.36 % DateTime : Sat Jul 9 08:35:31 EDT 2022
% 0.15/0.36 % CPUTime :
% 0.15/0.37
% 0.15/0.37 No.of.Axioms: 0
% 0.15/0.37
% 0.15/0.37 Length.of.Defs: 0
% 0.15/0.37
% 0.15/0.37 Contains.Choice.Funs: false
% 0.15/0.37 (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.15/0.40
% 0.15/0.40 ********************************
% 0.15/0.40 * All subproblems solved! *
% 0.15/0.40 ********************************
% 0.15/0.40 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:1,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:43,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.15/0.41
% 0.15/0.41 %**** Beginning of derivation protocol ****
% 0.15/0.41 % SZS output start CNFRefutation
% See solution above
% 0.15/0.41
% 0.15/0.41 %**** End of derivation protocol ****
% 0.15/0.41 %**** no. of clauses in derivation: 44 ****
% 0.15/0.41 %**** clause counter: 43 ****
% 0.15/0.41
% 0.15/0.41 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:1,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:43,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------