TSTP Solution File: ALG284^5 by LEO-II---1.7.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : LEO-II---1.7.0
% Problem : ALG284^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 : n018.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 14 17:25:42 EDT 2022
% Result : Theorem 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 6
% Syntax : Number of formulae : 26 ( 20 unt; 5 typ; 0 def)
% Number of atoms : 68 ( 47 equ; 0 cnn)
% Maximal formula atoms : 4 ( 3 avg)
% Number of connectives : 162 ( 3 ~; 0 |; 6 &; 150 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 3 >; 0 *; 0 +; 0 <<)
% Number of symbols : 8 ( 5 usr; 5 con; 0-2 aty)
% Number of variables : 46 ( 0 ^ 46 !; 0 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(tp_cE,type,
cE: $i ).
thf(tp_cJ,type,
cJ: $i > $i ).
thf(tp_cP,type,
cP: $i > $i > $i ).
thf(tp_sK1_X,type,
sK1_X: $i ).
thf(tp_sK2_SY7,type,
sK2_SY7: $i ).
thf(1,conjecture,
( ( ! [Xx: $i,Xy: $i,Xz: $i] :
( ( cP @ ( cP @ Xx @ Xy ) @ Xz )
= ( cP @ Xx @ ( cP @ Xy @ Xz ) ) )
& ! [Xx: $i] :
( ( cP @ cE @ Xx )
= Xx )
& ! [Xy: $i] :
( ( cP @ ( cJ @ Xy ) @ Xy )
= cE ) )
=> ! [X: $i,Y: $i] :
( ( cJ @ ( cP @ X @ Y ) )
= ( cP @ ( cJ @ Y ) @ ( cJ @ X ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM18_pme) ).
thf(2,negated_conjecture,
( ( ( ! [Xx: $i,Xy: $i,Xz: $i] :
( ( cP @ ( cP @ Xx @ Xy ) @ Xz )
= ( cP @ Xx @ ( cP @ Xy @ Xz ) ) )
& ! [Xx: $i] :
( ( cP @ cE @ Xx )
= Xx )
& ! [Xy: $i] :
( ( cP @ ( cJ @ Xy ) @ Xy )
= cE ) )
=> ! [X: $i,Y: $i] :
( ( cJ @ ( cP @ X @ Y ) )
= ( cP @ ( cJ @ Y ) @ ( cJ @ X ) ) ) )
= $false ),
inference(negate_conjecture,[status(cth)],[1]) ).
thf(3,plain,
( ( ( ! [Xx: $i,Xy: $i,Xz: $i] :
( ( cP @ ( cP @ Xx @ Xy ) @ Xz )
= ( cP @ Xx @ ( cP @ Xy @ Xz ) ) )
& ! [Xx: $i] :
( ( cP @ cE @ Xx )
= Xx )
& ! [Xy: $i] :
( ( cP @ ( cJ @ Xy ) @ Xy )
= cE ) )
=> ! [X: $i,Y: $i] :
( ( cJ @ ( cP @ X @ Y ) )
= ( cP @ ( cJ @ Y ) @ ( cJ @ X ) ) ) )
= $false ),
inference(unfold_def,[status(thm)],[2]) ).
thf(4,plain,
( ( ! [Xx: $i,Xy: $i,Xz: $i] :
( ( cP @ ( cP @ Xx @ Xy ) @ Xz )
= ( cP @ Xx @ ( cP @ Xy @ Xz ) ) ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(5,plain,
( ( ! [Xx: $i] :
( ( cP @ cE @ Xx )
= Xx ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(6,plain,
( ( ! [Xy: $i] :
( ( cP @ ( cJ @ Xy ) @ Xy )
= cE ) )
= $true ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(7,plain,
( ( ! [X: $i,Y: $i] :
( ( cJ @ ( cP @ X @ Y ) )
= ( cP @ ( cJ @ Y ) @ ( cJ @ X ) ) ) )
= $false ),
inference(standard_cnf,[status(thm)],[3]) ).
thf(8,plain,
( ( ~ ! [X: $i,Y: $i] :
( ( cJ @ ( cP @ X @ Y ) )
= ( cP @ ( cJ @ Y ) @ ( cJ @ X ) ) ) )
= $true ),
inference(polarity_switch,[status(thm)],[7]) ).
thf(9,plain,
( ( ( ( cJ @ ( cP @ sK1_X @ sK2_SY7 ) )
!= ( cP @ ( cJ @ sK2_SY7 ) @ ( cJ @ sK1_X ) ) ) )
= $true ),
inference(extcnf_combined,[status(esa)],[8]) ).
thf(10,plain,
( ( ! [Xy: $i] :
( ( cP @ ( cJ @ Xy ) @ Xy )
= cE ) )
= $true ),
inference(copy,[status(thm)],[6]) ).
thf(11,plain,
( ( ! [Xx: $i] :
( ( cP @ cE @ Xx )
= Xx ) )
= $true ),
inference(copy,[status(thm)],[5]) ).
thf(12,plain,
( ( ! [Xx: $i,Xy: $i,Xz: $i] :
( ( cP @ ( cP @ Xx @ Xy ) @ Xz )
= ( cP @ Xx @ ( cP @ Xy @ Xz ) ) ) )
= $true ),
inference(copy,[status(thm)],[4]) ).
thf(13,plain,
( ( ( ( cJ @ ( cP @ sK1_X @ sK2_SY7 ) )
!= ( cP @ ( cJ @ sK2_SY7 ) @ ( cJ @ sK1_X ) ) ) )
= $true ),
inference(copy,[status(thm)],[9]) ).
thf(14,plain,
! [SV1: $i] :
( ( ( cP @ ( cJ @ SV1 ) @ SV1 )
= cE )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[10]) ).
thf(15,plain,
! [SV2: $i] :
( ( ( cP @ cE @ SV2 )
= SV2 )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[11]) ).
thf(16,plain,
! [SV3: $i] :
( ( ! [SY8: $i,SY9: $i] :
( ( cP @ ( cP @ SV3 @ SY8 ) @ SY9 )
= ( cP @ SV3 @ ( cP @ SY8 @ SY9 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[12]) ).
thf(17,plain,
( ( ( cJ @ ( cP @ sK1_X @ sK2_SY7 ) )
= ( cP @ ( cJ @ sK2_SY7 ) @ ( cJ @ sK1_X ) ) )
= $false ),
inference(extcnf_not_pos,[status(thm)],[13]) ).
thf(18,plain,
! [SV4: $i,SV3: $i] :
( ( ! [SY10: $i] :
( ( cP @ ( cP @ SV3 @ SV4 ) @ SY10 )
= ( cP @ SV3 @ ( cP @ SV4 @ SY10 ) ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[16]) ).
thf(19,plain,
! [SV5: $i,SV4: $i,SV3: $i] :
( ( ( cP @ ( cP @ SV3 @ SV4 ) @ SV5 )
= ( cP @ SV3 @ ( cP @ SV4 @ SV5 ) ) )
= $true ),
inference(extcnf_forall_pos,[status(thm)],[18]) ).
thf(20,plain,
$false = $true,
inference(fo_atp_e,[status(thm)],[14,19,17,15]) ).
thf(21,plain,
$false,
inference(solved_all_splits,[solved_all_splits(join,[])],[20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ALG284^5 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : leo --timeout %d --proofoutput 1 --foatp e --atp e=./eprover %s
% 0.12/0.33 % Computer : n018.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 : Wed Jun 8 15:35:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.12/0.34
% 0.12/0.34 No.of.Axioms: 0
% 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.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.12/0.38
% 0.12/0.38 ********************************
% 0.12/0.38 * All subproblems solved! *
% 0.12/0.38 ********************************
% 0.12/0.38 % 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:20,loop_count:0,foatp_calls:1,translation:fof_full)
% 0.12/0.38
% 0.12/0.38 %**** Beginning of derivation protocol ****
% 0.12/0.38 % SZS output start CNFRefutation
% See solution above
% 0.12/0.38
% 0.12/0.38 %**** End of derivation protocol ****
% 0.12/0.38 %**** no. of clauses in derivation: 21 ****
% 0.12/0.38 %**** clause counter: 20 ****
% 0.12/0.38
% 0.12/0.38 % 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:20,loop_count:0,foatp_calls:1,translation:fof_full)
%------------------------------------------------------------------------------