%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU524^2 : TPTP v6.1.0. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % Computer : n180.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:32:22 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 : SEU524^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n180.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 10:30:41 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 0x1bc6b90>, <kernel.DependentProduct object at 0x1bc6c68>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x1da4368>, <kernel.DependentProduct object at 0x1bc6b00>) of role type named powerset_type % Using role type % Declaring powerset:(fofType->fofType) % FOF formula (<kernel.Constant object at 0x1bc66c8>, <kernel.DependentProduct object at 0x1bc67e8>) of role type named setunion_type % Using role type % Declaring setunion:(fofType->fofType) % FOF formula (<kernel.Constant object at 0x1bc6bd8>, <kernel.Sort object at 0x1e74998>) of role type named powersetI_type % Using role type % Declaring powersetI:Prop % FOF formula (((eq Prop) powersetI) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->((in B) (powerset A))))) of role definition named powersetI % A new definition: (((eq Prop) powersetI) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->((in B) (powerset A))))) % Defined: powersetI:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->((in B) (powerset A)))) % FOF formula (<kernel.Constant object at 0x1bc6998>, <kernel.Sort object at 0x1e74998>) of role type named setunionI_type % Using role type % Declaring setunionI:Prop % FOF formula (((eq Prop) setunionI) (forall (A:fofType) (Xx:fofType) (B:fofType), (((in Xx) B)->(((in B) A)->((in Xx) (setunion A)))))) of role definition named setunionI % A new definition: (((eq Prop) setunionI) (forall (A:fofType) (Xx:fofType) (B:fofType), (((in Xx) B)->(((in B) A)->((in Xx) (setunion A)))))) % Defined: setunionI:=(forall (A:fofType) (Xx:fofType) (B:fofType), (((in Xx) B)->(((in B) A)->((in Xx) (setunion A))))) % FOF formula (powersetI->(setunionI->(forall (A:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) (powerset (setunion A))))))) of role conjecture named subPowSU % Conjecture to prove = (powersetI->(setunionI->(forall (A:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) (powerset (setunion A))))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(powersetI->(setunionI->(forall (A:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) (powerset (setunion A)))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter powerset:(fofType->fofType). % Parameter setunion:(fofType->fofType). % Definition powersetI:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) B)->((in Xx) A)))->((in B) (powerset A)))):Prop. % Definition setunionI:=(forall (A:fofType) (Xx:fofType) (B:fofType), (((in Xx) B)->(((in B) A)->((in Xx) (setunion A))))):Prop. % Trying to prove (powersetI->(setunionI->(forall (A:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) (powerset (setunion A))))))) % Found x000000:=(x00000 x1):((in Xx0) (setunion A)) % Found (x00000 x1) as proof of ((in Xx0) (setunion A)) % Found ((x0000 x3) x1) as proof of ((in Xx0) (setunion A)) % Found (((x000 Xx) x3) x1) as proof of ((in Xx0) (setunion A)) % Found ((((x00 Xx0) Xx) x3) x1) as proof of ((in Xx0) (setunion A)) % Found (((((x0 A) Xx0) Xx) x3) x1) as proof of ((in Xx0) (setunion A)) % Found (fun (x3:((in Xx0) Xx))=> (((((x0 A) Xx0) Xx) x3) x1)) as proof of ((in Xx0) (setunion A)) % Found (fun (Xx0:fofType) (x3:((in Xx0) Xx))=> (((((x0 A) Xx0) Xx) x3) x1)) as proof of (((in Xx0) Xx)->((in Xx0) (setunion A))) % Found (fun (Xx0:fofType) (x3:((in Xx0) Xx))=> (((((x0 A) Xx0) Xx) x3) x1)) as proof of (forall (Xx0:fofType), (((in Xx0) Xx)->((in Xx0) (setunion A)))) % Found (x20 (fun (Xx0:fofType) (x3:((in Xx0) Xx))=> (((((x0 A) Xx0) Xx) x3) x1))) as proof of ((in Xx) (powerset (setunion A))) % Found ((x2 Xx) (fun (Xx0:fofType) (x3:((in Xx0) Xx))=> (((((x0 A) Xx0) Xx) x3) x1))) as proof of ((in Xx) (powerset (setunion A))) % Found (((x (setunion A)) Xx) (fun (Xx0:fofType) (x3:((in Xx0) Xx))=> (((((x0 A) Xx0) Xx) x3) x1))) as proof of ((in Xx) (powerset (setunion A))) % Found (fun (x1:((in Xx) A))=> (((x (setunion A)) Xx) (fun (Xx0:fofType) (x3:((in Xx0) Xx))=> (((((x0 A) Xx0) Xx) x3) x1)))) as proof of ((in Xx) (powerset (setunion A))) % Found (fun (Xx:fofType) (x1:((in Xx) A))=> (((x (setunion A)) Xx) (fun (Xx0:fofType) (x3:((in Xx0) Xx))=> (((((x0 A) Xx0) Xx) x3) x1)))) as proof of (((in Xx) A)->((in Xx) (powerset (setunion A)))) % Found (fun (A:fofType) (Xx:fofType) (x1:((in Xx) A))=> (((x (setunion A)) Xx) (fun (Xx0:fofType) (x3:((in Xx0) Xx))=> (((((x0 A) Xx0) Xx) x3) x1)))) as proof of (forall (Xx:fofType), (((in Xx) A)->((in Xx) (powerset (setunion A))))) % Found (fun (x0:setunionI) (A:fofType) (Xx:fofType) (x1:((in Xx) A))=> (((x (setunion A)) Xx) (fun (Xx0:fofType) (x3:((in Xx0) Xx))=> (((((x0 A) Xx0) Xx) x3) x1)))) as proof of (forall (A:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) (powerset (setunion A))))) % Found (fun (x:powersetI) (x0:setunionI) (A:fofType) (Xx:fofType) (x1:((in Xx) A))=> (((x (setunion A)) Xx) (fun (Xx0:fofType) (x3:((in Xx0) Xx))=> (((((x0 A) Xx0) Xx) x3) x1)))) as proof of (setunionI->(forall (A:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) (powerset (setunion A)))))) % Found (fun (x:powersetI) (x0:setunionI) (A:fofType) (Xx:fofType) (x1:((in Xx) A))=> (((x (setunion A)) Xx) (fun (Xx0:fofType) (x3:((in Xx0) Xx))=> (((((x0 A) Xx0) Xx) x3) x1)))) as proof of (powersetI->(setunionI->(forall (A:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) (powerset (setunion A))))))) % Got proof (fun (x:powersetI) (x0:setunionI) (A:fofType) (Xx:fofType) (x1:((in Xx) A))=> (((x (setunion A)) Xx) (fun (Xx0:fofType) (x3:((in Xx0) Xx))=> (((((x0 A) Xx0) Xx) x3) x1)))) % Time elapsed = 0.096603s % node=17 cost=432.000000 depth=16 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:powersetI) (x0:setunionI) (A:fofType) (Xx:fofType) (x1:((in Xx) A))=> (((x (setunion A)) Xx) (fun (Xx0:fofType) (x3:((in Xx0) Xx))=> (((((x0 A) Xx0) Xx) x3) x1)))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------