%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU883^5 : TPTP v6.1.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % Computer : n110.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:19 EDT 2014 % Result : Theorem 0.49s % Output : Proof 0.49s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU883^5 : TPTP v6.1.0. Released v4.0.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n110.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:40:31 CDT 2014 % % CPUTime : 0.49 % 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 0x137e5f0>, <kernel.Type object at 0x137e758>) of role type named b_type % Using role type % Declaring b:Type % FOF formula (<kernel.Constant object at 0x137ea70>, <kernel.Type object at 0x1243e18>) of role type named a_type % Using role type % Declaring a:Type % FOF formula (<kernel.Constant object at 0x137e998>, <kernel.DependentProduct object at 0x17b88c0>) of role type named f % Using role type % Declaring f:(b->a) % FOF formula (<kernel.Constant object at 0x1243bd8>, <kernel.DependentProduct object at 0x17b88c0>) of role type named g % Using role type % Declaring g:(b->Prop) % FOF formula (((eq (a->Prop)) (fun (Xz:a)=> ((ex b) (fun (Xx:b)=> ((and (g Xx)) (((eq a) Xz) (f Xx))))))) (fun (Xz:a)=> ((ex b) (fun (Xt:b)=> ((and (g Xt)) (((eq a) Xz) (f Xt))))))) of role conjecture named cX5212_pme % Conjecture to prove = (((eq (a->Prop)) (fun (Xz:a)=> ((ex b) (fun (Xx:b)=> ((and (g Xx)) (((eq a) Xz) (f Xx))))))) (fun (Xz:a)=> ((ex b) (fun (Xt:b)=> ((and (g Xt)) (((eq a) Xz) (f Xt))))))):Prop % Parameter b_DUMMY:b. % Parameter a_DUMMY:a. % We need to prove ['(((eq (a->Prop)) (fun (Xz:a)=> ((ex b) (fun (Xx:b)=> ((and (g Xx)) (((eq a) Xz) (f Xx))))))) (fun (Xz:a)=> ((ex b) (fun (Xt:b)=> ((and (g Xt)) (((eq a) Xz) (f Xt)))))))'] % Parameter b:Type. % Parameter a:Type. % Parameter f:(b->a). % Parameter g:(b->Prop). % Trying to prove (((eq (a->Prop)) (fun (Xz:a)=> ((ex b) (fun (Xx:b)=> ((and (g Xx)) (((eq a) Xz) (f Xx))))))) (fun (Xz:a)=> ((ex b) (fun (Xt:b)=> ((and (g Xt)) (((eq a) Xz) (f Xt))))))) % Found eta_expansion_dep000:=(eta_expansion_dep00 (fun (Xz:a)=> ((ex b) (fun (Xx:b)=> ((and (g Xx)) (((eq a) Xz) (f Xx))))))):(((eq (a->Prop)) (fun (Xz:a)=> ((ex b) (fun (Xx:b)=> ((and (g Xx)) (((eq a) Xz) (f Xx))))))) (fun (x:a)=> ((ex b) (fun (Xx:b)=> ((and (g Xx)) (((eq a) x) (f Xx))))))) % Found (eta_expansion_dep00 (fun (Xz:a)=> ((ex b) (fun (Xx:b)=> ((and (g Xx)) (((eq a) Xz) (f Xx))))))) as proof of (((eq (a->Prop)) (fun (Xz:a)=> ((ex b) (fun (Xx:b)=> ((and (g Xx)) (((eq a) Xz) (f Xx))))))) (fun (Xz:a)=> ((ex b) (fun (Xt:b)=> ((and (g Xt)) (((eq a) Xz) (f Xt))))))) % Found ((eta_expansion_dep0 (fun (x1:a)=> Prop)) (fun (Xz:a)=> ((ex b) (fun (Xx:b)=> ((and (g Xx)) (((eq a) Xz) (f Xx))))))) as proof of (((eq (a->Prop)) (fun (Xz:a)=> ((ex b) (fun (Xx:b)=> ((and (g Xx)) (((eq a) Xz) (f Xx))))))) (fun (Xz:a)=> ((ex b) (fun (Xt:b)=> ((and (g Xt)) (((eq a) Xz) (f Xt))))))) % Found (((eta_expansion_dep a) (fun (x1:a)=> Prop)) (fun (Xz:a)=> ((ex b) (fun (Xx:b)=> ((and (g Xx)) (((eq a) Xz) (f Xx))))))) as proof of (((eq (a->Prop)) (fun (Xz:a)=> ((ex b) (fun (Xx:b)=> ((and (g Xx)) (((eq a) Xz) (f Xx))))))) (fun (Xz:a)=> ((ex b) (fun (Xt:b)=> ((and (g Xt)) (((eq a) Xz) (f Xt))))))) % Found (((eta_expansion_dep a) (fun (x1:a)=> Prop)) (fun (Xz:a)=> ((ex b) (fun (Xx:b)=> ((and (g Xx)) (((eq a) Xz) (f Xx))))))) as proof of (((eq (a->Prop)) (fun (Xz:a)=> ((ex b) (fun (Xx:b)=> ((and (g Xx)) (((eq a) Xz) (f Xx))))))) (fun (Xz:a)=> ((ex b) (fun (Xt:b)=> ((and (g Xt)) (((eq a) Xz) (f Xt))))))) % Got proof (((eta_expansion_dep a) (fun (x1:a)=> Prop)) (fun (Xz:a)=> ((ex b) (fun (Xx:b)=> ((and (g Xx)) (((eq a) Xz) (f Xx))))))) % Time elapsed = 0.169409s % node=11 cost=-282.000000 depth=3 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (((eta_expansion_dep a) (fun (x1:a)=> Prop)) (fun (Xz:a)=> ((ex b) (fun (Xx:b)=> ((and (g Xx)) (((eq a) Xz) (f Xx))))))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------