%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : LCL730^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 : n118.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:26:11 EDT 2014 % Result : Theorem 0.47s % Output : Proof 0.47s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : LCL730^5 : TPTP v6.1.0. Released v4.0.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n118.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 10:44:11 CDT 2014 % % CPUTime : 0.47 % 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 0x1762320>, <kernel.Type object at 0x1a807a0>) of role type named b_type % Using role type % Declaring b:Type % FOF formula ((forall (Xr:((b->Prop)->(b->Prop))), ((forall (Xx:(b->Prop)), ((ex b) (fun (Xy:b)=> ((Xr Xx) Xy))))->((ex ((b->Prop)->b)) (fun (Xf:((b->Prop)->b))=> (forall (Xx:(b->Prop)), ((Xr Xx) (Xf Xx)))))))->((ex ((b->Prop)->b)) (fun (Xj:((b->Prop)->b))=> (forall (Xp:(b->Prop)), (((ex b) (fun (Xz:b)=> (Xp Xz)))->(Xp (Xj Xp))))))) of role conjecture named cX5310 % Conjecture to prove = ((forall (Xr:((b->Prop)->(b->Prop))), ((forall (Xx:(b->Prop)), ((ex b) (fun (Xy:b)=> ((Xr Xx) Xy))))->((ex ((b->Prop)->b)) (fun (Xf:((b->Prop)->b))=> (forall (Xx:(b->Prop)), ((Xr Xx) (Xf Xx)))))))->((ex ((b->Prop)->b)) (fun (Xj:((b->Prop)->b))=> (forall (Xp:(b->Prop)), (((ex b) (fun (Xz:b)=> (Xp Xz)))->(Xp (Xj Xp))))))):Prop % Parameter b_DUMMY:b. % We need to prove ['((forall (Xr:((b->Prop)->(b->Prop))), ((forall (Xx:(b->Prop)), ((ex b) (fun (Xy:b)=> ((Xr Xx) Xy))))->((ex ((b->Prop)->b)) (fun (Xf:((b->Prop)->b))=> (forall (Xx:(b->Prop)), ((Xr Xx) (Xf Xx)))))))->((ex ((b->Prop)->b)) (fun (Xj:((b->Prop)->b))=> (forall (Xp:(b->Prop)), (((ex b) (fun (Xz:b)=> (Xp Xz)))->(Xp (Xj Xp)))))))'] % Parameter b:Type. % Trying to prove ((forall (Xr:((b->Prop)->(b->Prop))), ((forall (Xx:(b->Prop)), ((ex b) (fun (Xy:b)=> ((Xr Xx) Xy))))->((ex ((b->Prop)->b)) (fun (Xf:((b->Prop)->b))=> (forall (Xx:(b->Prop)), ((Xr Xx) (Xf Xx)))))))->((ex ((b->Prop)->b)) (fun (Xj:((b->Prop)->b))=> (forall (Xp:(b->Prop)), (((ex b) (fun (Xz:b)=> (Xp Xz)))->(Xp (Xj Xp))))))) % Found b_DUMMY:b % Found b_DUMMY as proof of b % Found (choice_operator0 b_DUMMY) as proof of ((ex ((b->Prop)->b)) (fun (Xj:((b->Prop)->b))=> (forall (Xp:(b->Prop)), (((ex b) (fun (Xz:b)=> (Xp Xz)))->(Xp (Xj Xp)))))) % Found ((choice_operator b) b_DUMMY) as proof of ((ex ((b->Prop)->b)) (fun (Xj:((b->Prop)->b))=> (forall (Xp:(b->Prop)), (((ex b) (fun (Xz:b)=> (Xp Xz)))->(Xp (Xj Xp)))))) % Found (fun (x:(forall (Xr:((b->Prop)->(b->Prop))), ((forall (Xx:(b->Prop)), ((ex b) (fun (Xy:b)=> ((Xr Xx) Xy))))->((ex ((b->Prop)->b)) (fun (Xf:((b->Prop)->b))=> (forall (Xx:(b->Prop)), ((Xr Xx) (Xf Xx))))))))=> ((choice_operator b) b_DUMMY)) as proof of ((ex ((b->Prop)->b)) (fun (Xj:((b->Prop)->b))=> (forall (Xp:(b->Prop)), (((ex b) (fun (Xz:b)=> (Xp Xz)))->(Xp (Xj Xp)))))) % Found (fun (x:(forall (Xr:((b->Prop)->(b->Prop))), ((forall (Xx:(b->Prop)), ((ex b) (fun (Xy:b)=> ((Xr Xx) Xy))))->((ex ((b->Prop)->b)) (fun (Xf:((b->Prop)->b))=> (forall (Xx:(b->Prop)), ((Xr Xx) (Xf Xx))))))))=> ((choice_operator b) b_DUMMY)) as proof of ((forall (Xr:((b->Prop)->(b->Prop))), ((forall (Xx:(b->Prop)), ((ex b) (fun (Xy:b)=> ((Xr Xx) Xy))))->((ex ((b->Prop)->b)) (fun (Xf:((b->Prop)->b))=> (forall (Xx:(b->Prop)), ((Xr Xx) (Xf Xx)))))))->((ex ((b->Prop)->b)) (fun (Xj:((b->Prop)->b))=> (forall (Xp:(b->Prop)), (((ex b) (fun (Xz:b)=> (Xp Xz)))->(Xp (Xj Xp))))))) % Got proof (fun (x:(forall (Xr:((b->Prop)->(b->Prop))), ((forall (Xx:(b->Prop)), ((ex b) (fun (Xy:b)=> ((Xr Xx) Xy))))->((ex ((b->Prop)->b)) (fun (Xf:((b->Prop)->b))=> (forall (Xx:(b->Prop)), ((Xr Xx) (Xf Xx))))))))=> ((choice_operator b) b_DUMMY)) % Time elapsed = 0.151032s % node=9 cost=91.000000 depth=4 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:(forall (Xr:((b->Prop)->(b->Prop))), ((forall (Xx:(b->Prop)), ((ex b) (fun (Xy:b)=> ((Xr Xx) Xy))))->((ex ((b->Prop)->b)) (fun (Xf:((b->Prop)->b))=> (forall (Xx:(b->Prop)), ((Xr Xx) (Xf Xx))))))))=> ((choice_operator b) b_DUMMY)) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------