%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU636^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:40 EDT 2014 % Result : Theorem 0.59s % Output : Proof 0.59s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU636^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:58:56 CDT 2014 % % CPUTime : 0.59 % 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 0x1e05bd8>, <kernel.Constant object at 0x1e05d88>) of role type named emptyset_type % Using role type % Declaring emptyset:fofType % FOF formula (<kernel.Constant object at 0x2236c20>, <kernel.DependentProduct object at 0x1e05ea8>) of role type named setadjoin_type % Using role type % Declaring setadjoin:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x1e056c8>, <kernel.DependentProduct object at 0x1e05cf8>) of role type named setunion_type % Using role type % Declaring setunion:(fofType->fofType) % FOF formula (<kernel.Constant object at 0x1e05830>, <kernel.DependentProduct object at 0x1e05878>) of role type named subset_type % Using role type % Declaring subset:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x1e05f80>, <kernel.Sort object at 0x2098878>) of role type named setextsub_type % Using role type % Declaring setextsub:Prop % FOF formula (((eq Prop) setextsub) (forall (A:fofType) (B:fofType), (((subset A) B)->(((subset B) A)->(((eq fofType) A) B))))) of role definition named setextsub % A new definition: (((eq Prop) setextsub) (forall (A:fofType) (B:fofType), (((subset A) B)->(((subset B) A)->(((eq fofType) A) B))))) % Defined: setextsub:=(forall (A:fofType) (B:fofType), (((subset A) B)->(((subset B) A)->(((eq fofType) A) B)))) % FOF formula (<kernel.Constant object at 0x1e05ea8>, <kernel.Sort object at 0x2098878>) of role type named setunionsingleton1_type % Using role type % Declaring setunionsingleton1:Prop % FOF formula (((eq Prop) setunionsingleton1) (forall (A:fofType), ((subset (setunion ((setadjoin A) emptyset))) A))) of role definition named setunionsingleton1 % A new definition: (((eq Prop) setunionsingleton1) (forall (A:fofType), ((subset (setunion ((setadjoin A) emptyset))) A))) % Defined: setunionsingleton1:=(forall (A:fofType), ((subset (setunion ((setadjoin A) emptyset))) A)) % FOF formula (<kernel.Constant object at 0x1e05830>, <kernel.Sort object at 0x2098878>) of role type named setunionsingleton2_type % Using role type % Declaring setunionsingleton2:Prop % FOF formula (((eq Prop) setunionsingleton2) (forall (A:fofType), ((subset A) (setunion ((setadjoin A) emptyset))))) of role definition named setunionsingleton2 % A new definition: (((eq Prop) setunionsingleton2) (forall (A:fofType), ((subset A) (setunion ((setadjoin A) emptyset))))) % Defined: setunionsingleton2:=(forall (A:fofType), ((subset A) (setunion ((setadjoin A) emptyset)))) % FOF formula (setextsub->(setunionsingleton1->(setunionsingleton2->(forall (Xx:fofType), (((eq fofType) (setunion ((setadjoin Xx) emptyset))) Xx))))) of role conjecture named setunionsingleton % Conjecture to prove = (setextsub->(setunionsingleton1->(setunionsingleton2->(forall (Xx:fofType), (((eq fofType) (setunion ((setadjoin Xx) emptyset))) Xx))))):Prop % We need to prove ['(setextsub->(setunionsingleton1->(setunionsingleton2->(forall (Xx:fofType), (((eq fofType) (setunion ((setadjoin Xx) emptyset))) Xx)))))'] % Parameter fofType:Type. % Parameter emptyset:fofType. % Parameter setadjoin:(fofType->(fofType->fofType)). % Parameter setunion:(fofType->fofType). % Parameter subset:(fofType->(fofType->Prop)). % Definition setextsub:=(forall (A:fofType) (B:fofType), (((subset A) B)->(((subset B) A)->(((eq fofType) A) B)))):Prop. % Definition setunionsingleton1:=(forall (A:fofType), ((subset (setunion ((setadjoin A) emptyset))) A)):Prop. % Definition setunionsingleton2:=(forall (A:fofType), ((subset A) (setunion ((setadjoin A) emptyset)))):Prop. % Trying to prove (setextsub->(setunionsingleton1->(setunionsingleton2->(forall (Xx:fofType), (((eq fofType) (setunion ((setadjoin Xx) emptyset))) Xx))))) % Found x00:=(x0 Xx):((subset (setunion ((setadjoin Xx) emptyset))) Xx) % Found (x0 Xx) as proof of ((subset (setunion ((setadjoin Xx) emptyset))) Xx) % Found (x0 Xx) as proof of ((subset (setunion ((setadjoin Xx) emptyset))) Xx) % Found x10:=(x1 Xx):((subset Xx) (setunion ((setadjoin Xx) emptyset))) % Found (x1 Xx) as proof of ((subset Xx) (setunion ((setadjoin Xx) emptyset))) % Found (x1 Xx) as proof of ((subset Xx) (setunion ((setadjoin Xx) emptyset))) % Found ((x20 (x0 Xx)) (x1 Xx)) as proof of (((eq fofType) (setunion ((setadjoin Xx) emptyset))) Xx) % Found (((x2 Xx) (x0 Xx)) (x1 Xx)) as proof of (((eq fofType) (setunion ((setadjoin Xx) emptyset))) Xx) % Found ((((x (setunion ((setadjoin Xx) emptyset))) Xx) (x0 Xx)) (x1 Xx)) as proof of (((eq fofType) (setunion ((setadjoin Xx) emptyset))) Xx) % Found (fun (Xx:fofType)=> ((((x (setunion ((setadjoin Xx) emptyset))) Xx) (x0 Xx)) (x1 Xx))) as proof of (((eq fofType) (setunion ((setadjoin Xx) emptyset))) Xx) % Found (fun (x1:setunionsingleton2) (Xx:fofType)=> ((((x (setunion ((setadjoin Xx) emptyset))) Xx) (x0 Xx)) (x1 Xx))) as proof of (forall (Xx:fofType), (((eq fofType) (setunion ((setadjoin Xx) emptyset))) Xx)) % Found (fun (x0:setunionsingleton1) (x1:setunionsingleton2) (Xx:fofType)=> ((((x (setunion ((setadjoin Xx) emptyset))) Xx) (x0 Xx)) (x1 Xx))) as proof of (setunionsingleton2->(forall (Xx:fofType), (((eq fofType) (setunion ((setadjoin Xx) emptyset))) Xx))) % Found (fun (x:setextsub) (x0:setunionsingleton1) (x1:setunionsingleton2) (Xx:fofType)=> ((((x (setunion ((setadjoin Xx) emptyset))) Xx) (x0 Xx)) (x1 Xx))) as proof of (setunionsingleton1->(setunionsingleton2->(forall (Xx:fofType), (((eq fofType) (setunion ((setadjoin Xx) emptyset))) Xx)))) % Found (fun (x:setextsub) (x0:setunionsingleton1) (x1:setunionsingleton2) (Xx:fofType)=> ((((x (setunion ((setadjoin Xx) emptyset))) Xx) (x0 Xx)) (x1 Xx))) as proof of (setextsub->(setunionsingleton1->(setunionsingleton2->(forall (Xx:fofType), (((eq fofType) (setunion ((setadjoin Xx) emptyset))) Xx))))) % Got proof (fun (x:setextsub) (x0:setunionsingleton1) (x1:setunionsingleton2) (Xx:fofType)=> ((((x (setunion ((setadjoin Xx) emptyset))) Xx) (x0 Xx)) (x1 Xx))) % Time elapsed = 0.271942s % node=37 cost=-14.000000 depth=9 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:setextsub) (x0:setunionsingleton1) (x1:setunionsingleton2) (Xx:fofType)=> ((((x (setunion ((setadjoin Xx) emptyset))) Xx) (x0 Xx)) (x1 Xx))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------