%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU936^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 : n098.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:24 EDT 2014 % Result : Theorem 0.72s % Output : Proof 0.72s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU936^5 : TPTP v6.1.0. Released v4.0.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n098.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:43:41 CDT 2014 % % CPUTime : 0.72 % 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 0xc7b710>, <kernel.Type object at 0xc7b950>) of role type named a_type % Using role type % Declaring a:Type % FOF formula (<kernel.Constant object at 0x8a0368>, <kernel.Type object at 0xc7b518>) of role type named b_type % Using role type % Declaring b:Type % FOF formula (<kernel.Constant object at 0xc7b878>, <kernel.Type object at 0xc7bc20>) of role type named c_type % Using role type % Declaring c:Type % FOF formula (forall (F:(a->b)) (G:(b->c)), ((forall (Xx:a) (Xy:a), ((((eq c) (G (F Xx))) (G (F Xy)))->(((eq a) Xx) Xy)))->(forall (Xx:a) (Xy:a), ((((eq b) (F Xx)) (F Xy))->(((eq a) Xx) Xy))))) of role conjecture named cFN_THM_3_pme % Conjecture to prove = (forall (F:(a->b)) (G:(b->c)), ((forall (Xx:a) (Xy:a), ((((eq c) (G (F Xx))) (G (F Xy)))->(((eq a) Xx) Xy)))->(forall (Xx:a) (Xy:a), ((((eq b) (F Xx)) (F Xy))->(((eq a) Xx) Xy))))):Prop % Parameter a_DUMMY:a. % Parameter b_DUMMY:b. % Parameter c_DUMMY:c. % We need to prove ['(forall (F:(a->b)) (G:(b->c)), ((forall (Xx:a) (Xy:a), ((((eq c) (G (F Xx))) (G (F Xy)))->(((eq a) Xx) Xy)))->(forall (Xx:a) (Xy:a), ((((eq b) (F Xx)) (F Xy))->(((eq a) Xx) Xy)))))'] % Parameter a:Type. % Parameter b:Type. % Parameter c:Type. % Trying to prove (forall (F:(a->b)) (G:(b->c)), ((forall (Xx:a) (Xy:a), ((((eq c) (G (F Xx))) (G (F Xy)))->(((eq a) Xx) Xy)))->(forall (Xx:a) (Xy:a), ((((eq b) (F Xx)) (F Xy))->(((eq a) Xx) Xy))))) % Found x00:=(x0 (fun (x2:b)=> (P (G x2)))):((P (G (F Xx)))->(P (G (F Xy)))) % Found (x0 (fun (x2:b)=> (P (G x2)))) as proof of ((P (G (F Xx)))->(P (G (F Xy)))) % Found (fun (P:(c->Prop))=> (x0 (fun (x2:b)=> (P (G x2))))) as proof of ((P (G (F Xx)))->(P (G (F Xy)))) % Found (fun (P:(c->Prop))=> (x0 (fun (x2:b)=> (P (G x2))))) as proof of (((eq c) (G (F Xx))) (G (F Xy))) % Found (x10 (fun (P:(c->Prop))=> (x0 (fun (x2:b)=> (P (G x2)))))) as proof of (((eq a) Xx) Xy) % Found ((x1 Xy) (fun (P:(c->Prop))=> (x0 (fun (x2:b)=> (P (G x2)))))) as proof of (((eq a) Xx) Xy) % Found (((x Xx) Xy) (fun (P:(c->Prop))=> (x0 (fun (x2:b)=> (P (G x2)))))) as proof of (((eq a) Xx) Xy) % Found (fun (x0:(((eq b) (F Xx)) (F Xy)))=> (((x Xx) Xy) (fun (P:(c->Prop))=> (x0 (fun (x2:b)=> (P (G x2))))))) as proof of (((eq a) Xx) Xy) % Found (fun (Xy:a) (x0:(((eq b) (F Xx)) (F Xy)))=> (((x Xx) Xy) (fun (P:(c->Prop))=> (x0 (fun (x2:b)=> (P (G x2))))))) as proof of ((((eq b) (F Xx)) (F Xy))->(((eq a) Xx) Xy)) % Found (fun (Xx:a) (Xy:a) (x0:(((eq b) (F Xx)) (F Xy)))=> (((x Xx) Xy) (fun (P:(c->Prop))=> (x0 (fun (x2:b)=> (P (G x2))))))) as proof of (forall (Xy:a), ((((eq b) (F Xx)) (F Xy))->(((eq a) Xx) Xy))) % Found (fun (x:(forall (Xx:a) (Xy:a), ((((eq c) (G (F Xx))) (G (F Xy)))->(((eq a) Xx) Xy)))) (Xx:a) (Xy:a) (x0:(((eq b) (F Xx)) (F Xy)))=> (((x Xx) Xy) (fun (P:(c->Prop))=> (x0 (fun (x2:b)=> (P (G x2))))))) as proof of (forall (Xx:a) (Xy:a), ((((eq b) (F Xx)) (F Xy))->(((eq a) Xx) Xy))) % Found (fun (G:(b->c)) (x:(forall (Xx:a) (Xy:a), ((((eq c) (G (F Xx))) (G (F Xy)))->(((eq a) Xx) Xy)))) (Xx:a) (Xy:a) (x0:(((eq b) (F Xx)) (F Xy)))=> (((x Xx) Xy) (fun (P:(c->Prop))=> (x0 (fun (x2:b)=> (P (G x2))))))) as proof of ((forall (Xx:a) (Xy:a), ((((eq c) (G (F Xx))) (G (F Xy)))->(((eq a) Xx) Xy)))->(forall (Xx:a) (Xy:a), ((((eq b) (F Xx)) (F Xy))->(((eq a) Xx) Xy)))) % Found (fun (F:(a->b)) (G:(b->c)) (x:(forall (Xx:a) (Xy:a), ((((eq c) (G (F Xx))) (G (F Xy)))->(((eq a) Xx) Xy)))) (Xx:a) (Xy:a) (x0:(((eq b) (F Xx)) (F Xy)))=> (((x Xx) Xy) (fun (P:(c->Prop))=> (x0 (fun (x2:b)=> (P (G x2))))))) as proof of (forall (G:(b->c)), ((forall (Xx:a) (Xy:a), ((((eq c) (G (F Xx))) (G (F Xy)))->(((eq a) Xx) Xy)))->(forall (Xx:a) (Xy:a), ((((eq b) (F Xx)) (F Xy))->(((eq a) Xx) Xy))))) % Found (fun (F:(a->b)) (G:(b->c)) (x:(forall (Xx:a) (Xy:a), ((((eq c) (G (F Xx))) (G (F Xy)))->(((eq a) Xx) Xy)))) (Xx:a) (Xy:a) (x0:(((eq b) (F Xx)) (F Xy)))=> (((x Xx) Xy) (fun (P:(c->Prop))=> (x0 (fun (x2:b)=> (P (G x2))))))) as proof of (forall (F:(a->b)) (G:(b->c)), ((forall (Xx:a) (Xy:a), ((((eq c) (G (F Xx))) (G (F Xy)))->(((eq a) Xx) Xy)))->(forall (Xx:a) (Xy:a), ((((eq b) (F Xx)) (F Xy))->(((eq a) Xx) Xy))))) % Got proof (fun (F:(a->b)) (G:(b->c)) (x:(forall (Xx:a) (Xy:a), ((((eq c) (G (F Xx))) (G (F Xy)))->(((eq a) Xx) Xy)))) (Xx:a) (Xy:a) (x0:(((eq b) (F Xx)) (F Xy)))=> (((x Xx) Xy) (fun (P:(c->Prop))=> (x0 (fun (x2:b)=> (P (G x2))))))) % Time elapsed = 0.407871s % node=39 cost=32.000000 depth=12 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (F:(a->b)) (G:(b->c)) (x:(forall (Xx:a) (Xy:a), ((((eq c) (G (F Xx))) (G (F Xy)))->(((eq a) Xx) Xy)))) (Xx:a) (Xy:a) (x0:(((eq b) (F Xx)) (F Xy)))=> (((x Xx) Xy) (fun (P:(c->Prop))=> (x0 (fun (x2:b)=> (P (G x2))))))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------