%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU694^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 : n102.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:50 EDT 2014 % Result : Theorem 0.50s % Output : Proof 0.50s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU694^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n102.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:13:31 CDT 2014 % % CPUTime : 0.50 % 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 0x16b4320>, <kernel.DependentProduct object at 0x1914998>) of role type named in % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x1971c68>, <kernel.DependentProduct object at 0x16b4128>) of role type named func % Using role type % Declaring func:(fofType->(fofType->(fofType->Prop))) % FOF formula (<kernel.Constant object at 0x16b42d8>, <kernel.DependentProduct object at 0x1914998>) of role type named ap % Using role type % Declaring ap:(fofType->(fofType->(fofType->(fofType->fofType)))) % FOF formula (forall (A:fofType) (B:fofType) (Xf:fofType), ((((func A) B) Xf)->(forall (Xx:fofType), (((in Xx) A)->(((eq fofType) ((((ap A) B) Xf) Xx)) ((((ap A) B) Xf) Xx)))))) of role conjecture named ap2apEq2 % Conjecture to prove = (forall (A:fofType) (B:fofType) (Xf:fofType), ((((func A) B) Xf)->(forall (Xx:fofType), (((in Xx) A)->(((eq fofType) ((((ap A) B) Xf) Xx)) ((((ap A) B) Xf) Xx)))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(forall (A:fofType) (B:fofType) (Xf:fofType), ((((func A) B) Xf)->(forall (Xx:fofType), (((in Xx) A)->(((eq fofType) ((((ap A) B) Xf) Xx)) ((((ap A) B) Xf) Xx))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter func:(fofType->(fofType->(fofType->Prop))). % Parameter ap:(fofType->(fofType->(fofType->(fofType->fofType)))). % Trying to prove (forall (A:fofType) (B:fofType) (Xf:fofType), ((((func A) B) Xf)->(forall (Xx:fofType), (((in Xx) A)->(((eq fofType) ((((ap A) B) Xf) Xx)) ((((ap A) B) Xf) Xx)))))) % Found eq_ref00:=(eq_ref0 ((((ap A) B) Xf) Xx)):(((eq fofType) ((((ap A) B) Xf) Xx)) ((((ap A) B) Xf) Xx)) % Found (eq_ref0 ((((ap A) B) Xf) Xx)) as proof of (((eq fofType) ((((ap A) B) Xf) Xx)) ((((ap A) B) Xf) Xx)) % Found ((eq_ref fofType) ((((ap A) B) Xf) Xx)) as proof of (((eq fofType) ((((ap A) B) Xf) Xx)) ((((ap A) B) Xf) Xx)) % Found (fun (x0:((in Xx) A))=> ((eq_ref fofType) ((((ap A) B) Xf) Xx))) as proof of (((eq fofType) ((((ap A) B) Xf) Xx)) ((((ap A) B) Xf) Xx)) % Found (fun (Xx:fofType) (x0:((in Xx) A))=> ((eq_ref fofType) ((((ap A) B) Xf) Xx))) as proof of (((in Xx) A)->(((eq fofType) ((((ap A) B) Xf) Xx)) ((((ap A) B) Xf) Xx))) % Found (fun (x:(((func A) B) Xf)) (Xx:fofType) (x0:((in Xx) A))=> ((eq_ref fofType) ((((ap A) B) Xf) Xx))) as proof of (forall (Xx:fofType), (((in Xx) A)->(((eq fofType) ((((ap A) B) Xf) Xx)) ((((ap A) B) Xf) Xx)))) % Found (fun (Xf:fofType) (x:(((func A) B) Xf)) (Xx:fofType) (x0:((in Xx) A))=> ((eq_ref fofType) ((((ap A) B) Xf) Xx))) as proof of ((((func A) B) Xf)->(forall (Xx:fofType), (((in Xx) A)->(((eq fofType) ((((ap A) B) Xf) Xx)) ((((ap A) B) Xf) Xx))))) % Found (fun (B:fofType) (Xf:fofType) (x:(((func A) B) Xf)) (Xx:fofType) (x0:((in Xx) A))=> ((eq_ref fofType) ((((ap A) B) Xf) Xx))) as proof of (forall (Xf:fofType), ((((func A) B) Xf)->(forall (Xx:fofType), (((in Xx) A)->(((eq fofType) ((((ap A) B) Xf) Xx)) ((((ap A) B) Xf) Xx)))))) % Found (fun (A:fofType) (B:fofType) (Xf:fofType) (x:(((func A) B) Xf)) (Xx:fofType) (x0:((in Xx) A))=> ((eq_ref fofType) ((((ap A) B) Xf) Xx))) as proof of (forall (B:fofType) (Xf:fofType), ((((func A) B) Xf)->(forall (Xx:fofType), (((in Xx) A)->(((eq fofType) ((((ap A) B) Xf) Xx)) ((((ap A) B) Xf) Xx)))))) % Found (fun (A:fofType) (B:fofType) (Xf:fofType) (x:(((func A) B) Xf)) (Xx:fofType) (x0:((in Xx) A))=> ((eq_ref fofType) ((((ap A) B) Xf) Xx))) as proof of (forall (A:fofType) (B:fofType) (Xf:fofType), ((((func A) B) Xf)->(forall (Xx:fofType), (((in Xx) A)->(((eq fofType) ((((ap A) B) Xf) Xx)) ((((ap A) B) Xf) Xx)))))) % Got proof (fun (A:fofType) (B:fofType) (Xf:fofType) (x:(((func A) B) Xf)) (Xx:fofType) (x0:((in Xx) A))=> ((eq_ref fofType) ((((ap A) B) Xf) Xx))) % Time elapsed = 0.183988s % 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) (Xf:fofType) (x:(((func A) B) Xf)) (Xx:fofType) (x0:((in Xx) A))=> ((eq_ref fofType) ((((ap A) B) Xf) Xx))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------