TSTP Solution File: SYO373^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO373^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 : n014.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:39 EDT 2022
% Result : Theorem 0.20s 0.40s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 6
% Syntax : Number of formulae : 48 ( 30 unt; 5 typ; 0 def)
% Number of atoms : 224 ( 59 equ; 0 cnn)
% Maximal formula atoms : 4 ( 5 avg)
% Number of connectives : 178 ( 37 ~; 32 |; 4 &; 93 @)
% ( 4 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 14 ( 14 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 31 ( 0 ^ 31 !; 0 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_b,type,
b: $tType ).
thf(tp_f,type,
f: b > $o ).
thf(tp_g,type,
g: b > $o ).
thf(tp_sK1_Xq,type,
sK1_Xq: ( b > $o ) > $o ).
thf(tp_sK2_E,type,
sK2_E: b ).
thf(1,conjecture,
( ! [Xx: b] :
( ( f @ Xx )
<=> ( g @ Xx ) )
=> ! [Xq: ( b > $o ) > $o] :
( ( Xq @ f )
=> ( Xq @ g ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cEXT_SET) ).
thf(2,negated_conjecture,
( ( ! [Xx: b] :
( ( f @ Xx )
<=> ( g @ Xx ) )
=> ! [Xq: ( b > $o ) > $o] :
( ( Xq @ f )
=> ( Xq @ g ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [Xx: b] :
( ( f @ Xx )
<=> ( g @ Xx ) )
=> ! [Xq: ( b > $o ) > $o] :
( ( Xq @ f )
=> ( Xq @ g ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [Xx: b] :
( ( f @ Xx )
<=> ( g @ Xx ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [Xq: ( b > $o ) > $o] :
( ( Xq @ f )
=> ( Xq @ g ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ~ ! [Xq: ( b > $o ) > $o] :
( ( Xq @ f )
=> ( Xq @ g ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(7,plain,
( ( ( sK1_Xq @ f )
& ~ ( sK1_Xq @ g ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(8,plain,
( ( ! [Xx: b] :
( ~ ( f @ Xx )
| ( g @ Xx ) )
& ! [Xx: b] :
( ~ ( g @ Xx )
| ( f @ Xx ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(9,plain,
( ( ! [Xx: b] :
( ~ ( f @ Xx )
| ( g @ Xx ) )
& ! [Xx: b] :
( ~ ( g @ Xx )
| ( f @ Xx ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(10,plain,
( ( ( sK1_Xq @ f )
& ~ ( sK1_Xq @ g ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(11,plain,
( ( ~ ( ~ ! [SX0: b] :
( ~ ( f @ SX0 )
| ( g @ SX0 ) )
| ~ ! [SX0: b] :
( ~ ( g @ SX0 )
| ( f @ SX0 ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[9]) ).
thf(12,plain,
( ( ~ ( ~ ( sK1_Xq @ f )
| ~ ~ ( sK1_Xq @ g ) ) )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(13,plain,
( ( ~ ! [SX0: b] :
( ~ ( f @ SX0 )
| ( g @ SX0 ) )
| ~ ! [SX0: b] :
( ~ ( g @ SX0 )
| ( f @ SX0 ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(14,plain,
( ( ~ ( sK1_Xq @ f )
| ~ ~ ( sK1_Xq @ g ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[12]) ).
thf(15,plain,
( ( ~ ! [SX0: b] :
( ~ ( f @ SX0 )
| ( g @ SX0 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[13]) ).
thf(16,plain,
( ( ~ ! [SX0: b] :
( ~ ( g @ SX0 )
| ( f @ SX0 ) ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[13]) ).
thf(17,plain,
( ( ~ ( sK1_Xq @ f ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[14]) ).
thf(18,plain,
( ( ~ ~ ( sK1_Xq @ g ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[14]) ).
thf(19,plain,
( ( ! [SX0: b] :
( ~ ( f @ SX0 )
| ( g @ SX0 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[15]) ).
thf(20,plain,
( ( ! [SX0: b] :
( ~ ( g @ SX0 )
| ( f @ SX0 ) ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[16]) ).
thf(21,plain,
( ( sK1_Xq @ f )
= $true ),
inference(extcnf_not_neg,[status(thm)],[17]) ).
thf(22,plain,
( ( ~ ( sK1_Xq @ g ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[18]) ).
thf(23,plain,
! [SV1: b] :
( ( ~ ( f @ SV1 )
| ( g @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[19]) ).
thf(24,plain,
! [SV2: b] :
( ( ~ ( g @ SV2 )
| ( f @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(25,plain,
( ( sK1_Xq @ g )
= $false ),
inference(extcnf_not_pos,[status(thm)],[22]) ).
thf(26,plain,
! [SV1: b] :
( ( ( ~ ( f @ SV1 ) )
= $true )
| ( ( g @ SV1 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[23]) ).
thf(27,plain,
! [SV2: b] :
( ( ( ~ ( g @ SV2 ) )
= $true )
| ( ( f @ SV2 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[24]) ).
thf(28,plain,
! [SV1: b] :
( ( ( f @ SV1 )
= $false )
| ( ( g @ SV1 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[26]) ).
thf(29,plain,
! [SV2: b] :
( ( ( g @ SV2 )
= $false )
| ( ( f @ SV2 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[27]) ).
thf(30,plain,
( ( ( sK1_Xq @ g )
= ( sK1_Xq @ f ) )
= $false ),
inference(res,[status(thm)],[25,21]) ).
thf(31,plain,
( ( ( g @ sK2_E )
= $true )
| ( ( f @ sK2_E )
= $true ) ),
inference(extuni,[status(esa)],[30]) ).
thf(32,plain,
( ( ( g @ sK2_E )
= $false )
| ( ( f @ sK2_E )
= $false ) ),
inference(extuni,[status(esa)],[30]) ).
thf(33,plain,
! [SV3: b] :
( ( ( f @ SV3 )
= $false )
| ( ( g @ SV3 )
= $true ) ),
inference(rename,[status(thm)],[28]) ).
thf(38,plain,
! [SV4: b] :
( ( ( g @ SV4 )
= $false )
| ( ( f @ SV4 )
= $true ) ),
inference(rename,[status(thm)],[29]) ).
thf(48,plain,
! [SV4: b] :
( ( ( ( g @ sK2_E )
= ( g @ SV4 ) )
= $false )
| ( ( f @ sK2_E )
= $true )
| ( ( f @ SV4 )
= $true ) ),
inference(res,[status(thm)],[31,38]) ).
thf(55,plain,
( ( ( f @ sK2_E )
= $true )
| ( ( f @ sK2_E )
= $true ) ),
inference(extuni,[status(esa)],[48:[bind(SV4,$thf( sK2_E ))]]) ).
thf(57,plain,
( ( f @ sK2_E )
= $true ),
inference(sim,[status(thm)],[55]) ).
thf(61,plain,
! [SV3: b] :
( ( ( ( g @ sK2_E )
= ( g @ SV3 ) )
= $false )
| ( ( f @ sK2_E )
= $false )
| ( ( f @ SV3 )
= $false ) ),
inference(res,[status(thm)],[32,33]) ).
thf(71,plain,
( ( ( f @ sK2_E )
= $false )
| ( ( f @ sK2_E )
= $false ) ),
inference(extuni,[status(esa)],[61:[bind(SV3,$thf( sK2_E ))]]) ).
thf(73,plain,
( ( f @ sK2_E )
= $false ),
inference(sim,[status(thm)],[71]) ).
thf(89,plain,
( ( ( f @ sK2_E )
= ( f @ sK2_E ) )
= $false ),
inference(res,[status(thm)],[73,57]) ).
thf(95,plain,
$false = $true,
inference(extuni,[status(esa)],[89]) ).
thf(96,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[95]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SYO373^5 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.33 % Computer : n014.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jul 9 12:16:35 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34
% 0.13/0.34 No.of.Axioms: 0
% 0.13/0.34
% 0.13/0.34 Length.of.Defs: 0
% 0.13/0.34
% 0.13/0.34 Contains.Choice.Funs: false
% 0.13/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.20/0.40
% 0.20/0.40 ********************************
% 0.20/0.40 * All subproblems solved! *
% 0.20/0.40 ********************************
% 0.20/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:95,loop_count:9,foatp_calls:1,translation:fof_full)
% 0.20/0.40
% 0.20/0.40 %**** Beginning of derivation protocol ****
% 0.20/0.40 % SZS output start CNFRefutation
% See solution above
% 0.20/0.40
% 0.20/0.40 %**** End of derivation protocol ****
% 0.20/0.40 %**** no. of clauses in derivation: 43 ****
% 0.20/0.40 %**** clause counter: 95 ****
% 0.20/0.40
% 0.20/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:95,loop_count:9,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------