%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU661^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 : n188.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:44 EDT 2014 % Result : Theorem 0.48s % Output : Proof 0.48s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU661^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n188.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:04:56 CDT 2014 % % CPUTime : 0.48 % 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 0x1da07e8>, <kernel.DependentProduct object at 0x1da0518>) of role type named in % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x1bc1d40>, <kernel.DependentProduct object at 0x1da0518>) of role type named kpair % Using role type % Declaring kpair:(fofType->(fofType->fofType)) % FOF formula (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) ((kpair Xx) Xy)) ((kpair Xx) Xy)))))) of role conjecture named cartprodmempaircEq % Conjecture to prove = (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) ((kpair Xx) Xy)) ((kpair Xx) Xy)))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) ((kpair Xx) Xy)) ((kpair Xx) Xy))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter kpair:(fofType->(fofType->fofType)). % Trying to prove (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) ((kpair Xx) Xy)) ((kpair Xx) Xy)))))) % Found eq_ref00:=(eq_ref0 ((kpair Xx) Xy)):(((eq fofType) ((kpair Xx) Xy)) ((kpair Xx) Xy)) % Found (eq_ref0 ((kpair Xx) Xy)) as proof of (((eq fofType) ((kpair Xx) Xy)) ((kpair Xx) Xy)) % Found ((eq_ref fofType) ((kpair Xx) Xy)) as proof of (((eq fofType) ((kpair Xx) Xy)) ((kpair Xx) Xy)) % Found (fun (x0:((in Xy) B))=> ((eq_ref fofType) ((kpair Xx) Xy))) as proof of (((eq fofType) ((kpair Xx) Xy)) ((kpair Xx) Xy)) % Found (fun (Xy:fofType) (x0:((in Xy) B))=> ((eq_ref fofType) ((kpair Xx) Xy))) as proof of (((in Xy) B)->(((eq fofType) ((kpair Xx) Xy)) ((kpair Xx) Xy))) % Found (fun (x:((in Xx) A)) (Xy:fofType) (x0:((in Xy) B))=> ((eq_ref fofType) ((kpair Xx) Xy))) as proof of (forall (Xy:fofType), (((in Xy) B)->(((eq fofType) ((kpair Xx) Xy)) ((kpair Xx) Xy)))) % Found (fun (Xx:fofType) (x:((in Xx) A)) (Xy:fofType) (x0:((in Xy) B))=> ((eq_ref fofType) ((kpair Xx) Xy))) as proof of (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) ((kpair Xx) Xy)) ((kpair Xx) Xy))))) % Found (fun (B:fofType) (Xx:fofType) (x:((in Xx) A)) (Xy:fofType) (x0:((in Xy) B))=> ((eq_ref fofType) ((kpair Xx) Xy))) as proof of (forall (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) ((kpair Xx) Xy)) ((kpair Xx) Xy)))))) % Found (fun (A:fofType) (B:fofType) (Xx:fofType) (x:((in Xx) A)) (Xy:fofType) (x0:((in Xy) B))=> ((eq_ref fofType) ((kpair Xx) Xy))) as proof of (forall (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) ((kpair Xx) Xy)) ((kpair Xx) Xy)))))) % Found (fun (A:fofType) (B:fofType) (Xx:fofType) (x:((in Xx) A)) (Xy:fofType) (x0:((in Xy) B))=> ((eq_ref fofType) ((kpair Xx) Xy))) as proof of (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(forall (Xy:fofType), (((in Xy) B)->(((eq fofType) ((kpair Xx) Xy)) ((kpair Xx) Xy)))))) % Got proof (fun (A:fofType) (B:fofType) (Xx:fofType) (x:((in Xx) A)) (Xy:fofType) (x0:((in Xy) B))=> ((eq_ref fofType) ((kpair Xx) Xy))) % Time elapsed = 0.160226s % node=13 cost=-151.000000 depth=8 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (A:fofType) (B:fofType) (Xx:fofType) (x:((in Xx) A)) (Xy:fofType) (x0:((in Xy) B))=> ((eq_ref fofType) ((kpair Xx) Xy))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------