TSTP Solution File: SEV405^5 by cocATP---0.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SEV405^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 : n104.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:34:09 EDT 2014

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

% Comments : 
%------------------------------------------------------------------------------
%----ERROR: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% % Problem  : SEV405^5 : TPTP v6.1.0. Released v4.0.0.
% % Command  : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% % Computer : n104.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 09:09:11 CDT 2014
% % CPUTime  : 0.41 
% 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 0x221bab8>, <kernel.Sort object at 0x20dfe18>) of role type named cA
% Using role type
% Declaring cA:Prop
% FOF formula ((ex (fofType->Prop)) (fun (U:(fofType->Prop))=> (forall (V:fofType), ((iff (U V)) cA)))) of role conjecture named cCOMP1
% Conjecture to prove = ((ex (fofType->Prop)) (fun (U:(fofType->Prop))=> (forall (V:fofType), ((iff (U V)) cA)))):Prop
% Parameter fofType_DUMMY:fofType.
% We need to prove ['((ex (fofType->Prop)) (fun (U:(fofType->Prop))=> (forall (V:fofType), ((iff (U V)) cA))))']
% Parameter cA:Prop.
% Parameter fofType:Type.
% Trying to prove ((ex (fofType->Prop)) (fun (U:(fofType->Prop))=> (forall (V:fofType), ((iff (U V)) cA))))
% Found iff_refl0:=(iff_refl (x V)):((iff (x V)) (x V))
% Found (iff_refl (x V)) as proof of ((iff (x V)) cA)
% Found (iff_refl (x V)) as proof of ((iff (x V)) cA)
% Found (fun (V:fofType)=> (iff_refl (x V))) as proof of ((iff (x V)) cA)
% Found (fun (V:fofType)=> (iff_refl (x V))) as proof of (forall (V:fofType), ((iff (x V)) cA))
% Found (ex_intro000 (fun (V:fofType)=> (iff_refl (x V)))) as proof of ((ex (fofType->Prop)) (fun (U:(fofType->Prop))=> (forall (V:fofType), ((iff (U V)) cA))))
% Found ((ex_intro00 (fun (x1:fofType)=> cA)) (fun (V:fofType)=> (iff_refl ((fun (x1:fofType)=> cA) V)))) as proof of ((ex (fofType->Prop)) (fun (U:(fofType->Prop))=> (forall (V:fofType), ((iff (U V)) cA))))
% Found (((ex_intro0 (fun (U:(fofType->Prop))=> (forall (V:fofType), ((iff (U V)) cA)))) (fun (x1:fofType)=> cA)) (fun (V:fofType)=> (iff_refl ((fun (x1:fofType)=> cA) V)))) as proof of ((ex (fofType->Prop)) (fun (U:(fofType->Prop))=> (forall (V:fofType), ((iff (U V)) cA))))
% Found ((((ex_intro (fofType->Prop)) (fun (U:(fofType->Prop))=> (forall (V:fofType), ((iff (U V)) cA)))) (fun (x1:fofType)=> cA)) (fun (V:fofType)=> (iff_refl ((fun (x1:fofType)=> cA) V)))) as proof of ((ex (fofType->Prop)) (fun (U:(fofType->Prop))=> (forall (V:fofType), ((iff (U V)) cA))))
% Found ((((ex_intro (fofType->Prop)) (fun (U:(fofType->Prop))=> (forall (V:fofType), ((iff (U V)) cA)))) (fun (x1:fofType)=> cA)) (fun (V:fofType)=> (iff_refl ((fun (x1:fofType)=> cA) V)))) as proof of ((ex (fofType->Prop)) (fun (U:(fofType->Prop))=> (forall (V:fofType), ((iff (U V)) cA))))
% Got proof ((((ex_intro (fofType->Prop)) (fun (U:(fofType->Prop))=> (forall (V:fofType), ((iff (U V)) cA)))) (fun (x1:fofType)=> cA)) (fun (V:fofType)=> (iff_refl ((fun (x1:fofType)=> cA) V))))
% Time elapsed = 0.098185s
% node=20 cost=135.000000 depth=8
% ::::::::::::::::::::::
% % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% ((((ex_intro (fofType->Prop)) (fun (U:(fofType->Prop))=> (forall (V:fofType), ((iff (U V)) cA)))) (fun (x1:fofType)=> cA)) (fun (V:fofType)=> (iff_refl ((fun (x1:fofType)=> cA) V))))
% % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% EOF
%------------------------------------------------------------------------------