TSTP Solution File: SYO238^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO238^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 : n013.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:54 EDT 2022
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 28 ( 17 unt; 5 typ; 0 def)
% Number of atoms : 99 ( 44 equ; 0 cnn)
% Maximal formula atoms : 6 ( 4 avg)
% Number of connectives : 63 ( 5 ~; 7 |; 0 &; 34 @)
% ( 0 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 26 ( 18 ^ 8 !; 0 ?; 26 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_cB,type,
cB: $o ).
thf(tp_cP,type,
cP: $i > $o ).
thf(tp_f,type,
f: $i > $i ).
thf(tp_sK1_SV2,type,
sK1_SV2: $i ).
thf(tp_x,type,
x: $i ).
thf(1,conjecture,
( ( $true
=> ! [Xx0: $i] :
( ( f @ Xx0 )
= Xx0 ) )
=> ( ( ( ( ^ [Xx0: $i] : ( f @ ( f @ Xx0 ) ) )
= ( ^ [Xx0: $i] : Xx0 ) )
=> cB )
=> ( ( cP @ x )
=> cB ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cADDHYP5) ).
thf(2,negated_conjecture,
( ( ( $true
=> ! [Xx0: $i] :
( ( f @ Xx0 )
= Xx0 ) )
=> ( ( ( ( ^ [Xx0: $i] : ( f @ ( f @ Xx0 ) ) )
= ( ^ [Xx0: $i] : Xx0 ) )
=> cB )
=> ( ( cP @ x )
=> cB ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ( $true
=> ! [Xx0: $i] :
( ( f @ Xx0 )
= Xx0 ) )
=> ( ( ( ( ^ [Xx0: $i] : ( f @ ( f @ Xx0 ) ) )
= ( ^ [Xx0: $i] : Xx0 ) )
=> cB )
=> ( ( cP @ x )
=> cB ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( $true
=> ! [Xx0: $i] :
( ( f @ Xx0 )
= Xx0 ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ( ( ^ [Xx0: $i] : ( f @ ( f @ Xx0 ) ) )
= ( ^ [Xx0: $i] : Xx0 ) )
=> cB )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( cP @ x )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(7,plain,
cB = $false,
inference(standard_cnf,[status(thm)],[3]) ).
thf(8,plain,
( ( ~ cB )
= $true ),
inference(polarity_switch,[status(thm)],[7]) ).
thf(9,plain,
( ( ! [Xx0: $i] :
( ( f @ Xx0 )
= Xx0 ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(10,plain,
( ( ( ( ^ [Xx0: $i] : ( f @ ( f @ Xx0 ) ) )
!= ( ^ [Xx0: $i] : Xx0 ) )
| cB )
= $true ),
inference(extcnf_combined,[status(esa)],[5]) ).
thf(11,plain,
( ( cP @ x )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(12,plain,
( ( ( ( ^ [Xx0: $i] : ( f @ ( f @ Xx0 ) ) )
!= ( ^ [Xx0: $i] : Xx0 ) )
| cB )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(13,plain,
( ( ! [Xx0: $i] :
( ( f @ Xx0 )
= Xx0 ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(14,plain,
( ( ~ cB )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(15,plain,
( ( ( ( ( ^ [Xx0: $i] : ( f @ ( f @ Xx0 ) ) )
!= ( ^ [Xx0: $i] : Xx0 ) ) )
= $true )
| ( cB = $true ) ),
inference(extcnf_or_pos,[status(thm)],[12]) ).
thf(16,plain,
! [SV1: $i] :
( ( ( f @ SV1 )
= SV1 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[13]) ).
thf(17,plain,
cB = $false,
inference(extcnf_not_pos,[status(thm)],[14]) ).
thf(18,plain,
( ( ( ( ^ [Xx0: $i] : ( f @ ( f @ Xx0 ) ) )
= ( ^ [Xx0: $i] : Xx0 ) )
= $false )
| ( cB = $true ) ),
inference(extcnf_not_pos,[status(thm)],[15]) ).
thf(19,plain,
( ( ( ! [SV2: $i] :
( ( f @ ( f @ SV2 ) )
= SV2 ) )
= $false )
| ( cB = $true ) ),
inference(extcnf_equal_neg,[status(thm)],[18]) ).
thf(20,plain,
( ( ( ( ^ [Xx0: $i] : ( f @ ( f @ Xx0 ) ) )
= ( ^ [Xx0: $i] : Xx0 ) )
= $false )
| ( cB = $true ) ),
inference(extcnf_equal_neg,[status(thm)],[18]) ).
thf(21,plain,
( ( ( ( f @ ( f @ sK1_SV2 ) )
= sK1_SV2 )
= $false )
| ( cB = $true ) ),
inference(extcnf_forall_neg,[status(esa)],[19]) ).
thf(22,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[11,21,20,17,16]) ).
thf(23,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[22]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO238^5 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.13/0.34 % Computer : n013.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 : Sat Jul 9 00:05:30 EDT 2022
% 0.13/0.34 % 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.13/0.37 ********************************
% 0.13/0.37 * All subproblems solved! *
% 0.13/0.37 ********************************
% 0.13/0.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:3,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:22,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.13/0.37
% 0.13/0.37 %**** Beginning of derivation protocol ****
% 0.13/0.37 % SZS output start CNFRefutation
% See solution above
% 0.13/0.37
% 0.13/0.37 %**** End of derivation protocol ****
% 0.13/0.37 %**** no. of clauses in derivation: 23 ****
% 0.13/0.37 %**** clause counter: 22 ****
% 0.13/0.37
% 0.13/0.37 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p : (rf:0,axioms:3,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:22,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------