TSTP Solution File: COL001-2 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : COL001-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n019.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 : Fri Jul 15 00:34:28 EDT 2022
% Result : Unsatisfiable 0.18s 0.51s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of formulae : 46 ( 39 unt; 7 typ; 0 def)
% Number of atoms : 101 ( 62 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 299 ( 7 ~; 0 |; 0 &; 292 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 2 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 8 con; 0-2 aty)
% Number of variables : 60 ( 0 ^ 60 !; 0 ?; 60 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_apply,type,
apply: $i > $i > $i ).
thf(tp_b,type,
b: $i ).
thf(tp_combinator,type,
combinator: $i ).
thf(tp_i,type,
i: $i ).
thf(tp_k,type,
k: $i ).
thf(tp_s,type,
s: $i ).
thf(tp_x,type,
x: $i ).
thf(1,axiom,
! [X: $i] :
( ( apply @ ( apply @ ( apply @ s @ ( apply @ b @ X ) ) @ i ) @ ( apply @ ( apply @ s @ ( apply @ b @ X ) ) @ i ) )
= ( apply @ x @ ( apply @ ( apply @ ( apply @ s @ ( apply @ b @ X ) ) @ i ) @ ( apply @ ( apply @ s @ ( apply @ b @ X ) ) @ i ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sb_property) ).
thf(2,axiom,
! [X: $i] :
( ( apply @ i @ X )
= X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',i_definition) ).
thf(3,axiom,
! [X: $i,Y: $i,Z: $i] :
( ( apply @ ( apply @ ( apply @ b @ X ) @ Y ) @ Z )
= ( apply @ X @ ( apply @ Y @ Z ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_definition) ).
thf(4,axiom,
! [X: $i,Y: $i] :
( ( apply @ ( apply @ k @ X ) @ Y )
= X ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k_definition) ).
thf(5,axiom,
! [X: $i,Y: $i,Z: $i] :
( ( apply @ ( apply @ ( apply @ s @ X ) @ Y ) @ Z )
= ( apply @ ( apply @ X @ Z ) @ ( apply @ Y @ Z ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',s_definition) ).
thf(6,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(7,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[6]) ).
thf(8,negated_conjecture,
! [Y: $i] :
( Y
!= ( apply @ combinator @ Y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_fixed_point) ).
thf(9,plain,
$false = $false,
inference(unfold_def,[status(thm)],[7]) ).
thf(10,plain,
( ( ! [X: $i] :
( ( apply @ ( apply @ ( apply @ s @ ( apply @ b @ X ) ) @ i ) @ ( apply @ ( apply @ s @ ( apply @ b @ X ) ) @ i ) )
= ( apply @ x @ ( apply @ ( apply @ ( apply @ s @ ( apply @ b @ X ) ) @ i ) @ ( apply @ ( apply @ s @ ( apply @ b @ X ) ) @ i ) ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[1]) ).
thf(11,plain,
( ( ! [X: $i] :
( ( apply @ i @ X )
= X ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(12,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( apply @ ( apply @ ( apply @ b @ X ) @ Y ) @ Z )
= ( apply @ X @ ( apply @ Y @ Z ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[3]) ).
thf(13,plain,
( ( ! [X: $i,Y: $i] :
( ( apply @ ( apply @ k @ X ) @ Y )
= X ) )
= $true ),
inference(unfold_def,[status(thm)],[4]) ).
thf(14,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( apply @ ( apply @ ( apply @ s @ X ) @ Y ) @ Z )
= ( apply @ ( apply @ X @ Z ) @ ( apply @ Y @ Z ) ) ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(15,plain,
( ( ! [Y: $i] :
( Y
!= ( apply @ combinator @ Y ) ) )
= $true ),
inference(unfold_def,[status(thm)],[8]) ).
thf(16,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[9]) ).
thf(17,plain,
( ( ! [Y: $i] :
( Y
!= ( apply @ combinator @ Y ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[15]) ).
thf(18,plain,
( ( ! [Y: $i] :
( Y
!= ( apply @ combinator @ Y ) ) )
= $true ),
inference(copy,[status(thm)],[17]) ).
thf(19,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( apply @ ( apply @ ( apply @ s @ X ) @ Y ) @ Z )
= ( apply @ ( apply @ X @ Z ) @ ( apply @ Y @ Z ) ) ) )
= $true ),
inference(copy,[status(thm)],[14]) ).
thf(20,plain,
( ( ! [X: $i,Y: $i] :
( ( apply @ ( apply @ k @ X ) @ Y )
= X ) )
= $true ),
inference(copy,[status(thm)],[13]) ).
thf(21,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( apply @ ( apply @ ( apply @ b @ X ) @ Y ) @ Z )
= ( apply @ X @ ( apply @ Y @ Z ) ) ) )
= $true ),
inference(copy,[status(thm)],[12]) ).
thf(22,plain,
( ( ! [X: $i] :
( ( apply @ i @ X )
= X ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(23,plain,
( ( ! [X: $i] :
( ( apply @ ( apply @ ( apply @ s @ ( apply @ b @ X ) ) @ i ) @ ( apply @ ( apply @ s @ ( apply @ b @ X ) ) @ i ) )
= ( apply @ x @ ( apply @ ( apply @ ( apply @ s @ ( apply @ b @ X ) ) @ i ) @ ( apply @ ( apply @ s @ ( apply @ b @ X ) ) @ i ) ) ) ) )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(24,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[16]) ).
thf(25,plain,
! [SV1: $i] :
( ( ( SV1
!= ( apply @ combinator @ SV1 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[18]) ).
thf(26,plain,
! [SV2: $i] :
( ( ! [SY11: $i,SY12: $i] :
( ( apply @ ( apply @ ( apply @ s @ SV2 ) @ SY11 ) @ SY12 )
= ( apply @ ( apply @ SV2 @ SY12 ) @ ( apply @ SY11 @ SY12 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[19]) ).
thf(27,plain,
! [SV3: $i] :
( ( ! [SY13: $i] :
( ( apply @ ( apply @ k @ SV3 ) @ SY13 )
= SV3 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[20]) ).
thf(28,plain,
! [SV4: $i] :
( ( ! [SY14: $i,SY15: $i] :
( ( apply @ ( apply @ ( apply @ b @ SV4 ) @ SY14 ) @ SY15 )
= ( apply @ SV4 @ ( apply @ SY14 @ SY15 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[21]) ).
thf(29,plain,
! [SV5: $i] :
( ( ( apply @ i @ SV5 )
= SV5 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[22]) ).
thf(30,plain,
! [SV6: $i] :
( ( ( apply @ ( apply @ ( apply @ s @ ( apply @ b @ SV6 ) ) @ i ) @ ( apply @ ( apply @ s @ ( apply @ b @ SV6 ) ) @ i ) )
= ( apply @ x @ ( apply @ ( apply @ ( apply @ s @ ( apply @ b @ SV6 ) ) @ i ) @ ( apply @ ( apply @ s @ ( apply @ b @ SV6 ) ) @ i ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[23]) ).
thf(31,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[24]) ).
thf(32,plain,
! [SV1: $i] :
( ( SV1
= ( apply @ combinator @ SV1 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[25]) ).
thf(33,plain,
! [SV7: $i,SV2: $i] :
( ( ! [SY16: $i] :
( ( apply @ ( apply @ ( apply @ s @ SV2 ) @ SV7 ) @ SY16 )
= ( apply @ ( apply @ SV2 @ SY16 ) @ ( apply @ SV7 @ SY16 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[26]) ).
thf(34,plain,
! [SV8: $i,SV3: $i] :
( ( ( apply @ ( apply @ k @ SV3 ) @ SV8 )
= SV3 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[27]) ).
thf(35,plain,
! [SV9: $i,SV4: $i] :
( ( ! [SY17: $i] :
( ( apply @ ( apply @ ( apply @ b @ SV4 ) @ SV9 ) @ SY17 )
= ( apply @ SV4 @ ( apply @ SV9 @ SY17 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[28]) ).
thf(36,plain,
! [SV10: $i,SV7: $i,SV2: $i] :
( ( ( apply @ ( apply @ ( apply @ s @ SV2 ) @ SV7 ) @ SV10 )
= ( apply @ ( apply @ SV2 @ SV10 ) @ ( apply @ SV7 @ SV10 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[33]) ).
thf(37,plain,
! [SV11: $i,SV9: $i,SV4: $i] :
( ( ( apply @ ( apply @ ( apply @ b @ SV4 ) @ SV9 ) @ SV11 )
= ( apply @ SV4 @ ( apply @ SV9 @ SV11 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[35]) ).
thf(38,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[29,37,36,34,32,31,30]) ).
thf(39,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[38]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : COL001-2 : TPTP v8.1.0. Released v1.0.0.
% 0.03/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.33 % Computer : n019.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 : Tue May 31 10:44:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.12/0.34
% 0.12/0.34 No.of.Axioms: 6
% 0.12/0.34
% 0.12/0.34 Length.of.Defs: 0
% 0.12/0.34
% 0.12/0.34 Contains.Choice.Funs: false
% 0.12/0.35 (rf:0,axioms:6,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:8,loop_count:0,foatp_calls:0,translation:fof_full)..
% 0.18/0.51
% 0.18/0.51 ********************************
% 0.18/0.51 * All subproblems solved! *
% 0.18/0.51 ********************************
% 0.18/0.51 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:6,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:38,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.18/0.51
% 0.18/0.51 %**** Beginning of derivation protocol ****
% 0.18/0.51 % SZS output start CNFRefutation
% See solution above
% 0.18/0.51
% 0.18/0.51 %**** End of derivation protocol ****
% 0.18/0.51 %**** no. of clauses in derivation: 39 ****
% 0.18/0.51 %**** clause counter: 38 ****
% 0.18/0.51
% 0.18/0.51 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p : (rf:0,axioms:6,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:38,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------