%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU813^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 : n184.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:33:12 EDT 2014 % Result : Theorem 0.78s % Output : Proof 0.78s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU813^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n184.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 11:32:36 CDT 2014 % % CPUTime : 0.78 % 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 0x11a18c0>, <kernel.DependentProduct object at 0x15da3b0>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x11a1998>, <kernel.DependentProduct object at 0x15da3b0>) of role type named subset_type % Using role type % Declaring subset:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x11a1e60>, <kernel.DependentProduct object at 0x15daab8>) of role type named binintersect_type % Using role type % Declaring binintersect:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x11a1e60>, <kernel.Sort object at 0x1066fc8>) of role type named binintersectSubset5_type % Using role type % Declaring binintersectSubset5:Prop % FOF formula (((eq Prop) binintersectSubset5) (forall (A:fofType) (B:fofType) (C:fofType), (((subset C) A)->(((subset C) B)->((subset C) ((binintersect A) B)))))) of role definition named binintersectSubset5 % A new definition: (((eq Prop) binintersectSubset5) (forall (A:fofType) (B:fofType) (C:fofType), (((subset C) A)->(((subset C) B)->((subset C) ((binintersect A) B)))))) % Defined: binintersectSubset5:=(forall (A:fofType) (B:fofType) (C:fofType), (((subset C) A)->(((subset C) B)->((subset C) ((binintersect A) B))))) % FOF formula (<kernel.Constant object at 0x15dcef0>, <kernel.Sort object at 0x1066fc8>) of role type named binintersectEL_type % Using role type % Declaring binintersectEL:Prop % FOF formula (((eq Prop) binintersectEL) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binintersect A) B))->((in Xx) A)))) of role definition named binintersectEL % A new definition: (((eq Prop) binintersectEL) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binintersect A) B))->((in Xx) A)))) % Defined: binintersectEL:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binintersect A) B))->((in Xx) A))) % FOF formula (<kernel.Constant object at 0x15dae18>, <kernel.Sort object at 0x1066fc8>) of role type named binintersectER_type % Using role type % Declaring binintersectER:Prop % FOF formula (((eq Prop) binintersectER) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binintersect A) B))->((in Xx) B)))) of role definition named binintersectER % A new definition: (((eq Prop) binintersectER) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binintersect A) B))->((in Xx) B)))) % Defined: binintersectER:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binintersect A) B))->((in Xx) B))) % FOF formula (<kernel.Constant object at 0x157d2d8>, <kernel.DependentProduct object at 0x15da638>) of role type named transitiveset_type % Using role type % Declaring transitiveset:(fofType->Prop) % FOF formula (((eq (fofType->Prop)) transitiveset) (fun (A:fofType)=> (forall (X:fofType), (((in X) A)->((subset X) A))))) of role definition named transitiveset % A new definition: (((eq (fofType->Prop)) transitiveset) (fun (A:fofType)=> (forall (X:fofType), (((in X) A)->((subset X) A))))) % Defined: transitiveset:=(fun (A:fofType)=> (forall (X:fofType), (((in X) A)->((subset X) A)))) % FOF formula (<kernel.Constant object at 0x157d2d8>, <kernel.Sort object at 0x1066fc8>) of role type named transitivesetOp1_type % Using role type % Declaring transitivesetOp1:Prop % FOF formula (((eq Prop) transitivesetOp1) (forall (X:fofType), ((transitiveset X)->(forall (A:fofType), (((in A) X)->((subset A) X)))))) of role definition named transitivesetOp1 % A new definition: (((eq Prop) transitivesetOp1) (forall (X:fofType), ((transitiveset X)->(forall (A:fofType), (((in A) X)->((subset A) X)))))) % Defined: transitivesetOp1:=(forall (X:fofType), ((transitiveset X)->(forall (A:fofType), (((in A) X)->((subset A) X))))) % FOF formula (binintersectSubset5->(binintersectEL->(binintersectER->(transitivesetOp1->(forall (X:fofType), ((transitiveset X)->(forall (Y:fofType), ((transitiveset Y)->(transitiveset ((binintersect X) Y)))))))))) of role conjecture named binintTransitive % Conjecture to prove = (binintersectSubset5->(binintersectEL->(binintersectER->(transitivesetOp1->(forall (X:fofType), ((transitiveset X)->(forall (Y:fofType), ((transitiveset Y)->(transitiveset ((binintersect X) Y)))))))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(binintersectSubset5->(binintersectEL->(binintersectER->(transitivesetOp1->(forall (X:fofType), ((transitiveset X)->(forall (Y:fofType), ((transitiveset Y)->(transitiveset ((binintersect X) Y))))))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter subset:(fofType->(fofType->Prop)). % Parameter binintersect:(fofType->(fofType->fofType)). % Definition binintersectSubset5:=(forall (A:fofType) (B:fofType) (C:fofType), (((subset C) A)->(((subset C) B)->((subset C) ((binintersect A) B))))):Prop. % Definition binintersectEL:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binintersect A) B))->((in Xx) A))):Prop. % Definition binintersectER:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((binintersect A) B))->((in Xx) B))):Prop. % Definition transitiveset:=(fun (A:fofType)=> (forall (X:fofType), (((in X) A)->((subset X) A)))):(fofType->Prop). % Definition transitivesetOp1:=(forall (X:fofType), ((transitiveset X)->(forall (A:fofType), (((in A) X)->((subset A) X))))):Prop. % Trying to prove (binintersectSubset5->(binintersectEL->(binintersectER->(transitivesetOp1->(forall (X:fofType), ((transitiveset X)->(forall (Y:fofType), ((transitiveset Y)->(transitiveset ((binintersect X) Y)))))))))) % Found x3:(transitiveset X) % Found x3 as proof of (transitiveset X) % Found x4:(transitiveset Y) % Found x4 as proof of (transitiveset Y) % Found x00000:=(x0000 x5):((in X0) X) % Found (x0000 x5) as proof of ((in X0) X) % Found ((x000 Y) x5) as proof of ((in X0) X) % Found (((fun (B:fofType)=> ((x00 B) X0)) Y) x5) as proof of ((in X0) X) % Found (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5) as proof of ((in X0) X) % Found (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5) as proof of ((in X0) X) % Found (x30 (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5)) as proof of ((subset X0) X) % Found ((x3 X0) (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5)) as proof of ((subset X0) X) % Found ((x3 X0) (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5)) as proof of ((subset X0) X) % Found x10000:=(x1000 x5):((in X0) Y) % Found (x1000 x5) as proof of ((in X0) Y) % Found ((x100 X) x5) as proof of ((in X0) Y) % Found (((fun (A:fofType)=> ((x10 A) X0)) X) x5) as proof of ((in X0) Y) % Found (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5) as proof of ((in X0) Y) % Found (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5) as proof of ((in X0) Y) % Found (x40 (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5)) as proof of ((subset X0) Y) % Found ((x4 X0) (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5)) as proof of ((subset X0) Y) % Found ((x4 X0) (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5)) as proof of ((subset X0) Y) % Found ((x600 ((x3 X0) (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5))) ((x4 X0) (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5))) as proof of ((subset X0) ((binintersect X) Y)) % Found (((x60 X0) ((x3 X0) (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5))) ((x4 X0) (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5))) as proof of ((subset X0) ((binintersect X) Y)) % Found ((((x6 Y) X0) ((x3 X0) (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5))) ((x4 X0) (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5))) as proof of ((subset X0) ((binintersect X) Y)) % Found (((((x X) Y) X0) ((x3 X0) (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5))) ((x4 X0) (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5))) as proof of ((subset X0) ((binintersect X) Y)) % Found (fun (x5:((in X0) ((binintersect X) Y)))=> (((((x X) Y) X0) ((x3 X0) (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5))) ((x4 X0) (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5)))) as proof of ((subset X0) ((binintersect X) Y)) % Found (fun (X0:fofType) (x5:((in X0) ((binintersect X) Y)))=> (((((x X) Y) X0) ((x3 X0) (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5))) ((x4 X0) (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5)))) as proof of (((in X0) ((binintersect X) Y))->((subset X0) ((binintersect X) Y))) % Found (fun (x4:(transitiveset Y)) (X0:fofType) (x5:((in X0) ((binintersect X) Y)))=> (((((x X) Y) X0) ((x3 X0) (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5))) ((x4 X0) (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5)))) as proof of (transitiveset ((binintersect X) Y)) % Found (fun (Y:fofType) (x4:(transitiveset Y)) (X0:fofType) (x5:((in X0) ((binintersect X) Y)))=> (((((x X) Y) X0) ((x3 X0) (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5))) ((x4 X0) (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5)))) as proof of ((transitiveset Y)->(transitiveset ((binintersect X) Y))) % Found (fun (x3:(transitiveset X)) (Y:fofType) (x4:(transitiveset Y)) (X0:fofType) (x5:((in X0) ((binintersect X) Y)))=> (((((x X) Y) X0) ((x3 X0) (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5))) ((x4 X0) (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5)))) as proof of (forall (Y:fofType), ((transitiveset Y)->(transitiveset ((binintersect X) Y)))) % Found (fun (X:fofType) (x3:(transitiveset X)) (Y:fofType) (x4:(transitiveset Y)) (X0:fofType) (x5:((in X0) ((binintersect X) Y)))=> (((((x X) Y) X0) ((x3 X0) (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5))) ((x4 X0) (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5)))) as proof of ((transitiveset X)->(forall (Y:fofType), ((transitiveset Y)->(transitiveset ((binintersect X) Y))))) % Found (fun (x2:transitivesetOp1) (X:fofType) (x3:(transitiveset X)) (Y:fofType) (x4:(transitiveset Y)) (X0:fofType) (x5:((in X0) ((binintersect X) Y)))=> (((((x X) Y) X0) ((x3 X0) (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5))) ((x4 X0) (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5)))) as proof of (forall (X:fofType), ((transitiveset X)->(forall (Y:fofType), ((transitiveset Y)->(transitiveset ((binintersect X) Y)))))) % Found (fun (x1:binintersectER) (x2:transitivesetOp1) (X:fofType) (x3:(transitiveset X)) (Y:fofType) (x4:(transitiveset Y)) (X0:fofType) (x5:((in X0) ((binintersect X) Y)))=> (((((x X) Y) X0) ((x3 X0) (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5))) ((x4 X0) (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5)))) as proof of (transitivesetOp1->(forall (X:fofType), ((transitiveset X)->(forall (Y:fofType), ((transitiveset Y)->(transitiveset ((binintersect X) Y))))))) % Found (fun (x0:binintersectEL) (x1:binintersectER) (x2:transitivesetOp1) (X:fofType) (x3:(transitiveset X)) (Y:fofType) (x4:(transitiveset Y)) (X0:fofType) (x5:((in X0) ((binintersect X) Y)))=> (((((x X) Y) X0) ((x3 X0) (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5))) ((x4 X0) (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5)))) as proof of (binintersectER->(transitivesetOp1->(forall (X:fofType), ((transitiveset X)->(forall (Y:fofType), ((transitiveset Y)->(transitiveset ((binintersect X) Y)))))))) % Found (fun (x:binintersectSubset5) (x0:binintersectEL) (x1:binintersectER) (x2:transitivesetOp1) (X:fofType) (x3:(transitiveset X)) (Y:fofType) (x4:(transitiveset Y)) (X0:fofType) (x5:((in X0) ((binintersect X) Y)))=> (((((x X) Y) X0) ((x3 X0) (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5))) ((x4 X0) (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5)))) as proof of (binintersectEL->(binintersectER->(transitivesetOp1->(forall (X:fofType), ((transitiveset X)->(forall (Y:fofType), ((transitiveset Y)->(transitiveset ((binintersect X) Y))))))))) % Found (fun (x:binintersectSubset5) (x0:binintersectEL) (x1:binintersectER) (x2:transitivesetOp1) (X:fofType) (x3:(transitiveset X)) (Y:fofType) (x4:(transitiveset Y)) (X0:fofType) (x5:((in X0) ((binintersect X) Y)))=> (((((x X) Y) X0) ((x3 X0) (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5))) ((x4 X0) (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5)))) as proof of (binintersectSubset5->(binintersectEL->(binintersectER->(transitivesetOp1->(forall (X:fofType), ((transitiveset X)->(forall (Y:fofType), ((transitiveset Y)->(transitiveset ((binintersect X) Y)))))))))) % Got proof (fun (x:binintersectSubset5) (x0:binintersectEL) (x1:binintersectER) (x2:transitivesetOp1) (X:fofType) (x3:(transitiveset X)) (Y:fofType) (x4:(transitiveset Y)) (X0:fofType) (x5:((in X0) ((binintersect X) Y)))=> (((((x X) Y) X0) ((x3 X0) (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5))) ((x4 X0) (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5)))) % Time elapsed = 0.448160s % node=99 cost=725.000000 depth=22 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:binintersectSubset5) (x0:binintersectEL) (x1:binintersectER) (x2:transitivesetOp1) (X:fofType) (x3:(transitiveset X)) (Y:fofType) (x4:(transitiveset Y)) (X0:fofType) (x5:((in X0) ((binintersect X) Y)))=> (((((x X) Y) X0) ((x3 X0) (((fun (B:fofType)=> (((x0 X) B) X0)) Y) x5))) ((x4 X0) (((fun (A:fofType)=> (((fun (A:fofType)=> ((x1 A) Y)) A) X0)) X) x5)))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------