%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU622^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 : n184.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:38 EDT 2014 % Result : Theorem 0.39s % Output : Proof 0.39s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU622^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n184.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:55:41 CDT 2014 % % CPUTime : 0.39 % 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 0x295d518>, <kernel.DependentProduct object at 0x295dc68>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x2b9ae18>, <kernel.Single object at 0x295dcb0>) of role type named emptyset_type % Using role type % Declaring emptyset:fofType % FOF formula (<kernel.Constant object at 0x295dc68>, <kernel.DependentProduct object at 0x295c830>) of role type named setadjoin_type % Using role type % Declaring setadjoin:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x295d4d0>, <kernel.DependentProduct object at 0x295cb48>) of role type named powerset_type % Using role type % Declaring powerset:(fofType->fofType) % FOF formula (<kernel.Constant object at 0x295d6c8>, <kernel.DependentProduct object at 0x295cb48>) of role type named subset_type % Using role type % Declaring subset:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x295d050>, <kernel.Sort object at 0x2643d88>) 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 (<kernel.Constant object at 0x295de60>, <kernel.Sort object at 0x2643d88>) of role type named singletonsubset_type % Using role type % Declaring singletonsubset:Prop % FOF formula (((eq Prop) singletonsubset) (forall (A:fofType) (Xx:fofType), (((in Xx) A)->((subset ((setadjoin Xx) emptyset)) A)))) of role definition named singletonsubset % A new definition: (((eq Prop) singletonsubset) (forall (A:fofType) (Xx:fofType), (((in Xx) A)->((subset ((setadjoin Xx) emptyset)) A)))) % Defined: singletonsubset:=(forall (A:fofType) (Xx:fofType), (((in Xx) A)->((subset ((setadjoin Xx) emptyset)) A))) % FOF formula (powersetI1->(singletonsubset->(forall (A:fofType) (Xx:fofType), (((in Xx) A)->((in ((setadjoin Xx) emptyset)) (powerset A)))))) of role conjecture named singletoninpowerset % Conjecture to prove = (powersetI1->(singletonsubset->(forall (A:fofType) (Xx:fofType), (((in Xx) A)->((in ((setadjoin Xx) emptyset)) (powerset A)))))):Prop % We need to prove ['(powersetI1->(singletonsubset->(forall (A:fofType) (Xx:fofType), (((in Xx) A)->((in ((setadjoin Xx) emptyset)) (powerset A))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter emptyset:fofType. % Parameter setadjoin:(fofType->(fofType->fofType)). % Parameter powerset:(fofType->fofType). % Parameter subset:(fofType->(fofType->Prop)). % Definition powersetI1:=(forall (A:fofType) (B:fofType), (((subset B) A)->((in B) (powerset A)))):Prop. % Definition singletonsubset:=(forall (A:fofType) (Xx:fofType), (((in Xx) A)->((subset ((setadjoin Xx) emptyset)) A))):Prop. % Trying to prove (powersetI1->(singletonsubset->(forall (A:fofType) (Xx:fofType), (((in Xx) A)->((in ((setadjoin Xx) emptyset)) (powerset A)))))) % Found x0000:=(x000 x1):((subset ((setadjoin Xx) emptyset)) A) % Found (x000 x1) as proof of ((subset ((setadjoin Xx) emptyset)) A) % Found ((x00 Xx) x1) as proof of ((subset ((setadjoin Xx) emptyset)) A) % Found (((x0 A) Xx) x1) as proof of ((subset ((setadjoin Xx) emptyset)) A) % Found (((x0 A) Xx) x1) as proof of ((subset ((setadjoin Xx) emptyset)) A) % Found (x20 (((x0 A) Xx) x1)) as proof of ((in ((setadjoin Xx) emptyset)) (powerset A)) % Found ((x2 ((setadjoin Xx) emptyset)) (((x0 A) Xx) x1)) as proof of ((in ((setadjoin Xx) emptyset)) (powerset A)) % Found (((x A) ((setadjoin Xx) emptyset)) (((x0 A) Xx) x1)) as proof of ((in ((setadjoin Xx) emptyset)) (powerset A)) % Found (fun (x1:((in Xx) A))=> (((x A) ((setadjoin Xx) emptyset)) (((x0 A) Xx) x1))) as proof of ((in ((setadjoin Xx) emptyset)) (powerset A)) % Found (fun (Xx:fofType) (x1:((in Xx) A))=> (((x A) ((setadjoin Xx) emptyset)) (((x0 A) Xx) x1))) as proof of (((in Xx) A)->((in ((setadjoin Xx) emptyset)) (powerset A))) % Found (fun (A:fofType) (Xx:fofType) (x1:((in Xx) A))=> (((x A) ((setadjoin Xx) emptyset)) (((x0 A) Xx) x1))) as proof of (forall (Xx:fofType), (((in Xx) A)->((in ((setadjoin Xx) emptyset)) (powerset A)))) % Found (fun (x0:singletonsubset) (A:fofType) (Xx:fofType) (x1:((in Xx) A))=> (((x A) ((setadjoin Xx) emptyset)) (((x0 A) Xx) x1))) as proof of (forall (A:fofType) (Xx:fofType), (((in Xx) A)->((in ((setadjoin Xx) emptyset)) (powerset A)))) % Found (fun (x:powersetI1) (x0:singletonsubset) (A:fofType) (Xx:fofType) (x1:((in Xx) A))=> (((x A) ((setadjoin Xx) emptyset)) (((x0 A) Xx) x1))) as proof of (singletonsubset->(forall (A:fofType) (Xx:fofType), (((in Xx) A)->((in ((setadjoin Xx) emptyset)) (powerset A))))) % Found (fun (x:powersetI1) (x0:singletonsubset) (A:fofType) (Xx:fofType) (x1:((in Xx) A))=> (((x A) ((setadjoin Xx) emptyset)) (((x0 A) Xx) x1))) as proof of (powersetI1->(singletonsubset->(forall (A:fofType) (Xx:fofType), (((in Xx) A)->((in ((setadjoin Xx) emptyset)) (powerset A)))))) % Got proof (fun (x:powersetI1) (x0:singletonsubset) (A:fofType) (Xx:fofType) (x1:((in Xx) A))=> (((x A) ((setadjoin Xx) emptyset)) (((x0 A) Xx) x1))) % Time elapsed = 0.075046s % node=12 cost=155.000000 depth=12 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:powersetI1) (x0:singletonsubset) (A:fofType) (Xx:fofType) (x1:((in Xx) A))=> (((x A) ((setadjoin Xx) emptyset)) (((x0 A) Xx) x1))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------