%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU587^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 : n116.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:32 EDT 2014 % Result : Theorem 0.38s % Output : Proof 0.38s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU587^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n116.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:48:56 CDT 2014 % % CPUTime : 0.38 % 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 0x271d908>, <kernel.DependentProduct object at 0x271d0e0>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x2360998>, <kernel.DependentProduct object at 0x271d0e0>) of role type named subset_type % Using role type % Declaring subset:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x271d368>, <kernel.Sort object at 0x222b098>) 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 (<kernel.Constant object at 0x271d320>, <kernel.DependentProduct object at 0x271d170>) of role type named binunion_type % Using role type % Declaring binunion:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x271d908>, <kernel.Sort object at 0x222b098>) of role type named binunionIL_type % Using role type % Declaring binunionIL:Prop % FOF formula (((eq Prop) binunionIL) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B))))) of role definition named binunionIL % A new definition: (((eq Prop) binunionIL) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B))))) % Defined: binunionIL:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B)))) % FOF formula (subsetI2->(binunionIL->(forall (A:fofType) (B:fofType), ((subset A) ((binunion A) B))))) of role conjecture named binunionLsub % Conjecture to prove = (subsetI2->(binunionIL->(forall (A:fofType) (B:fofType), ((subset A) ((binunion A) B))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(subsetI2->(binunionIL->(forall (A:fofType) (B:fofType), ((subset A) ((binunion A) B)))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->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. % Parameter binunion:(fofType->(fofType->fofType)). % Definition binunionIL:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B)))):Prop. % Trying to prove (subsetI2->(binunionIL->(forall (A:fofType) (B:fofType), ((subset A) ((binunion A) B))))) % Found x000:=(x00 B):(forall (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B)))) % Found (x00 B) as proof of (forall (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B)))) % Found ((x0 A) B) as proof of (forall (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B)))) % Found ((x0 A) B) as proof of (forall (Xx:fofType), (((in Xx) A)->((in Xx) ((binunion A) B)))) % Found (x10 ((x0 A) B)) as proof of ((subset A) ((binunion A) B)) % Found ((x1 ((binunion A) B)) ((x0 A) B)) as proof of ((subset A) ((binunion A) B)) % Found (((x A) ((binunion A) B)) ((x0 A) B)) as proof of ((subset A) ((binunion A) B)) % Found (fun (B:fofType)=> (((x A) ((binunion A) B)) ((x0 A) B))) as proof of ((subset A) ((binunion A) B)) % Found (fun (A:fofType) (B:fofType)=> (((x A) ((binunion A) B)) ((x0 A) B))) as proof of (forall (B:fofType), ((subset A) ((binunion A) B))) % Found (fun (x0:binunionIL) (A:fofType) (B:fofType)=> (((x A) ((binunion A) B)) ((x0 A) B))) as proof of (forall (A:fofType) (B:fofType), ((subset A) ((binunion A) B))) % Found (fun (x:subsetI2) (x0:binunionIL) (A:fofType) (B:fofType)=> (((x A) ((binunion A) B)) ((x0 A) B))) as proof of (binunionIL->(forall (A:fofType) (B:fofType), ((subset A) ((binunion A) B)))) % Found (fun (x:subsetI2) (x0:binunionIL) (A:fofType) (B:fofType)=> (((x A) ((binunion A) B)) ((x0 A) B))) as proof of (subsetI2->(binunionIL->(forall (A:fofType) (B:fofType), ((subset A) ((binunion A) B))))) % Got proof (fun (x:subsetI2) (x0:binunionIL) (A:fofType) (B:fofType)=> (((x A) ((binunion A) B)) ((x0 A) B))) % Time elapsed = 0.056850s % node=11 cost=-108.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:subsetI2) (x0:binunionIL) (A:fofType) (B:fofType)=> (((x A) ((binunion A) B)) ((x0 A) B))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------