TSTP Solution File: SYO352^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO352^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 : n020.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:31 EDT 2022
% Result : Theorem 0.12s 0.39s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 25 unt; 4 typ; 0 def)
% Number of atoms : 86 ( 39 equ; 0 cnn)
% Maximal formula atoms : 2 ( 2 avg)
% Number of connectives : 121 ( 19 ~; 9 |; 2 &; 79 @)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 24 ( 24 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 29 ( 0 ^ 29 !; 0 ?; 29 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_m,type,
m: $i > $i ).
thf(tp_n,type,
n: $i > $i ).
thf(tp_sK1_Q,type,
sK1_Q: ( $i > $i ) > $o ).
thf(tp_sK2_E,type,
sK2_E: $i ).
thf(1,conjecture,
( ! [X: $i,P: $i > $o] :
( ( P @ ( m @ X ) )
=> ( P @ ( n @ X ) ) )
=> ! [Q: ( $i > $i ) > $o] :
( ( Q @ m )
=> ( Q @ n ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cE5EXT) ).
thf(2,negated_conjecture,
( ( ! [X: $i,P: $i > $o] :
( ( P @ ( m @ X ) )
=> ( P @ ( n @ X ) ) )
=> ! [Q: ( $i > $i ) > $o] :
( ( Q @ m )
=> ( Q @ n ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [X: $i,P: $i > $o] :
( ( P @ ( m @ X ) )
=> ( P @ ( n @ X ) ) )
=> ! [Q: ( $i > $i ) > $o] :
( ( Q @ m )
=> ( Q @ n ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [X: $i,P: $i > $o] :
( ( P @ ( m @ X ) )
=> ( P @ ( n @ X ) ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [Q: ( $i > $i ) > $o] :
( ( Q @ m )
=> ( Q @ n ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ~ ! [Q: ( $i > $i ) > $o] :
( ( Q @ m )
=> ( Q @ n ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(7,plain,
( ( ( sK1_Q @ m )
& ~ ( sK1_Q @ n ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(8,plain,
( ( ! [X: $i,P: $i > $o] :
( ~ ( P @ ( m @ X ) )
| ( P @ ( n @ X ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(9,plain,
( ( ! [X: $i,P: $i > $o] :
( ~ ( P @ ( m @ X ) )
| ( P @ ( n @ X ) ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(10,plain,
( ( ( sK1_Q @ m )
& ~ ( sK1_Q @ n ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(11,plain,
( ( ~ ( ~ ( sK1_Q @ m )
| ~ ~ ( sK1_Q @ n ) ) )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(12,plain,
! [SV1: $i] :
( ( ! [SY3: $i > $o] :
( ~ ( SY3 @ ( m @ SV1 ) )
| ( SY3 @ ( n @ SV1 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[9]) ).
thf(13,plain,
( ( ~ ( sK1_Q @ m )
| ~ ~ ( sK1_Q @ n ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(14,plain,
! [SV1: $i,SV2: $i > $o] :
( ( ~ ( SV2 @ ( m @ SV1 ) )
| ( SV2 @ ( n @ SV1 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[12]) ).
thf(15,plain,
( ( ~ ( sK1_Q @ m ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[13]) ).
thf(16,plain,
( ( ~ ~ ( sK1_Q @ n ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[13]) ).
thf(17,plain,
! [SV1: $i,SV2: $i > $o] :
( ( ( ~ ( SV2 @ ( m @ SV1 ) ) )
= $true )
| ( ( SV2 @ ( n @ SV1 ) )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[14]) ).
thf(18,plain,
( ( sK1_Q @ m )
= $true ),
inference(extcnf_not_neg,[status(thm)],[15]) ).
thf(19,plain,
( ( ~ ( sK1_Q @ n ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[16]) ).
thf(20,plain,
! [SV1: $i,SV2: $i > $o] :
( ( ( SV2 @ ( m @ SV1 ) )
= $false )
| ( ( SV2 @ ( n @ SV1 ) )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[17]) ).
thf(21,plain,
( ( sK1_Q @ n )
= $false ),
inference(extcnf_not_pos,[status(thm)],[19]) ).
thf(22,plain,
! [SV1: $i] :
( ( ( ( m @ SV1 )
= ( m @ SV1 ) )
= $false )
| ( ( ( n @ SV1 )
= ( m @ SV1 ) )
= $true ) ),
inference(replace_leibnizEQ,[status(thm)],[20:[bind(SV2,$thf( ^ [SV3: $i] : ( SV3 = ( m @ SV1 ) ) ))]]) ).
thf(23,plain,
! [SV1: $i] :
( ( ( n @ SV1 )
= ( m @ SV1 ) )
= $true ),
inference(sim,[status(thm)],[22]) ).
thf(24,plain,
( ( ( sK1_Q @ n )
= ( sK1_Q @ m ) )
= $false ),
inference(res,[status(thm)],[21,18]) ).
thf(25,plain,
( ( ( n @ sK2_E )
= ( m @ sK2_E ) )
= $false ),
inference(extuni,[status(esa)],[24]) ).
thf(26,plain,
! [SV4: $i] :
( ( ( n @ SV4 )
= ( m @ SV4 ) )
= $true ),
inference(rename,[status(thm)],[23]) ).
thf(28,plain,
! [SV4: $i] :
( ( ( ( n @ sK2_E )
= ( m @ sK2_E ) )
= ( ( n @ SV4 )
= ( m @ SV4 ) ) )
= $false ),
inference(res,[status(thm)],[25,26]) ).
thf(31,plain,
$false = $true,
inference(extuni,[status(esa)],[28:[bind(SV4,$thf( sK2_E ))]]) ).
thf(32,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SYO352^5 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.33 % Computer : n020.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jul 8 18:26:43 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34
% 0.12/0.34 No.of.Axioms: 0
% 0.12/0.34
% 0.12/0.34 Length.of.Defs: 0
% 0.12/0.34
% 0.12/0.34 Contains.Choice.Funs: false
% 0.12/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.12/0.39
% 0.12/0.39 ********************************
% 0.12/0.39 * All subproblems solved! *
% 0.12/0.39 ********************************
% 0.12/0.39 % 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:31,loop_count:4,foatp_calls:2,translation:fof_full)
% 0.12/0.39
% 0.12/0.39 %**** Beginning of derivation protocol ****
% 0.12/0.39 % SZS output start CNFRefutation
% See solution above
% 0.12/0.39
% 0.12/0.39 %**** End of derivation protocol ****
% 0.12/0.39 %**** no. of clauses in derivation: 29 ****
% 0.12/0.39 %**** clause counter: 31 ****
% 0.12/0.39
% 0.12/0.39 % 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:31,loop_count:4,foatp_calls:2,translation:fof_full)
%------------------------------------------------------------------------------