%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU689^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 : n097.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:49 EDT 2014 % Result : Theorem 0.61s % Output : Proof 0.61s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU689^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n097.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:11:51 CDT 2014 % % CPUTime : 0.61 % 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 0x1732368>, <kernel.DependentProduct object at 0x1732518>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x16d5a28>, <kernel.DependentProduct object at 0x1732518>) of role type named subset_type % Using role type % Declaring subset:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x1732488>, <kernel.Sort object at 0x11c04d0>) 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 0x17309e0>, <kernel.DependentProduct object at 0x1732560>) of role type named kpair_type % Using role type % Declaring kpair:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x1732320>, <kernel.DependentProduct object at 0x1732a70>) of role type named cartprod_type % Using role type % Declaring cartprod:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x1732518>, <kernel.DependentProduct object at 0x1732dd0>) of role type named breln_type % Using role type % Declaring breln:(fofType->(fofType->(fofType->Prop))) % FOF formula (((eq (fofType->(fofType->(fofType->Prop)))) breln) (fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B)))) of role definition named breln % A new definition: (((eq (fofType->(fofType->(fofType->Prop)))) breln) (fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B)))) % Defined: breln:=(fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B))) % FOF formula (<kernel.Constant object at 0x1732a70>, <kernel.Sort object at 0x11c04d0>) of role type named brelnall1_type % Using role type % Declaring brelnall1:Prop % FOF formula (((eq Prop) brelnall1) (forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (Xphi:(fofType->Prop)), ((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->(Xphi ((kpair Xx) Xy)))))))->(forall (Xx:fofType), (((in Xx) R)->(Xphi Xx)))))))) of role definition named brelnall1 % A new definition: (((eq Prop) brelnall1) (forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (Xphi:(fofType->Prop)), ((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->(Xphi ((kpair Xx) Xy)))))))->(forall (Xx:fofType), (((in Xx) R)->(Xphi Xx)))))))) % Defined: brelnall1:=(forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (Xphi:(fofType->Prop)), ((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->(Xphi ((kpair Xx) Xy)))))))->(forall (Xx:fofType), (((in Xx) R)->(Xphi Xx))))))) % FOF formula (subsetI1->(brelnall1->(forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (S:fofType), ((((breln A) B) S)->((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S))))))->((subset R) S)))))))) of role conjecture named subbreln % Conjecture to prove = (subsetI1->(brelnall1->(forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (S:fofType), ((((breln A) B) S)->((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S))))))->((subset R) S)))))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(subsetI1->(brelnall1->(forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (S:fofType), ((((breln A) B) S)->((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S))))))->((subset R) S))))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % 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. % Parameter kpair:(fofType->(fofType->fofType)). % Parameter cartprod:(fofType->(fofType->fofType)). % Definition breln:=(fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B))):(fofType->(fofType->(fofType->Prop))). % Definition brelnall1:=(forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (Xphi:(fofType->Prop)), ((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->(Xphi ((kpair Xx) Xy)))))))->(forall (Xx:fofType), (((in Xx) R)->(Xphi Xx))))))):Prop. % Trying to prove (subsetI1->(brelnall1->(forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (S:fofType), ((((breln A) B) S)->((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S))))))->((subset R) S)))))))) % Found x1:(((breln A) B) R) % Instantiate: A0:=A:fofType;B0:=B:fofType % Found x1 as proof of (((breln A0) B0) R) % Found x3:(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S)))))) % Instantiate: A0:=A:fofType;B0:=B:fofType % Found x3 as proof of (forall (Xx:fofType), (((in Xx) A0)->(forall (Xy:fofType), (((in Xy) B0)->(((in ((kpair Xx) Xy)) R)->(Xphi ((kpair Xx) Xy))))))) % Found ((x00000 x1) x3) as proof of (forall (Xx:fofType), (((in Xx) R)->((in Xx) S))) % Found ((x00000 x1) x3) as proof of (forall (Xx:fofType), (((in Xx) R)->((in Xx) S))) % Found (((fun (x5:(((breln A0) B0) R))=> ((x0000 x5) (fun (x9:fofType)=> ((in x9) S)))) x1) x3) as proof of (forall (Xx:fofType), (((in Xx) R)->((in Xx) S))) % Found (((fun (x5:(((breln A0) B) R))=> (((x000 B) x5) (fun (x9:fofType)=> ((in x9) S)))) x1) x3) as proof of (forall (Xx:fofType), (((in Xx) R)->((in Xx) S))) % Found (((fun (x5:(((breln A) B) R))=> ((((x00 A) B) x5) (fun (x9:fofType)=> ((in x9) S)))) x1) x3) as proof of (forall (Xx:fofType), (((in Xx) R)->((in Xx) S))) % Found (((fun (x5:(((breln A) B) R))=> (((((fun (A0:fofType) (B0:fofType)=> (((x0 A0) B0) R)) A) B) x5) (fun (x9:fofType)=> ((in x9) S)))) x1) x3) as proof of (forall (Xx:fofType), (((in Xx) R)->((in Xx) S))) % Found (((fun (x5:(((breln A) B) R))=> (((((fun (A0:fofType) (B0:fofType)=> (((x0 A0) B0) R)) A) B) x5) (fun (x9:fofType)=> ((in x9) S)))) x1) x3) as proof of (forall (Xx:fofType), (((in Xx) R)->((in Xx) S))) % Found (x40 (((fun (x5:(((breln A) B) R))=> (((((fun (A0:fofType) (B0:fofType)=> (((x0 A0) B0) R)) A) B) x5) (fun (x9:fofType)=> ((in x9) S)))) x1) x3)) as proof of ((subset R) S) % Found ((x4 S) (((fun (x5:(((breln A) B) R))=> (((((fun (A0:fofType) (B0:fofType)=> (((x0 A0) B0) R)) A) B) x5) (fun (x9:fofType)=> ((in x9) S)))) x1) x3)) as proof of ((subset R) S) % Found (((x R) S) (((fun (x5:(((breln A) B) R))=> (((((fun (A0:fofType) (B0:fofType)=> (((x0 A0) B0) R)) A) B) x5) (fun (x9:fofType)=> ((in x9) S)))) x1) x3)) as proof of ((subset R) S) % Found (fun (x3:(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S)))))))=> (((x R) S) (((fun (x5:(((breln A) B) R))=> (((((fun (A0:fofType) (B0:fofType)=> (((x0 A0) B0) R)) A) B) x5) (fun (x9:fofType)=> ((in x9) S)))) x1) x3))) as proof of ((subset R) S) % Found (fun (x2:(((breln A) B) S)) (x3:(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S)))))))=> (((x R) S) (((fun (x5:(((breln A) B) R))=> (((((fun (A0:fofType) (B0:fofType)=> (((x0 A0) B0) R)) A) B) x5) (fun (x9:fofType)=> ((in x9) S)))) x1) x3))) as proof of ((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S))))))->((subset R) S)) % Found (fun (S:fofType) (x2:(((breln A) B) S)) (x3:(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S)))))))=> (((x R) S) (((fun (x5:(((breln A) B) R))=> (((((fun (A0:fofType) (B0:fofType)=> (((x0 A0) B0) R)) A) B) x5) (fun (x9:fofType)=> ((in x9) S)))) x1) x3))) as proof of ((((breln A) B) S)->((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S))))))->((subset R) S))) % Found (fun (x1:(((breln A) B) R)) (S:fofType) (x2:(((breln A) B) S)) (x3:(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S)))))))=> (((x R) S) (((fun (x5:(((breln A) B) R))=> (((((fun (A0:fofType) (B0:fofType)=> (((x0 A0) B0) R)) A) B) x5) (fun (x9:fofType)=> ((in x9) S)))) x1) x3))) as proof of (forall (S:fofType), ((((breln A) B) S)->((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S))))))->((subset R) S)))) % Found (fun (R:fofType) (x1:(((breln A) B) R)) (S:fofType) (x2:(((breln A) B) S)) (x3:(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S)))))))=> (((x R) S) (((fun (x5:(((breln A) B) R))=> (((((fun (A0:fofType) (B0:fofType)=> (((x0 A0) B0) R)) A) B) x5) (fun (x9:fofType)=> ((in x9) S)))) x1) x3))) as proof of ((((breln A) B) R)->(forall (S:fofType), ((((breln A) B) S)->((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S))))))->((subset R) S))))) % Found (fun (B:fofType) (R:fofType) (x1:(((breln A) B) R)) (S:fofType) (x2:(((breln A) B) S)) (x3:(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S)))))))=> (((x R) S) (((fun (x5:(((breln A) B) R))=> (((((fun (A0:fofType) (B0:fofType)=> (((x0 A0) B0) R)) A) B) x5) (fun (x9:fofType)=> ((in x9) S)))) x1) x3))) as proof of (forall (R:fofType), ((((breln A) B) R)->(forall (S:fofType), ((((breln A) B) S)->((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S))))))->((subset R) S)))))) % Found (fun (A:fofType) (B:fofType) (R:fofType) (x1:(((breln A) B) R)) (S:fofType) (x2:(((breln A) B) S)) (x3:(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S)))))))=> (((x R) S) (((fun (x5:(((breln A) B) R))=> (((((fun (A0:fofType) (B0:fofType)=> (((x0 A0) B0) R)) A) B) x5) (fun (x9:fofType)=> ((in x9) S)))) x1) x3))) as proof of (forall (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (S:fofType), ((((breln A) B) S)->((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S))))))->((subset R) S)))))) % Found (fun (x0:brelnall1) (A:fofType) (B:fofType) (R:fofType) (x1:(((breln A) B) R)) (S:fofType) (x2:(((breln A) B) S)) (x3:(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S)))))))=> (((x R) S) (((fun (x5:(((breln A) B) R))=> (((((fun (A0:fofType) (B0:fofType)=> (((x0 A0) B0) R)) A) B) x5) (fun (x9:fofType)=> ((in x9) S)))) x1) x3))) as proof of (forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (S:fofType), ((((breln A) B) S)->((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S))))))->((subset R) S)))))) % Found (fun (x:subsetI1) (x0:brelnall1) (A:fofType) (B:fofType) (R:fofType) (x1:(((breln A) B) R)) (S:fofType) (x2:(((breln A) B) S)) (x3:(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S)))))))=> (((x R) S) (((fun (x5:(((breln A) B) R))=> (((((fun (A0:fofType) (B0:fofType)=> (((x0 A0) B0) R)) A) B) x5) (fun (x9:fofType)=> ((in x9) S)))) x1) x3))) as proof of (brelnall1->(forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (S:fofType), ((((breln A) B) S)->((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S))))))->((subset R) S))))))) % Found (fun (x:subsetI1) (x0:brelnall1) (A:fofType) (B:fofType) (R:fofType) (x1:(((breln A) B) R)) (S:fofType) (x2:(((breln A) B) S)) (x3:(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S)))))))=> (((x R) S) (((fun (x5:(((breln A) B) R))=> (((((fun (A0:fofType) (B0:fofType)=> (((x0 A0) B0) R)) A) B) x5) (fun (x9:fofType)=> ((in x9) S)))) x1) x3))) as proof of (subsetI1->(brelnall1->(forall (A:fofType) (B:fofType) (R:fofType), ((((breln A) B) R)->(forall (S:fofType), ((((breln A) B) S)->((forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S))))))->((subset R) S)))))))) % Got proof (fun (x:subsetI1) (x0:brelnall1) (A:fofType) (B:fofType) (R:fofType) (x1:(((breln A) B) R)) (S:fofType) (x2:(((breln A) B) S)) (x3:(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S)))))))=> (((x R) S) (((fun (x5:(((breln A) B) R))=> (((((fun (A0:fofType) (B0:fofType)=> (((x0 A0) B0) R)) A) B) x5) (fun (x9:fofType)=> ((in x9) S)))) x1) x3))) % Time elapsed = 0.271542s % node=38 cost=2151.000000 depth=20 % :::::::::::::::::::::: % % 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:brelnall1) (A:fofType) (B:fofType) (R:fofType) (x1:(((breln A) B) R)) (S:fofType) (x2:(((breln A) B) S)) (x3:(forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((in ((kpair Xx) Xy)) R)->((in ((kpair Xx) Xy)) S)))))))=> (((x R) S) (((fun (x5:(((breln A) B) R))=> (((((fun (A0:fofType) (B0:fofType)=> (((x0 A0) B0) R)) A) B) x5) (fun (x9:fofType)=> ((in x9) S)))) x1) x3))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------