%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU578^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 : n102.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:31 EDT 2014 % Result : Theorem 0.36s % Output : Proof 0.36s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU578^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n102.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:47:21 CDT 2014 % % CPUTime : 0.36 % 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 0x104a248>, <kernel.DependentProduct object at 0xdf1c68>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x104a128>, <kernel.DependentProduct object at 0xdf1ab8>) of role type named powerset_type % Using role type % Declaring powerset:(fofType->fofType) % FOF formula (<kernel.Constant object at 0x104a248>, <kernel.DependentProduct object at 0xdf1ab8>) of role type named subset_type % Using role type % Declaring subset:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x1047368>, <kernel.Sort object at 0xad4a28>) of role type named subsetRefl_type % Using role type % Declaring subsetRefl:Prop % FOF formula (((eq Prop) subsetRefl) (forall (A:fofType), ((subset A) A))) of role definition named subsetRefl % A new definition: (((eq Prop) subsetRefl) (forall (A:fofType), ((subset A) A))) % Defined: subsetRefl:=(forall (A:fofType), ((subset A) A)) % FOF formula (<kernel.Constant object at 0x104a248>, <kernel.Sort object at 0xad4a28>) of role type named powersetI1_type % Using role type % Declaring powersetI1:Prop % FOF formula (((eq Prop) powersetI1) (forall (A:fofType) (B:fofType), (((subset B) A)->((in B) (powerset A))))) of role definition named powersetI1 % A new definition: (((eq Prop) powersetI1) (forall (A:fofType) (B:fofType), (((subset B) A)->((in B) (powerset A))))) % Defined: powersetI1:=(forall (A:fofType) (B:fofType), (((subset B) A)->((in B) (powerset A)))) % FOF formula (subsetRefl->(powersetI1->(forall (A:fofType), ((in A) (powerset A))))) of role conjecture named inPowerset % Conjecture to prove = (subsetRefl->(powersetI1->(forall (A:fofType), ((in A) (powerset A))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(subsetRefl->(powersetI1->(forall (A:fofType), ((in A) (powerset A)))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter powerset:(fofType->fofType). % Parameter subset:(fofType->(fofType->Prop)). % Definition subsetRefl:=(forall (A:fofType), ((subset A) A)):Prop. % Definition powersetI1:=(forall (A:fofType) (B:fofType), (((subset B) A)->((in B) (powerset A)))):Prop. % Trying to prove (subsetRefl->(powersetI1->(forall (A:fofType), ((in A) (powerset A))))) % Found x1:=(x A):((subset A) A) % Found (x A) as proof of ((subset A) A) % Found (x A) as proof of ((subset A) A) % Found (x000 (x A)) as proof of ((in A) (powerset A)) % Found ((x00 A) (x A)) as proof of ((in A) (powerset A)) % Found (((x0 A) A) (x A)) as proof of ((in A) (powerset A)) % Found (fun (A:fofType)=> (((x0 A) A) (x A))) as proof of ((in A) (powerset A)) % Found (fun (x0:powersetI1) (A:fofType)=> (((x0 A) A) (x A))) as proof of (forall (A:fofType), ((in A) (powerset A))) % Found (fun (x:subsetRefl) (x0:powersetI1) (A:fofType)=> (((x0 A) A) (x A))) as proof of (powersetI1->(forall (A:fofType), ((in A) (powerset A)))) % Found (fun (x:subsetRefl) (x0:powersetI1) (A:fofType)=> (((x0 A) A) (x A))) as proof of (subsetRefl->(powersetI1->(forall (A:fofType), ((in A) (powerset A))))) % Got proof (fun (x:subsetRefl) (x0:powersetI1) (A:fofType)=> (((x0 A) A) (x A))) % Time elapsed = 0.038745s % node=8 cost=-30.000000 depth=8 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:subsetRefl) (x0:powersetI1) (A:fofType)=> (((x0 A) A) (x A))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------