%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU635^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 : n100.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:40 EDT 2014 % Result : Theorem 0.43s % Output : Proof 0.43s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU635^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n100.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:58:41 CDT 2014 % % CPUTime : 0.43 % 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 0x8129e0>, <kernel.DependentProduct object at 0x9f3b48>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x9d5518>, <kernel.Single object at 0x812d88>) of role type named emptyset_type % Using role type % Declaring emptyset:fofType % FOF formula (<kernel.Constant object at 0x8128c0>, <kernel.DependentProduct object at 0x9f3b90>) of role type named setadjoin_type % Using role type % Declaring setadjoin:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x812e18>, <kernel.DependentProduct object at 0x9f3a28>) of role type named setunion_type % Using role type % Declaring setunion:(fofType->fofType) % FOF formula (<kernel.Constant object at 0x812d88>, <kernel.Sort object at 0x6dca28>) of role type named setadjoinIL_type % Using role type % Declaring setadjoinIL:Prop % FOF formula (((eq Prop) setadjoinIL) (forall (Xx:fofType) (Xy:fofType), ((in Xx) ((setadjoin Xx) Xy)))) of role definition named setadjoinIL % A new definition: (((eq Prop) setadjoinIL) (forall (Xx:fofType) (Xy:fofType), ((in Xx) ((setadjoin Xx) Xy)))) % Defined: setadjoinIL:=(forall (Xx:fofType) (Xy:fofType), ((in Xx) ((setadjoin Xx) Xy))) % FOF formula (<kernel.Constant object at 0x812d88>, <kernel.Sort object at 0x6dca28>) 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 (<kernel.Constant object at 0x8128c0>, <kernel.DependentProduct object at 0x9f37a0>) of role type named subset_type % Using role type % Declaring subset:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x9f3950>, <kernel.Sort object at 0x6dca28>) of role type named subsetI2_type % Using role type % Declaring subsetI2:Prop % FOF formula (((eq Prop) subsetI2) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B)))) of role definition named subsetI2 % A new definition: (((eq Prop) subsetI2) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B)))) % Defined: subsetI2:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B))) % FOF formula (setadjoinIL->(setunionI->(subsetI2->(forall (A:fofType), ((subset A) (setunion ((setadjoin A) emptyset))))))) of role conjecture named setunionsingleton2 % Conjecture to prove = (setadjoinIL->(setunionI->(subsetI2->(forall (A:fofType), ((subset A) (setunion ((setadjoin A) emptyset))))))):Prop % We need to prove ['(setadjoinIL->(setunionI->(subsetI2->(forall (A:fofType), ((subset A) (setunion ((setadjoin A) emptyset)))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter emptyset:fofType. % Parameter setadjoin:(fofType->(fofType->fofType)). % Parameter setunion:(fofType->fofType). % Definition setadjoinIL:=(forall (Xx:fofType) (Xy:fofType), ((in Xx) ((setadjoin Xx) Xy))):Prop. % Definition setunionI:=(forall (A:fofType) (Xx:fofType) (B:fofType), (((in Xx) B)->(((in B) A)->((in Xx) (setunion A))))):Prop. % Parameter subset:(fofType->(fofType->Prop)). % Definition subsetI2:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B))):Prop. % Trying to prove (setadjoinIL->(setunionI->(subsetI2->(forall (A:fofType), ((subset A) (setunion ((setadjoin A) emptyset))))))) % Found x30:=(x3 emptyset):((in A) ((setadjoin A) emptyset)) % Found (x3 emptyset) as proof of ((in A) ((setadjoin A) emptyset)) % Found ((x A) emptyset) as proof of ((in A) ((setadjoin A) emptyset)) % Found ((x A) emptyset) as proof of ((in A) ((setadjoin A) emptyset)) % Found (x00000 ((x A) emptyset)) as proof of ((in Xx) (setunion ((setadjoin A) emptyset))) % Found ((x0000 x2) ((x A) emptyset)) as proof of ((in Xx) (setunion ((setadjoin A) emptyset))) % Found (((x000 A) x2) ((x A) emptyset)) as proof of ((in Xx) (setunion ((setadjoin A) emptyset))) % Found ((((x00 Xx) A) x2) ((x A) emptyset)) as proof of ((in Xx) (setunion ((setadjoin A) emptyset))) % Found (((((x0 ((setadjoin A) emptyset)) Xx) A) x2) ((x A) emptyset)) as proof of ((in Xx) (setunion ((setadjoin A) emptyset))) % Found (fun (x2:((in Xx) A))=> (((((x0 ((setadjoin A) emptyset)) Xx) A) x2) ((x A) emptyset))) as proof of ((in Xx) (setunion ((setadjoin A) emptyset))) % Found (fun (Xx:fofType) (x2:((in Xx) A))=> (((((x0 ((setadjoin A) emptyset)) Xx) A) x2) ((x A) emptyset))) as proof of (((in Xx) A)->((in Xx) (setunion ((setadjoin A) emptyset)))) % Found (fun (Xx:fofType) (x2:((in Xx) A))=> (((((x0 ((setadjoin A) emptyset)) Xx) A) x2) ((x A) emptyset))) as proof of (forall (Xx:fofType), (((in Xx) A)->((in Xx) (setunion ((setadjoin A) emptyset))))) % Found (x100 (fun (Xx:fofType) (x2:((in Xx) A))=> (((((x0 ((setadjoin A) emptyset)) Xx) A) x2) ((x A) emptyset)))) as proof of ((subset A) (setunion ((setadjoin A) emptyset))) % Found ((x10 (setunion ((setadjoin A) emptyset))) (fun (Xx:fofType) (x2:((in Xx) A))=> (((((x0 ((setadjoin A) emptyset)) Xx) A) x2) ((x A) emptyset)))) as proof of ((subset A) (setunion ((setadjoin A) emptyset))) % Found (((x1 A) (setunion ((setadjoin A) emptyset))) (fun (Xx:fofType) (x2:((in Xx) A))=> (((((x0 ((setadjoin A) emptyset)) Xx) A) x2) ((x A) emptyset)))) as proof of ((subset A) (setunion ((setadjoin A) emptyset))) % Found (fun (A:fofType)=> (((x1 A) (setunion ((setadjoin A) emptyset))) (fun (Xx:fofType) (x2:((in Xx) A))=> (((((x0 ((setadjoin A) emptyset)) Xx) A) x2) ((x A) emptyset))))) as proof of ((subset A) (setunion ((setadjoin A) emptyset))) % Found (fun (x1:subsetI2) (A:fofType)=> (((x1 A) (setunion ((setadjoin A) emptyset))) (fun (Xx:fofType) (x2:((in Xx) A))=> (((((x0 ((setadjoin A) emptyset)) Xx) A) x2) ((x A) emptyset))))) as proof of (forall (A:fofType), ((subset A) (setunion ((setadjoin A) emptyset)))) % Found (fun (x0:setunionI) (x1:subsetI2) (A:fofType)=> (((x1 A) (setunion ((setadjoin A) emptyset))) (fun (Xx:fofType) (x2:((in Xx) A))=> (((((x0 ((setadjoin A) emptyset)) Xx) A) x2) ((x A) emptyset))))) as proof of (subsetI2->(forall (A:fofType), ((subset A) (setunion ((setadjoin A) emptyset))))) % Found (fun (x:setadjoinIL) (x0:setunionI) (x1:subsetI2) (A:fofType)=> (((x1 A) (setunion ((setadjoin A) emptyset))) (fun (Xx:fofType) (x2:((in Xx) A))=> (((((x0 ((setadjoin A) emptyset)) Xx) A) x2) ((x A) emptyset))))) as proof of (setunionI->(subsetI2->(forall (A:fofType), ((subset A) (setunion ((setadjoin A) emptyset)))))) % Found (fun (x:setadjoinIL) (x0:setunionI) (x1:subsetI2) (A:fofType)=> (((x1 A) (setunion ((setadjoin A) emptyset))) (fun (Xx:fofType) (x2:((in Xx) A))=> (((((x0 ((setadjoin A) emptyset)) Xx) A) x2) ((x A) emptyset))))) as proof of (setadjoinIL->(setunionI->(subsetI2->(forall (A:fofType), ((subset A) (setunion ((setadjoin A) emptyset))))))) % Got proof (fun (x:setadjoinIL) (x0:setunionI) (x1:subsetI2) (A:fofType)=> (((x1 A) (setunion ((setadjoin A) emptyset))) (fun (Xx:fofType) (x2:((in Xx) A))=> (((((x0 ((setadjoin A) emptyset)) Xx) A) x2) ((x A) emptyset))))) % Time elapsed = 0.101221s % node=21 cost=306.000000 depth=18 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:setadjoinIL) (x0:setunionI) (x1:subsetI2) (A:fofType)=> (((x1 A) (setunion ((setadjoin A) emptyset))) (fun (Xx:fofType) (x2:((in Xx) A))=> (((((x0 ((setadjoin A) emptyset)) Xx) A) x2) ((x A) emptyset))))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------