%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU575^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:30 EDT 2014 % Result : Theorem 0.52s % Output : Proof 0.52s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU575^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:46:51 CDT 2014 % % CPUTime : 0.52 % 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 0x9ffe60>, <kernel.Constant object at 0x9ffe18>) of role type named emptyset_type % Using role type % Declaring emptyset:fofType % FOF formula (<kernel.Constant object at 0x6e3098>, <kernel.DependentProduct object at 0x9ff908>) of role type named subset_type % Using role type % Declaring subset:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x9ffbd8>, <kernel.Sort object at 0x6e6c68>) of role type named emptysetsubset_type % Using role type % Declaring emptysetsubset:Prop % FOF formula (((eq Prop) emptysetsubset) (forall (A:fofType), ((subset emptyset) A))) of role definition named emptysetsubset % A new definition: (((eq Prop) emptysetsubset) (forall (A:fofType), ((subset emptyset) A))) % Defined: emptysetsubset:=(forall (A:fofType), ((subset emptyset) A)) % FOF formula (<kernel.Constant object at 0x9ffd40>, <kernel.Sort object at 0x6e6c68>) 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 (emptysetsubset->(setextsub->(forall (A:fofType), (((subset A) emptyset)->(((eq fofType) A) emptyset))))) of role conjecture named subsetemptysetimpeq % Conjecture to prove = (emptysetsubset->(setextsub->(forall (A:fofType), (((subset A) emptyset)->(((eq fofType) A) emptyset))))):Prop % We need to prove ['(emptysetsubset->(setextsub->(forall (A:fofType), (((subset A) emptyset)->(((eq fofType) A) emptyset)))))'] % Parameter fofType:Type. % Parameter emptyset:fofType. % Parameter subset:(fofType->(fofType->Prop)). % Definition emptysetsubset:=(forall (A:fofType), ((subset emptyset) A)):Prop. % Definition setextsub:=(forall (A:fofType) (B:fofType), (((subset A) B)->(((subset B) A)->(((eq fofType) A) B)))):Prop. % Trying to prove (emptysetsubset->(setextsub->(forall (A:fofType), (((subset A) emptyset)->(((eq fofType) A) emptyset))))) % Found x2:=(x A):((subset emptyset) A) % Found (x A) as proof of ((subset emptyset) A) % Found (x A) as proof of ((subset emptyset) A) % Found (x0000 (x A)) as proof of (((eq fofType) A) emptyset) % Found ((x000 x1) (x A)) as proof of (((eq fofType) A) emptyset) % Found (((x00 emptyset) x1) (x A)) as proof of (((eq fofType) A) emptyset) % Found ((((x0 A) emptyset) x1) (x A)) as proof of (((eq fofType) A) emptyset) % Found (fun (x1:((subset A) emptyset))=> ((((x0 A) emptyset) x1) (x A))) as proof of (((eq fofType) A) emptyset) % Found (fun (A:fofType) (x1:((subset A) emptyset))=> ((((x0 A) emptyset) x1) (x A))) as proof of (((subset A) emptyset)->(((eq fofType) A) emptyset)) % Found (fun (x0:setextsub) (A:fofType) (x1:((subset A) emptyset))=> ((((x0 A) emptyset) x1) (x A))) as proof of (forall (A:fofType), (((subset A) emptyset)->(((eq fofType) A) emptyset))) % Found (fun (x:emptysetsubset) (x0:setextsub) (A:fofType) (x1:((subset A) emptyset))=> ((((x0 A) emptyset) x1) (x A))) as proof of (setextsub->(forall (A:fofType), (((subset A) emptyset)->(((eq fofType) A) emptyset)))) % Found (fun (x:emptysetsubset) (x0:setextsub) (A:fofType) (x1:((subset A) emptyset))=> ((((x0 A) emptyset) x1) (x A))) as proof of (emptysetsubset->(setextsub->(forall (A:fofType), (((subset A) emptyset)->(((eq fofType) A) emptyset))))) % Got proof (fun (x:emptysetsubset) (x0:setextsub) (A:fofType) (x1:((subset A) emptyset))=> ((((x0 A) emptyset) x1) (x A))) % Time elapsed = 0.210084s % node=30 cost=13.000000 depth=10 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:emptysetsubset) (x0:setextsub) (A:fofType) (x1:((subset A) emptyset))=> ((((x0 A) emptyset) x1) (x A))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------