TSTP Solution File: SYN398+1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYN398+1 : TPTP v8.1.0. Released v2.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 08:25:57 EDT 2022
% Result : Theorem 0.20s 0.39s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 5
% Syntax : Number of formulae : 48 ( 37 unt; 4 typ; 0 def)
% Number of atoms : 201 ( 48 equ; 0 cnn)
% Maximal formula atoms : 4 ( 4 avg)
% Number of connectives : 191 ( 78 ~; 32 |; 22 &; 52 @)
% ( 3 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 4 usr; 5 con; 0-2 aty)
% Number of variables : 34 ( 0 ^ 34 !; 0 ?; 34 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_f,type,
f: $i > $o ).
thf(tp_p,type,
p: $o ).
thf(tp_sK1_Y,type,
sK1_Y: $i ).
thf(tp_sK2_X,type,
sK2_X: $i ).
thf(1,conjecture,
( ! [X: $i] :
( p
& ( f @ X ) )
<=> ( p
& ! [Y: $i] : ( f @ Y ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',kalish215) ).
thf(2,negated_conjecture,
( ( ! [X: $i] :
( p
& ( f @ X ) )
<=> ( p
& ! [Y: $i] : ( f @ Y ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ! [X: $i] :
( p
& ( f @ X ) )
<=> ( p
& ! [Y: $i] : ( f @ Y ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [X: $i] :
( p
& ( f @ X ) )
=> ( p
& ! [Y: $i] : ( f @ Y ) ) )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[3]) ).
thf(5,plain,
( ( ( p
& ! [Y: $i] : ( f @ Y ) )
=> ! [X: $i] :
( p
& ( f @ X ) ) )
= $false ),
inference(split_conjecture,[split_conjecture(split,[])],[3]) ).
thf(6,plain,
( ( ~ ( ! [X: $i] :
( p
& ( f @ X ) )
=> ( p
& ! [Y: $i] : ( f @ Y ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[4]) ).
thf(7,plain,
( ( ~ ( ( p
& ! [Y: $i] : ( f @ Y ) )
=> ! [X: $i] :
( p
& ( f @ X ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[5]) ).
thf(8,plain,
( ( ! [X: $i] : ( f @ X )
& p
& ( ~ ( f @ sK1_Y )
| ~ p ) )
= $true ),
inference(extcnf_combined,[status(esa)],[6]) ).
thf(9,plain,
( ( ! [Y: $i] : ( f @ Y )
& p
& ( ~ ( f @ sK2_X )
| ~ p ) )
= $true ),
inference(extcnf_combined,[status(esa)],[7]) ).
thf(10,plain,
( ( ! [X: $i] : ( f @ X )
& p
& ( ~ ( f @ sK1_Y )
| ~ p ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(11,plain,
( ( ~ ( ~ ~ ( ~ ! [SX0: $i] : ( f @ SX0 )
| ~ p )
| ~ ( ~ ( f @ sK1_Y )
| ~ p ) ) )
= $true ),
inference(unfold_def,[status(thm)],[10]) ).
thf(12,plain,
( ( ~ ~ ( ~ ! [SX0: $i] : ( f @ SX0 )
| ~ p )
| ~ ( ~ ( f @ sK1_Y )
| ~ p ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(13,plain,
( ( ~ ~ ( ~ ! [SX0: $i] : ( f @ SX0 )
| ~ p ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[12]) ).
thf(14,plain,
( ( ~ ( ~ ( f @ sK1_Y )
| ~ p ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[12]) ).
thf(15,plain,
( ( ~ ( ~ ! [SX0: $i] : ( f @ SX0 )
| ~ p ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[13]) ).
thf(16,plain,
( ( ~ ( f @ sK1_Y )
| ~ p )
= $true ),
inference(extcnf_not_neg,[status(thm)],[14]) ).
thf(17,plain,
( ( ~ ! [SX0: $i] : ( f @ SX0 )
| ~ p )
= $false ),
inference(extcnf_not_pos,[status(thm)],[15]) ).
thf(18,plain,
( ( ( ~ ( f @ sK1_Y ) )
= $true )
| ( ( ~ p )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[16]) ).
thf(19,plain,
( ( ~ ! [SX0: $i] : ( f @ SX0 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[17]) ).
thf(20,plain,
( ( ~ p )
= $false ),
inference(extcnf_or_neg,[status(thm)],[17]) ).
thf(21,plain,
( ( ( f @ sK1_Y )
= $false )
| ( ( ~ p )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[18]) ).
thf(22,plain,
( ( ! [SX0: $i] : ( f @ SX0 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[19]) ).
thf(23,plain,
p = $true,
inference(extcnf_not_neg,[status(thm)],[20]) ).
thf(24,plain,
( ( p = $false )
| ( ( f @ sK1_Y )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[21]) ).
thf(25,plain,
! [SV1: $i] :
( ( f @ SV1 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[22]) ).
thf(26,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[23,25,24]) ).
thf(27,plain,
( ( ! [Y: $i] : ( f @ Y )
& p
& ( ~ ( f @ sK2_X )
| ~ p ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(28,plain,
( ( ~ ( ~ ~ ( ~ ! [SX0: $i] : ( f @ SX0 )
| ~ p )
| ~ ( ~ ( f @ sK2_X )
| ~ p ) ) )
= $true ),
inference(unfold_def,[status(thm)],[27]) ).
thf(29,plain,
( ( ~ ~ ( ~ ! [SX0: $i] : ( f @ SX0 )
| ~ p )
| ~ ( ~ ( f @ sK2_X )
| ~ p ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[28]) ).
thf(30,plain,
( ( ~ ~ ( ~ ! [SX0: $i] : ( f @ SX0 )
| ~ p ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[29]) ).
thf(31,plain,
( ( ~ ( ~ ( f @ sK2_X )
| ~ p ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[29]) ).
thf(32,plain,
( ( ~ ( ~ ! [SX0: $i] : ( f @ SX0 )
| ~ p ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[30]) ).
thf(33,plain,
( ( ~ ( f @ sK2_X )
| ~ p )
= $true ),
inference(extcnf_not_neg,[status(thm)],[31]) ).
thf(34,plain,
( ( ~ ! [SX0: $i] : ( f @ SX0 )
| ~ p )
= $false ),
inference(extcnf_not_pos,[status(thm)],[32]) ).
thf(35,plain,
( ( ( ~ ( f @ sK2_X ) )
= $true )
| ( ( ~ p )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[33]) ).
thf(36,plain,
( ( ~ ! [SX0: $i] : ( f @ SX0 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[34]) ).
thf(37,plain,
( ( ~ p )
= $false ),
inference(extcnf_or_neg,[status(thm)],[34]) ).
thf(38,plain,
( ( ( f @ sK2_X )
= $false )
| ( ( ~ p )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[35]) ).
thf(39,plain,
( ( ! [SX0: $i] : ( f @ SX0 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[36]) ).
thf(40,plain,
p = $true,
inference(extcnf_not_neg,[status(thm)],[37]) ).
thf(41,plain,
( ( p = $false )
| ( ( f @ sK2_X )
= $false ) ),
inference(extcnf_not_pos,[status(thm)],[38]) ).
thf(42,plain,
! [SV2: $i] :
( ( f @ SV2 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[39]) ).
thf(43,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[40,42,41]) ).
thf(44,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[43,26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN398+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n007.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 : Mon Jul 11 19:59:03 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:600,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.39
% 0.20/0.39 ********************************
% 0.20/0.39 * All subproblems solved! *
% 0.20/0.39 ********************************
% 0.20/0.39 % SZS status Theorem for /export/starexec/sandbox/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:74,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.20/0.39
% 0.20/0.39 %**** Beginning of derivation protocol ****
% 0.20/0.39 % SZS output start CNFRefutation
% See solution above
% 0.20/0.39
% 0.20/0.39 %**** End of derivation protocol ****
% 0.20/0.39 %**** no. of clauses in derivation: 44 ****
% 0.20/0.39 %**** clause counter: 43 ****
% 0.20/0.39
% 0.20/0.39 % SZS status Theorem for /export/starexec/sandbox/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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:43,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------