%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU577^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 : n183.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:30 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 : SEU577^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n183.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: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 0x1cd5908>, <kernel.DependentProduct object at 0x1cd55a8>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x210dfc8>, <kernel.DependentProduct object at 0x1cd58c0>) of role type named powerset_type % Using role type % Declaring powerset:(fofType->fofType) % FOF formula (<kernel.Constant object at 0x1cd5f38>, <kernel.Sort object at 0x1f68878>) of role type named powersetE_type % Using role type % Declaring powersetE:Prop % FOF formula (((eq Prop) powersetE) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in B) (powerset A))->(((in Xx) B)->((in Xx) A))))) of role definition named powersetE % A new definition: (((eq Prop) powersetE) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in B) (powerset A))->(((in Xx) B)->((in Xx) A))))) % Defined: powersetE:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in B) (powerset A))->(((in Xx) B)->((in Xx) A)))) % FOF formula (<kernel.Constant object at 0x1cd5878>, <kernel.DependentProduct object at 0x1cd5998>) of role type named subset_type % Using role type % Declaring subset:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x1cd5a28>, <kernel.Sort object at 0x1f68878>) of role type named subsetI1_type % Using role type % Declaring subsetI1:Prop % FOF formula (((eq Prop) subsetI1) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B)))) of role definition named subsetI1 % A new definition: (((eq Prop) subsetI1) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B)))) % Defined: subsetI1:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B))) % FOF formula (powersetE->(subsetI1->(forall (A:fofType) (B:fofType), (((in B) (powerset A))->((subset B) A))))) of role conjecture named powersetE1 % Conjecture to prove = (powersetE->(subsetI1->(forall (A:fofType) (B:fofType), (((in B) (powerset A))->((subset B) A))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(powersetE->(subsetI1->(forall (A:fofType) (B:fofType), (((in B) (powerset A))->((subset B) A)))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter powerset:(fofType->fofType). % Definition powersetE:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in B) (powerset A))->(((in Xx) B)->((in Xx) A)))):Prop. % Parameter subset:(fofType->(fofType->Prop)). % Definition subsetI1:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B))):Prop. % Trying to prove (powersetE->(subsetI1->(forall (A:fofType) (B:fofType), (((in B) (powerset A))->((subset B) A))))) % Found x2000:=(x200 Xx):(((in Xx) B)->((in Xx) A)) % Found (x200 Xx) as proof of (((in Xx) B)->((in Xx) A)) % Found ((fun (Xx0:fofType)=> ((x20 Xx0) x1)) Xx) as proof of (((in Xx) B)->((in Xx) A)) % Found ((fun (Xx0:fofType)=> (((x2 B) Xx0) x1)) Xx) as proof of (((in Xx) B)->((in Xx) A)) % Found ((fun (Xx0:fofType)=> ((((x A) B) Xx0) x1)) Xx) as proof of (((in Xx) B)->((in Xx) A)) % Found (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x A) B) Xx0) x1)) Xx)) as proof of (((in Xx) B)->((in Xx) A)) % Found (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x A) B) Xx0) x1)) Xx)) as proof of (forall (Xx:fofType), (((in Xx) B)->((in Xx) A))) % Found (x000 (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x A) B) Xx0) x1)) Xx))) as proof of ((subset B) A) % Found ((x00 A) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x A) B) Xx0) x1)) Xx))) as proof of ((subset B) A) % Found (((x0 B) A) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x A) B) Xx0) x1)) Xx))) as proof of ((subset B) A) % Found (fun (x1:((in B) (powerset A)))=> (((x0 B) A) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x A) B) Xx0) x1)) Xx)))) as proof of ((subset B) A) % Found (fun (B:fofType) (x1:((in B) (powerset A)))=> (((x0 B) A) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x A) B) Xx0) x1)) Xx)))) as proof of (((in B) (powerset A))->((subset B) A)) % Found (fun (A:fofType) (B:fofType) (x1:((in B) (powerset A)))=> (((x0 B) A) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x A) B) Xx0) x1)) Xx)))) as proof of (forall (B:fofType), (((in B) (powerset A))->((subset B) A))) % Found (fun (x0:subsetI1) (A:fofType) (B:fofType) (x1:((in B) (powerset A)))=> (((x0 B) A) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x A) B) Xx0) x1)) Xx)))) as proof of (forall (A:fofType) (B:fofType), (((in B) (powerset A))->((subset B) A))) % Found (fun (x:powersetE) (x0:subsetI1) (A:fofType) (B:fofType) (x1:((in B) (powerset A)))=> (((x0 B) A) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x A) B) Xx0) x1)) Xx)))) as proof of (subsetI1->(forall (A:fofType) (B:fofType), (((in B) (powerset A))->((subset B) A)))) % Found (fun (x:powersetE) (x0:subsetI1) (A:fofType) (B:fofType) (x1:((in B) (powerset A)))=> (((x0 B) A) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x A) B) Xx0) x1)) Xx)))) as proof of (powersetE->(subsetI1->(forall (A:fofType) (B:fofType), (((in B) (powerset A))->((subset B) A))))) % Got proof (fun (x:powersetE) (x0:subsetI1) (A:fofType) (B:fofType) (x1:((in B) (powerset A)))=> (((x0 B) A) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x A) B) Xx0) x1)) Xx)))) % Time elapsed = 0.093228s % node=20 cost=85.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:powersetE) (x0:subsetI1) (A:fofType) (B:fofType) (x1:((in B) (powerset A)))=> (((x0 B) A) (fun (Xx:fofType)=> ((fun (Xx0:fofType)=> ((((x A) B) Xx0) x1)) Xx)))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------