TSTP Solution File: SYO550^1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYO550^1 : TPTP v8.1.0. Released v5.2.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n024.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:35:30 EDT 2022
% Result : Theorem 0.19s 0.44s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 11
% Syntax : Number of formulae : 20 ( 10 unt; 10 typ; 0 def)
% Number of atoms : 26 ( 16 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 20 ( 4 ~; 0 |; 0 &; 16 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 35 ( 35 >; 0 *; 0 +; 0 <<)
% Number of symbols : 13 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 12 ( 0 ^ 8 !; 4 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_sK10_E,type,
sK10_E: ( $i > $i > $i > $i > $i > $i > $i ) > $i ).
thf(tp_sK1_X,type,
sK1_X: ( $i > $i ) > $i ).
thf(tp_sK2_E,type,
sK2_E: ( $i > $i > $i ) > $i ).
thf(tp_sK3_E,type,
sK3_E: $i ).
thf(tp_sK4_E,type,
sK4_E: ( $i > $i > $i > $i ) > $i ).
thf(tp_sK5_E,type,
sK5_E: $i ).
thf(tp_sK6_E,type,
sK6_E: ( $i > $i > $i > $i > $i ) > $i ).
thf(tp_sK7_E,type,
sK7_E: $i ).
thf(tp_sK8_E,type,
sK8_E: ( $i > $i > $i > $i > $i > $i ) > $i ).
thf(tp_sK9_E,type,
sK9_E: $i ).
thf(1,conjecture,
? [F: $i > $i] :
! [X: $i] :
( ( F @ X )
= X ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',claim) ).
thf(2,negated_conjecture,
( ( ? [F: $i > $i] :
! [X: $i] :
( ( F @ X )
= X ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ? [F: $i > $i] :
! [X: $i] :
( ( F @ X )
= X ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ~ ? [F: $i > $i] :
! [X: $i] :
( ( F @ X )
= X ) )
= $true ),
inference(polarity_switch,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [F: $i > $i] :
( ( F @ ( sK1_X @ F ) )
!= ( sK1_X @ F ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(6,plain,
( ( ! [F: $i > $i] :
( ( F @ ( sK1_X @ F ) )
!= ( sK1_X @ F ) ) )
= $true ),
inference(copy,[status(thm)],[5]) ).
thf(7,plain,
! [SV1: $i > $i] :
( ( ( ( SV1 @ ( sK1_X @ SV1 ) )
!= ( sK1_X @ SV1 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[6]) ).
thf(8,plain,
! [SV1: $i > $i] :
( ( ( SV1 @ ( sK1_X @ SV1 ) )
= ( sK1_X @ SV1 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[7]) ).
thf(32,plain,
$false = $true,
inference(extuni,[status(esa)],[8:[bind(SV1,$thf( ^ [SX0: $i] : SX0 ))]]) ).
thf(33,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[32]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SYO550^1 : TPTP v8.1.0. Released v5.2.0.
% 0.11/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.33 % Computer : n024.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 21:45:59 EDT 2022
% 0.19/0.33 % CPUTime :
% 0.19/0.34
% 0.19/0.34 No.of.Axioms: 0
% 0.19/0.34
% 0.19/0.34 Length.of.Defs: 0
% 0.19/0.34
% 0.19/0.34 Contains.Choice.Funs: false
% 0.19/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.19/0.44
% 0.19/0.44 ********************************
% 0.19/0.44 * All subproblems solved! *
% 0.19/0.44 ********************************
% 0.19/0.44 % SZS status Theorem for /export/starexec/sandbox2/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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:32,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.19/0.45
% 0.19/0.45 %**** Beginning of derivation protocol ****
% 0.19/0.45 % SZS output start CNFRefutation
% See solution above
% 0.19/0.45
% 0.19/0.45 %**** End of derivation protocol ****
% 0.19/0.45 %**** no. of clauses in derivation: 10 ****
% 0.19/0.45 %**** clause counter: 32 ****
% 0.19/0.45
% 0.19/0.45 % SZS status Theorem for /export/starexec/sandbox2/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:25,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:32,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------