TSTP Solution File: COL070-1 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : COL070-1 : TPTP v8.1.0. Released v1.2.0.
% Transfm : none
% Format : tptp
% Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% Computer : n020.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:45 EDT 2022
% Result : Unsatisfiable 0.20s 0.56s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 30 ( 26 unt; 4 typ; 0 def)
% Number of atoms : 68 ( 39 equ; 0 cnn)
% Maximal formula atoms : 1 ( 2 avg)
% Number of connectives : 151 ( 7 ~; 0 |; 0 &; 144 @)
% ( 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 : 7 ( 4 usr; 5 con; 0-2 aty)
% Number of variables : 42 ( 0 ^ 42 !; 0 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_apply,type,
apply: $i > $i > $i ).
thf(tp_b,type,
b: $i ).
thf(tp_combinator,type,
combinator: $i ).
thf(tp_n1,type,
n1: $i ).
thf(1,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(2,axiom,
! [X: $i,Y: $i,Z: $i] :
( ( apply @ ( apply @ ( apply @ n1 @ X ) @ Y ) @ Z )
= ( apply @ ( apply @ ( apply @ X @ Y ) @ Y ) @ Z ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',n1_definition) ).
thf(3,conjecture,
$false,
file('no conjecture given, we try to refute the axioms',dummy_conjecture) ).
thf(4,negated_conjecture,
$false = $false,
inference(negate_conjecture,[status(cth)],[3]) ).
thf(5,negated_conjecture,
! [Y: $i] :
( Y
!= ( apply @ combinator @ Y ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_fixed_point) ).
thf(6,plain,
$false = $false,
inference(unfold_def,[status(thm)],[4]) ).
thf(7,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)],[1]) ).
thf(8,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( apply @ ( apply @ ( apply @ n1 @ X ) @ Y ) @ Z )
= ( apply @ ( apply @ ( apply @ X @ Y ) @ Y ) @ Z ) ) )
= $true ),
inference(unfold_def,[status(thm)],[2]) ).
thf(9,plain,
( ( ! [Y: $i] :
( Y
!= ( apply @ combinator @ Y ) ) )
= $true ),
inference(unfold_def,[status(thm)],[5]) ).
thf(10,plain,
( ( ~ $false )
= $true ),
inference(polarity_switch,[status(thm)],[6]) ).
thf(11,plain,
( ( ! [Y: $i] :
( Y
!= ( apply @ combinator @ Y ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[9]) ).
thf(12,plain,
( ( ! [Y: $i] :
( Y
!= ( apply @ combinator @ Y ) ) )
= $true ),
inference(copy,[status(thm)],[11]) ).
thf(13,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( apply @ ( apply @ ( apply @ n1 @ X ) @ Y ) @ Z )
= ( apply @ ( apply @ ( apply @ X @ Y ) @ Y ) @ Z ) ) )
= $true ),
inference(copy,[status(thm)],[8]) ).
thf(14,plain,
( ( ! [X: $i,Y: $i,Z: $i] :
( ( apply @ ( apply @ ( apply @ b @ X ) @ Y ) @ Z )
= ( apply @ X @ ( apply @ Y @ Z ) ) ) )
= $true ),
inference(copy,[status(thm)],[7]) ).
thf(15,plain,
( ( ~ $false )
= $true ),
inference(copy,[status(thm)],[10]) ).
thf(16,plain,
! [SV1: $i] :
( ( ( SV1
!= ( apply @ combinator @ SV1 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[12]) ).
thf(17,plain,
! [SV2: $i] :
( ( ! [SY7: $i,SY8: $i] :
( ( apply @ ( apply @ ( apply @ n1 @ SV2 ) @ SY7 ) @ SY8 )
= ( apply @ ( apply @ ( apply @ SV2 @ SY7 ) @ SY7 ) @ SY8 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[13]) ).
thf(18,plain,
! [SV3: $i] :
( ( ! [SY9: $i,SY10: $i] :
( ( apply @ ( apply @ ( apply @ b @ SV3 ) @ SY9 ) @ SY10 )
= ( apply @ SV3 @ ( apply @ SY9 @ SY10 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[14]) ).
thf(19,plain,
$false = $false,
inference(extcnf_not_pos,[status(thm)],[15]) ).
thf(20,plain,
! [SV1: $i] :
( ( SV1
= ( apply @ combinator @ SV1 ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[16]) ).
thf(21,plain,
! [SV4: $i,SV2: $i] :
( ( ! [SY11: $i] :
( ( apply @ ( apply @ ( apply @ n1 @ SV2 ) @ SV4 ) @ SY11 )
= ( apply @ ( apply @ ( apply @ SV2 @ SV4 ) @ SV4 ) @ SY11 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[17]) ).
thf(22,plain,
! [SV5: $i,SV3: $i] :
( ( ! [SY12: $i] :
( ( apply @ ( apply @ ( apply @ b @ SV3 ) @ SV5 ) @ SY12 )
= ( apply @ SV3 @ ( apply @ SV5 @ SY12 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[18]) ).
thf(23,plain,
! [SV6: $i,SV4: $i,SV2: $i] :
( ( ( apply @ ( apply @ ( apply @ n1 @ SV2 ) @ SV4 ) @ SV6 )
= ( apply @ ( apply @ ( apply @ SV2 @ SV4 ) @ SV4 ) @ SV6 ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[21]) ).
thf(24,plain,
! [SV7: $i,SV5: $i,SV3: $i] :
( ( ( apply @ ( apply @ ( apply @ b @ SV3 ) @ SV5 ) @ SV7 )
= ( apply @ SV3 @ ( apply @ SV5 @ SV7 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[22]) ).
thf(25,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[19,24,23,20]) ).
thf(26,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[25]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : COL070-1 : TPTP v8.1.0. Released v1.2.0.
% 0.10/0.13 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.14/0.34 % Computer : n020.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue May 31 12:45:08 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.14/0.35
% 0.14/0.35 No.of.Axioms: 3
% 0.14/0.35
% 0.14/0.35 Length.of.Defs: 0
% 0.14/0.35
% 0.14/0.35 Contains.Choice.Funs: false
% 0.14/0.35 (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:600,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:5,loop_count:0,foatp_calls:0,translation:fof_full).
% 0.20/0.56
% 0.20/0.56 ********************************
% 0.20/0.56 * All subproblems solved! *
% 0.20/0.56 ********************************
% 0.20/0.56 % SZS status Unsatisfiable for /export/starexec/sandbox/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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:25,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.20/0.56
% 0.20/0.56 %**** Beginning of derivation protocol ****
% 0.20/0.56 % SZS output start CNFRefutation
% See solution above
% 0.20/0.56
% 0.20/0.56 %**** End of derivation protocol ****
% 0.20/0.56 %**** no. of clauses in derivation: 26 ****
% 0.20/0.56 %**** clause counter: 25 ****
% 0.20/0.56
% 0.20/0.56 % SZS status Unsatisfiable for /export/starexec/sandbox/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:74,atp_calls_frequency:10,ordering:none,proof_output:1,protocol_output:false,clause_count:25,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------