%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU590^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 : n187.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:33 EDT 2014 % Result : Theorem 0.57s % Output : Proof 0.57s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU590^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n187.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:49:31 CDT 2014 % % CPUTime : 0.57 % 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 0xe6abd8>, <kernel.DependentProduct object at 0xe6a950>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x1262ab8>, <kernel.DependentProduct object at 0xe6aa28>) of role type named dsetconstr_type % Using role type % Declaring dsetconstr:(fofType->((fofType->Prop)->fofType)) % FOF formula (<kernel.Constant object at 0xe6a878>, <kernel.DependentProduct object at 0xe6acf8>) of role type named subset_type % Using role type % Declaring subset:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0xe6a6c8>, <kernel.Sort object at 0xd4a368>) of role type named subsetI1_type % Using role type % Declaring subsetI1:Prop % FOF formula (((eq Prop) subsetI1) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B)))) of role definition named subsetI1 % A new definition: (((eq Prop) subsetI1) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B)))) % Defined: subsetI1:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B))) % FOF formula (<kernel.Constant object at 0xe6ab90>, <kernel.Sort object at 0xd4a368>) of role type named subsetE_type % Using role type % Declaring subsetE:Prop % FOF formula (((eq Prop) subsetE) (forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->(((in Xx) A)->((in Xx) B))))) of role definition named subsetE % A new definition: (((eq Prop) subsetE) (forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->(((in Xx) A)->((in Xx) B))))) % Defined: subsetE:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->(((in Xx) A)->((in Xx) B)))) % FOF formula (<kernel.Constant object at 0xe6a878>, <kernel.DependentProduct object at 0xe6a950>) of role type named binintersect_type % Using role type % Declaring binintersect:(fofType->(fofType->fofType)) % FOF formula (((eq (fofType->(fofType->fofType))) binintersect) (fun (A:fofType) (B:fofType)=> ((dsetconstr A) (fun (Xx:fofType)=> ((in Xx) B))))) of role definition named binintersect % A new definition: (((eq (fofType->(fofType->fofType))) binintersect) (fun (A:fofType) (B:fofType)=> ((dsetconstr A) (fun (Xx:fofType)=> ((in Xx) B))))) % Defined: binintersect:=(fun (A:fofType) (B:fofType)=> ((dsetconstr A) (fun (Xx:fofType)=> ((in Xx) B)))) % FOF formula (<kernel.Constant object at 0xe6a950>, <kernel.Sort object at 0xd4a368>) of role type named binintersectI_type % Using role type % Declaring binintersectI:Prop % FOF formula (((eq Prop) binintersectI) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(((in Xx) B)->((in Xx) ((binintersect A) B)))))) of role definition named binintersectI % A new definition: (((eq Prop) binintersectI) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(((in Xx) B)->((in Xx) ((binintersect A) B)))))) % Defined: binintersectI:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(((in Xx) B)->((in Xx) ((binintersect A) B))))) % FOF formula (subsetI1->(subsetE->(binintersectI->(forall (A:fofType) (B:fofType) (C:fofType), (((subset C) A)->(((subset C) B)->((subset C) ((binintersect A) B)))))))) of role conjecture named binintersectSubset5 % Conjecture to prove = (subsetI1->(subsetE->(binintersectI->(forall (A:fofType) (B:fofType) (C:fofType), (((subset C) A)->(((subset C) B)->((subset C) ((binintersect A) B)))))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(subsetI1->(subsetE->(binintersectI->(forall (A:fofType) (B:fofType) (C:fofType), (((subset C) A)->(((subset C) B)->((subset C) ((binintersect A) B))))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter dsetconstr:(fofType->((fofType->Prop)->fofType)). % Parameter subset:(fofType->(fofType->Prop)). % Definition subsetI1:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B))):Prop. % Definition subsetE:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->(((in Xx) A)->((in Xx) B)))):Prop. % Definition binintersect:=(fun (A:fofType) (B:fofType)=> ((dsetconstr A) (fun (Xx:fofType)=> ((in Xx) B)))):(fofType->(fofType->fofType)). % Definition binintersectI:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(((in Xx) B)->((in Xx) ((binintersect A) B))))):Prop. % Trying to prove (subsetI1->(subsetE->(binintersectI->(forall (A:fofType) (B:fofType) (C:fofType), (((subset C) A)->(((subset C) B)->((subset C) ((binintersect A) B)))))))) % Found x000000:=(x00000 x5):((in Xx) B) % Found (x00000 x5) as proof of ((in Xx) B) % Found ((x0000 x3) x5) as proof of ((in Xx) B) % Found (((x000 C) x3) x5) as proof of ((in Xx) B) % Found ((((fun (A0:fofType)=> ((x00 A0) Xx)) C) x3) x5) as proof of ((in Xx) B) % Found ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5) as proof of ((in Xx) B) % Found ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5) as proof of ((in Xx) B) % Found x000000:=(x00000 x5):((in Xx) A) % Found (x00000 x5) as proof of ((in Xx) A) % Found ((x0000 x2) x5) as proof of ((in Xx) A) % Found (((x000 C) x2) x5) as proof of ((in Xx) A) % Found ((((fun (A0:fofType)=> ((x00 A0) Xx)) C) x2) x5) as proof of ((in Xx) A) % Found ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5) as proof of ((in Xx) A) % Found ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5) as proof of ((in Xx) A) % Found ((x1000 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5)) as proof of ((in Xx) ((binintersect A) B)) % Found (((x100 Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5)) as proof of ((in Xx) ((binintersect A) B)) % Found ((((x10 B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5)) as proof of ((in Xx) ((binintersect A) B)) % Found (((((x1 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5)) as proof of ((in Xx) ((binintersect A) B)) % Found (fun (x5:((in Xx) C))=> (((((x1 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5))) as proof of ((in Xx) ((binintersect A) B)) % Found (fun (Xx:fofType) (x5:((in Xx) C))=> (((((x1 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5))) as proof of (((in Xx) C)->((in Xx) ((binintersect A) B))) % Found (fun (Xx:fofType) (x5:((in Xx) C))=> (((((x1 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5))) as proof of (forall (Xx:fofType), (((in Xx) C)->((in Xx) ((binintersect A) B)))) % Found (x40 (fun (Xx:fofType) (x5:((in Xx) C))=> (((((x1 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5)))) as proof of ((subset C) ((binintersect A) B)) % Found ((x4 ((binintersect A) B)) (fun (Xx:fofType) (x5:((in Xx) C))=> (((((x1 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5)))) as proof of ((subset C) ((binintersect A) B)) % Found (((x C) ((binintersect A) B)) (fun (Xx:fofType) (x5:((in Xx) C))=> (((((x1 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5)))) as proof of ((subset C) ((binintersect A) B)) % Found (fun (x3:((subset C) B))=> (((x C) ((binintersect A) B)) (fun (Xx:fofType) (x5:((in Xx) C))=> (((((x1 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5))))) as proof of ((subset C) ((binintersect A) B)) % Found (fun (x2:((subset C) A)) (x3:((subset C) B))=> (((x C) ((binintersect A) B)) (fun (Xx:fofType) (x5:((in Xx) C))=> (((((x1 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5))))) as proof of (((subset C) B)->((subset C) ((binintersect A) B))) % Found (fun (C:fofType) (x2:((subset C) A)) (x3:((subset C) B))=> (((x C) ((binintersect A) B)) (fun (Xx:fofType) (x5:((in Xx) C))=> (((((x1 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5))))) as proof of (((subset C) A)->(((subset C) B)->((subset C) ((binintersect A) B)))) % Found (fun (B:fofType) (C:fofType) (x2:((subset C) A)) (x3:((subset C) B))=> (((x C) ((binintersect A) B)) (fun (Xx:fofType) (x5:((in Xx) C))=> (((((x1 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5))))) as proof of (forall (C:fofType), (((subset C) A)->(((subset C) B)->((subset C) ((binintersect A) B))))) % Found (fun (A:fofType) (B:fofType) (C:fofType) (x2:((subset C) A)) (x3:((subset C) B))=> (((x C) ((binintersect A) B)) (fun (Xx:fofType) (x5:((in Xx) C))=> (((((x1 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5))))) as proof of (forall (B:fofType) (C:fofType), (((subset C) A)->(((subset C) B)->((subset C) ((binintersect A) B))))) % Found (fun (x1:binintersectI) (A:fofType) (B:fofType) (C:fofType) (x2:((subset C) A)) (x3:((subset C) B))=> (((x C) ((binintersect A) B)) (fun (Xx:fofType) (x5:((in Xx) C))=> (((((x1 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5))))) as proof of (forall (A:fofType) (B:fofType) (C:fofType), (((subset C) A)->(((subset C) B)->((subset C) ((binintersect A) B))))) % Found (fun (x0:subsetE) (x1:binintersectI) (A:fofType) (B:fofType) (C:fofType) (x2:((subset C) A)) (x3:((subset C) B))=> (((x C) ((binintersect A) B)) (fun (Xx:fofType) (x5:((in Xx) C))=> (((((x1 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5))))) as proof of (binintersectI->(forall (A:fofType) (B:fofType) (C:fofType), (((subset C) A)->(((subset C) B)->((subset C) ((binintersect A) B)))))) % Found (fun (x:subsetI1) (x0:subsetE) (x1:binintersectI) (A:fofType) (B:fofType) (C:fofType) (x2:((subset C) A)) (x3:((subset C) B))=> (((x C) ((binintersect A) B)) (fun (Xx:fofType) (x5:((in Xx) C))=> (((((x1 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5))))) as proof of (subsetE->(binintersectI->(forall (A:fofType) (B:fofType) (C:fofType), (((subset C) A)->(((subset C) B)->((subset C) ((binintersect A) B))))))) % Found (fun (x:subsetI1) (x0:subsetE) (x1:binintersectI) (A:fofType) (B:fofType) (C:fofType) (x2:((subset C) A)) (x3:((subset C) B))=> (((x C) ((binintersect A) B)) (fun (Xx:fofType) (x5:((in Xx) C))=> (((((x1 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5))))) as proof of (subsetI1->(subsetE->(binintersectI->(forall (A:fofType) (B:fofType) (C:fofType), (((subset C) A)->(((subset C) B)->((subset C) ((binintersect A) B)))))))) % Got proof (fun (x:subsetI1) (x0:subsetE) (x1:binintersectI) (A:fofType) (B:fofType) (C:fofType) (x2:((subset C) A)) (x3:((subset C) B))=> (((x C) ((binintersect A) B)) (fun (Xx:fofType) (x5:((in Xx) C))=> (((((x1 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5))))) % Time elapsed = 0.230744s % node=38 cost=798.000000 depth=24 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:subsetI1) (x0:subsetE) (x1:binintersectI) (A:fofType) (B:fofType) (C:fofType) (x2:((subset C) A)) (x3:((subset C) B))=> (((x C) ((binintersect A) B)) (fun (Xx:fofType) (x5:((in Xx) C))=> (((((x1 A) B) Xx) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) A)) A0) Xx)) C) x2) x5)) ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x0 A0) B)) A0) Xx)) C) x3) x5))))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------