TSTP Solution File: SYN340+1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : SYN340+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 : 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 08:25:20 EDT 2022
% Result : Theorem 0.13s 0.37s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 3
% Syntax : Number of formulae : 22 ( 19 unt; 2 typ; 0 def)
% Number of atoms : 65 ( 18 equ; 0 cnn)
% Maximal formula atoms : 2 ( 3 avg)
% Number of connectives : 183 ( 20 ~; 3 |; 2 &; 154 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 5 ( 2 usr; 2 con; 0-5 aty)
% Number of variables : 68 ( 0 ^ 56 !; 12 ?; 68 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_big_f,type,
big_f: $i > $i > $i > $i > $i > $o ).
thf(tp_sK1_Y,type,
sK1_Y: $i > $i ).
thf(1,conjecture,
? [X: $i] :
! [Y: $i] :
? [Z1: $i,Z2: $i] :
( ( big_f @ X @ Y @ Z1 @ Z2 @ Z1 )
=> ( big_f @ Z1 @ X @ Y @ Z1 @ Z2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',church_46_15_5) ).
thf(2,negated_conjecture,
( ( ? [X: $i] :
! [Y: $i] :
? [Z1: $i,Z2: $i] :
( ( big_f @ X @ Y @ Z1 @ Z2 @ Z1 )
=> ( big_f @ Z1 @ X @ Y @ Z1 @ Z2 ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ? [X: $i] :
! [Y: $i] :
? [Z1: $i,Z2: $i] :
( ( big_f @ X @ Y @ Z1 @ Z2 @ Z1 )
=> ( big_f @ Z1 @ X @ Y @ Z1 @ Z2 ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ~ ? [X: $i] :
! [Y: $i] :
? [Z1: $i,Z2: $i] :
( ( big_f @ X @ Y @ Z1 @ Z2 @ Z1 )
=> ( big_f @ Z1 @ X @ Y @ Z1 @ Z2 ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [X: $i] :
( ! [SY4: $i,SY5: $i] : ( big_f @ X @ ( sK1_Y @ X ) @ SY4 @ SY5 @ SY4 )
& ! [SY6: $i,SY7: $i] :
~ ( big_f @ SY6 @ X @ ( sK1_Y @ X ) @ SY6 @ SY7 ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[4]) ).
thf(6,plain,
( ( ! [X: $i] :
( ! [SY4: $i,SY5: $i] : ( big_f @ X @ ( sK1_Y @ X ) @ SY4 @ SY5 @ SY4 )
& ! [SY6: $i,SY7: $i] :
~ ( big_f @ SY6 @ X @ ( sK1_Y @ X ) @ SY6 @ SY7 ) ) )
= $true ),
inference(copy,[status(thm)],[5]) ).
thf(7,plain,
( ( ! [SX0: $i] :
~ ( ~ ! [SX1: $i,SX2: $i] : ( big_f @ SX0 @ ( sK1_Y @ SX0 ) @ SX1 @ SX2 @ SX1 )
| ~ ! [SX1: $i,SX2: $i] :
~ ( big_f @ SX1 @ SX0 @ ( sK1_Y @ SX0 ) @ SX1 @ SX2 ) ) )
= $true ),
inference(unfold_def,[status(thm)],[6]) ).
thf(8,plain,
! [SV1: $i] :
( ( ~ ( ~ ! [SY8: $i,SY9: $i] : ( big_f @ SV1 @ ( sK1_Y @ SV1 ) @ SY8 @ SY9 @ SY8 )
| ~ ! [SY10: $i,SY11: $i] :
~ ( big_f @ SY10 @ SV1 @ ( sK1_Y @ SV1 ) @ SY10 @ SY11 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[7]) ).
thf(9,plain,
! [SV1: $i] :
( ( ~ ! [SY8: $i,SY9: $i] : ( big_f @ SV1 @ ( sK1_Y @ SV1 ) @ SY8 @ SY9 @ SY8 )
| ~ ! [SY10: $i,SY11: $i] :
~ ( big_f @ SY10 @ SV1 @ ( sK1_Y @ SV1 ) @ SY10 @ SY11 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[8]) ).
thf(10,plain,
! [SV1: $i] :
( ( ~ ! [SY8: $i,SY9: $i] : ( big_f @ SV1 @ ( sK1_Y @ SV1 ) @ SY8 @ SY9 @ SY8 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[9]) ).
thf(11,plain,
! [SV1: $i] :
( ( ~ ! [SY10: $i,SY11: $i] :
~ ( big_f @ SY10 @ SV1 @ ( sK1_Y @ SV1 ) @ SY10 @ SY11 ) )
= $false ),
inference(extcnf_or_neg,[status(thm)],[9]) ).
thf(12,plain,
! [SV1: $i] :
( ( ! [SY8: $i,SY9: $i] : ( big_f @ SV1 @ ( sK1_Y @ SV1 ) @ SY8 @ SY9 @ SY8 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[10]) ).
thf(13,plain,
! [SV1: $i] :
( ( ! [SY10: $i,SY11: $i] :
~ ( big_f @ SY10 @ SV1 @ ( sK1_Y @ SV1 ) @ SY10 @ SY11 ) )
= $true ),
inference(extcnf_not_neg,[status(thm)],[11]) ).
thf(14,plain,
! [SV2: $i,SV1: $i] :
( ( ! [SY12: $i] : ( big_f @ SV1 @ ( sK1_Y @ SV1 ) @ SV2 @ SY12 @ SV2 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[12]) ).
thf(15,plain,
! [SV1: $i,SV3: $i] :
( ( ! [SY13: $i] :
~ ( big_f @ SV3 @ SV1 @ ( sK1_Y @ SV1 ) @ SV3 @ SY13 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[13]) ).
thf(16,plain,
! [SV4: $i,SV2: $i,SV1: $i] :
( ( big_f @ SV1 @ ( sK1_Y @ SV1 ) @ SV2 @ SV4 @ SV2 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[14]) ).
thf(17,plain,
! [SV5: $i,SV1: $i,SV3: $i] :
( ( ~ ( big_f @ SV3 @ SV1 @ ( sK1_Y @ SV1 ) @ SV3 @ SV5 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[15]) ).
thf(18,plain,
! [SV5: $i,SV1: $i,SV3: $i] :
( ( big_f @ SV3 @ SV1 @ ( sK1_Y @ SV1 ) @ SV3 @ SV5 )
= $false ),
inference(extcnf_not_pos,[status(thm)],[17]) ).
thf(19,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[16,18]) ).
thf(20,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[19]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYN340+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 : 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 : Mon Jul 11 11:41:59 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: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.13/0.37
% 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: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:19,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: 20 ****
% 0.13/0.37 %**** clause counter: 19 ****
% 0.13/0.37
% 0.13/0.37 % 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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:19,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------