↑ Up

cocATP---0.2.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SEU921^5 : TPTP v6.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n105.star.cs.uiowa.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz
% Memory   : 32286.75MB
% OS       : Linux 2.6.32-431.20.3.el6.x86_64
% CPULimit : 300s
% DateTime : Thu Jul 17 13:33:23 EDT 2014

% Result   : Theorem 1.19s
% Output   : Proof 1.19s
% Verified : 
% SZS Type : None (Parsing solution fails)
% Syntax   : Number of formulae    : 0

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SEU921^5 : TPTP v6.1.0. Released v4.0.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n105.star.cs.uiowa.edu
% % Model    : x86_64 x86_64
% % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% % Memory   : 32286.75MB
% % OS       : Linux 2.6.32-431.20.3.el6.x86_64
% % CPULimit : 300
% % DateTime : Thu Jul 17 11:42:51 CDT 2014
% % CPUTime  : 1.19 
% Python 2.7.5
% Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% FOF formula (<kernel.Constant object at 0x20adbd8>, <kernel.DependentProduct object at 0x20adb90>) of role type named f
% Using role type
% Declaring f:(fofType->fofType)
% FOF formula (<kernel.Constant object at 0x1ebcc68>, <kernel.DependentProduct object at 0x20ad050>) of role type named g
% Using role type
% Declaring g:(fofType->fofType)
% FOF formula (<kernel.Constant object at 0x20ad518>, <kernel.DependentProduct object at 0x20adcb0>) of role type named h
% Using role type
% Declaring h:(fofType->fofType)
% FOF formula ((forall (Xx:fofType) (Xy:fofType), ((((eq fofType) (g Xx)) Xy)->(((eq fofType) (h Xy)) (f Xx))))->(((eq (fofType->fofType)) (fun (Xx:fofType)=> (h (g Xx)))) f)) of role conjecture named cTHM588LEM2_pme
% Conjecture to prove = ((forall (Xx:fofType) (Xy:fofType), ((((eq fofType) (g Xx)) Xy)->(((eq fofType) (h Xy)) (f Xx))))->(((eq (fofType->fofType)) (fun (Xx:fofType)=> (h (g Xx)))) f)):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['((forall (Xx:fofType) (Xy:fofType), ((((eq fofType) (g Xx)) Xy)->(((eq fofType) (h Xy)) (f Xx))))->(((eq (fofType->fofType)) (fun (Xx:fofType)=> (h (g Xx)))) f))']
% Parameter fofType:Type.
% Parameter f:(fofType->fofType).
% Parameter g:(fofType->fofType).
% Parameter h:(fofType->fofType).
% Trying to prove ((forall (Xx:fofType) (Xy:fofType), ((((eq fofType) (g Xx)) Xy)->(((eq fofType) (h Xy)) (f Xx))))->(((eq (fofType->fofType)) (fun (Xx:fofType)=> (h (g Xx)))) f))
% Found eq_ref00:=(eq_ref0 (g x0)):(((eq fofType) (g x0)) (g x0))
% Found (eq_ref0 (g x0)) as proof of (((eq fofType) (g x0)) (g x0))
% Found ((eq_ref fofType) (g x0)) as proof of (((eq fofType) (g x0)) (g x0))
% Found ((eq_ref fofType) (g x0)) as proof of (((eq fofType) (g x0)) (g x0))
% Found (x10 ((eq_ref fofType) (g x0))) as proof of (((eq fofType) (h (g x0))) (f x0))
% Found ((x1 (g x0)) ((eq_ref fofType) (g x0))) as proof of (((eq fofType) (h (g x0))) (f x0))
% Found (((x x0) (g x0)) ((eq_ref fofType) (g x0))) as proof of (((eq fofType) (h (g x0))) (f x0))
% Found (fun (x0:fofType)=> (((x x0) (g x0)) ((eq_ref fofType) (g x0)))) as proof of (((eq fofType) (h (g x0))) (f x0))
% Found (fun (x0:fofType)=> (((x x0) (g x0)) ((eq_ref fofType) (g x0)))) as proof of (forall (x:fofType), (((eq fofType) (h (g x))) (f x)))
% Found (functional_extensionality_dep0000 (fun (x0:fofType)=> (((x x0) (g x0)) ((eq_ref fofType) (g x0))))) as proof of (((eq (fofType->fofType)) (fun (Xx:fofType)=> (h (g Xx)))) f)
% Found ((functional_extensionality_dep000 f) (fun (x0:fofType)=> (((x x0) (g x0)) ((eq_ref fofType) (g x0))))) as proof of (((eq (fofType->fofType)) (fun (Xx:fofType)=> (h (g Xx)))) f)
% Found (((functional_extensionality_dep00 (fun (Xx:fofType)=> (h (g Xx)))) f) (fun (x0:fofType)=> (((x x0) (g x0)) ((eq_ref fofType) (g x0))))) as proof of (((eq (fofType->fofType)) (fun (Xx:fofType)=> (h (g Xx)))) f)
% Found ((((functional_extensionality_dep0 (fun (x2:fofType)=> fofType)) (fun (Xx:fofType)=> (h (g Xx)))) f) (fun (x0:fofType)=> (((x x0) (g x0)) ((eq_ref fofType) (g x0))))) as proof of (((eq (fofType->fofType)) (fun (Xx:fofType)=> (h (g Xx)))) f)
% Found (((((functional_extensionality_dep fofType) (fun (x2:fofType)=> fofType)) (fun (Xx:fofType)=> (h (g Xx)))) f) (fun (x0:fofType)=> (((x x0) (g x0)) ((eq_ref fofType) (g x0))))) as proof of (((eq (fofType->fofType)) (fun (Xx:fofType)=> (h (g Xx)))) f)
% Found (fun (x:(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) (g Xx)) Xy)->(((eq fofType) (h Xy)) (f Xx)))))=> (((((functional_extensionality_dep fofType) (fun (x2:fofType)=> fofType)) (fun (Xx:fofType)=> (h (g Xx)))) f) (fun (x0:fofType)=> (((x x0) (g x0)) ((eq_ref fofType) (g x0)))))) as proof of (((eq (fofType->fofType)) (fun (Xx:fofType)=> (h (g Xx)))) f)
% Found (fun (x:(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) (g Xx)) Xy)->(((eq fofType) (h Xy)) (f Xx)))))=> (((((functional_extensionality_dep fofType) (fun (x2:fofType)=> fofType)) (fun (Xx:fofType)=> (h (g Xx)))) f) (fun (x0:fofType)=> (((x x0) (g x0)) ((eq_ref fofType) (g x0)))))) as proof of ((forall (Xx:fofType) (Xy:fofType), ((((eq fofType) (g Xx)) Xy)->(((eq fofType) (h Xy)) (f Xx))))->(((eq (fofType->fofType)) (fun (Xx:fofType)=> (h (g Xx)))) f))
% Got proof (fun (x:(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) (g Xx)) Xy)->(((eq fofType) (h Xy)) (f Xx)))))=> (((((functional_extensionality_dep fofType) (fun (x2:fofType)=> fofType)) (fun (Xx:fofType)=> (h (g Xx)))) f) (fun (x0:fofType)=> (((x x0) (g x0)) ((eq_ref fofType) (g x0))))))
% Time elapsed = 0.874783s
% node=169 cost=75.000000 depth=14
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% (fun (x:(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) (g Xx)) Xy)->(((eq fofType) (h Xy)) (f Xx)))))=> (((((functional_extensionality_dep fofType) (fun (x2:fofType)=> fofType)) (fun (Xx:fofType)=> (h (g Xx)))) f) (fun (x0:fofType)=> (((x x0) (g x0)) ((eq_ref fofType) (g x0))))))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------