TSTP Solution File: SYO011^1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO011^1 : TPTP v8.1.0. Released v3.7.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:31:21 EDT 2022
% Result : Theorem 0.23s 0.43s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 21 unt; 4 typ; 1 def)
% Number of atoms : 79 ( 35 equ; 0 cnn)
% Maximal formula atoms : 3 ( 3 avg)
% Number of connectives : 77 ( 7 ~; 7 |; 3 &; 54 @)
% ( 0 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 2 avg)
% Number of types : 2 ( 0 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 ( 8 ^ 23 !; 0 ?; 31 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_f,type,
f: $i > $i ).
thf(tp_leibeq,type,
leibeq: $i > $i > $o ).
thf(tp_p,type,
p: ( $i > $i ) > $o ).
thf(tp_sK1_E,type,
sK1_E: $i ).
thf(leibeq,definition,
( leibeq
= ( ^ [U: $i,V: $i] :
! [Q: $i > $o] :
( ( Q @ U )
=> ( Q @ V ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',leibeq) ).
thf(1,conjecture,
( ( ! [X: $i] : ( leibeq @ ( f @ X ) @ X )
& ( p
@ ^ [X: $i] : X ) )
=> ( p @ f ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(2,negated_conjecture,
( ( ( ! [X: $i] : ( leibeq @ ( f @ X ) @ X )
& ( p
@ ^ [X: $i] : X ) )
=> ( p @ f ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ( ! [SY0: $i,SY3: $i > $o] :
( ( SY3 @ ( f @ SY0 ) )
=> ( SY3 @ SY0 ) )
& ( p
@ ^ [X: $i] : X ) )
=> ( p @ f ) )
= $false ),
inference(unfold_def,[status(thm)],[2,leibeq]) ).
thf(4,plain,
( ( ! [SY0: $i,SY3: $i > $o] :
( ( SY3 @ ( f @ SY0 ) )
=> ( SY3 @ SY0 ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( p
@ ^ [X: $i] : X )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( p @ f )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(7,plain,
( ( ~ ( p @ f ) )
= $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(8,plain,
( ( ! [SY0: $i,SY3: $i > $o] :
( ~ ( SY3 @ ( f @ SY0 ) )
| ( SY3 @ SY0 ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(9,plain,
( ( p
@ ^ [X: $i] : X )
= $true ),
inference(copy,[status(thm)],[5]) ).
thf(10,plain,
( ( ! [SY0: $i,SY3: $i > $o] :
( ~ ( SY3 @ ( f @ SY0 ) )
| ( SY3 @ SY0 ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(11,plain,
( ( ~ ( p @ f ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(12,plain,
! [SV1: $i] :
( ( ! [SY8: $i > $o] :
( ~ ( SY8 @ ( f @ SV1 ) )
| ( SY8 @ SV1 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[10]) ).
thf(13,plain,
( ( p @ f )
= $false ),
inference(extcnf_not_pos,[status(thm)],[11]) ).
thf(14,plain,
! [SV1: $i,SV2: $i > $o] :
( ( ~ ( SV2 @ ( f @ SV1 ) )
| ( SV2 @ SV1 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[12]) ).
thf(15,plain,
! [SV1: $i,SV2: $i > $o] :
( ( ( ~ ( SV2 @ ( f @ SV1 ) ) )
= $true )
| ( ( SV2 @ SV1 )
= $true ) ),
inference(extcnf_or_pos,[status(thm)],[14]) ).
thf(16,plain,
! [SV1: $i,SV2: $i > $o] :
( ( ( SV2 @ ( f @ SV1 ) )
= $false )
| ( ( SV2 @ SV1 )
= $true ) ),
inference(extcnf_not_pos,[status(thm)],[15]) ).
thf(17,plain,
! [SV1: $i] :
( ( ( ( f @ SV1 )
= ( f @ SV1 ) )
= $false )
| ( ( SV1
= ( f @ SV1 ) )
= $true ) ),
inference(replace_leibnizEQ,[status(thm)],[16:[bind(SV2,$thf( ^ [SV3: $i] : ( SV3 = ( f @ SV1 ) ) ))]]) ).
thf(18,plain,
! [SV1: $i] :
( ( SV1
= ( f @ SV1 ) )
= $true ),
inference(sim,[status(thm)],[17]) ).
thf(19,plain,
( ( ( p @ f )
= ( p
@ ^ [X: $i] : X ) )
= $false ),
inference(res,[status(thm)],[13,9]) ).
thf(20,plain,
( ( ( f @ sK1_E )
= sK1_E )
= $false ),
inference(extuni,[status(esa)],[19]) ).
thf(21,plain,
! [SV4: $i] :
( ( SV4
= ( f @ SV4 ) )
= $true ),
inference(rename,[status(thm)],[18]) ).
thf(23,plain,
! [SV4: $i] :
( ( ( ( f @ sK1_E )
= sK1_E )
= ( SV4
= ( f @ SV4 ) ) )
= $false ),
inference(res,[status(thm)],[20,21]) ).
thf(25,plain,
$false = $true,
inference(extuni,[status(esa)],[23:[bind(SV4,$thf( sK1_E ))]]) ).
thf(26,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SYO011^1 : TPTP v8.1.0. Released v3.7.0.
% 0.04/0.15 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.16/0.37 % Computer : n007.cluster.edu
% 0.16/0.37 % Model : x86_64 x86_64
% 0.16/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.37 % Memory : 8042.1875MB
% 0.16/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.37 % CPULimit : 300
% 0.16/0.37 % WCLimit : 600
% 0.16/0.37 % DateTime : Sat Jul 9 06:44:46 EDT 2022
% 0.16/0.37 % CPUTime :
% 0.23/0.37
% 0.23/0.37 No.of.Axioms: 0
% 0.23/0.37
% 0.23/0.37 Length.of.Defs: 150
% 0.23/0.37
% 0.23/0.37 Contains.Choice.Funs: false
% 0.23/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.23/0.43
% 0.23/0.43 ********************************
% 0.23/0.43 * All subproblems solved! *
% 0.23/0.43 ********************************
% 0.23/0.43 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:2,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:25,loop_count:4,foatp_calls:2,translation:fof_full)
% 0.23/0.43
% 0.23/0.43 %**** Beginning of derivation protocol ****
% 0.23/0.43 % SZS output start CNFRefutation
% See solution above
% 0.23/0.43
% 0.23/0.43 %**** End of derivation protocol ****
% 0.23/0.43 %**** no. of clauses in derivation: 24 ****
% 0.23/0.43 %**** clause counter: 25 ****
% 0.23/0.43
% 0.23/0.43 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:2,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:25,loop_count:4,foatp_calls:2,translation:fof_full)
%------------------------------------------------------------------------------