%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : LCL728^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 : n179.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:10 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 : LCL728^5 : TPTP v6.1.0. Released v4.0.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n179.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:01 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 0xd71680>, <kernel.Type object at 0xd71d40>) of role type named b_type % Using role type % Declaring b:Type % FOF formula (<kernel.Constant object at 0x11a2bd8>, <kernel.Type object at 0xd71b90>) of role type named a_type % Using role type % Declaring a:Type % FOF formula ((forall (Xs:((b->Prop)->Prop)), ((forall (X:(b->Prop)), ((Xs X)->((ex b) (fun (Xy:b)=> (X Xy)))))->((ex ((b->Prop)->b)) (fun (Xf:((b->Prop)->b))=> (forall (X:(b->Prop)), ((Xs X)->(X (Xf X))))))))->(forall (Xr:(a->(b->Prop))), ((ex (a->b)) (fun (Xg:(a->b))=> (forall (Xx:a), (((ex b) (fun (Xy:b)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx)))))))) of role conjecture named cTHM532 % Conjecture to prove = ((forall (Xs:((b->Prop)->Prop)), ((forall (X:(b->Prop)), ((Xs X)->((ex b) (fun (Xy:b)=> (X Xy)))))->((ex ((b->Prop)->b)) (fun (Xf:((b->Prop)->b))=> (forall (X:(b->Prop)), ((Xs X)->(X (Xf X))))))))->(forall (Xr:(a->(b->Prop))), ((ex (a->b)) (fun (Xg:(a->b))=> (forall (Xx:a), (((ex b) (fun (Xy:b)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx)))))))):Prop % Parameter b_DUMMY:b. % Parameter a_DUMMY:a. % We need to prove ['((forall (Xs:((b->Prop)->Prop)), ((forall (X:(b->Prop)), ((Xs X)->((ex b) (fun (Xy:b)=> (X Xy)))))->((ex ((b->Prop)->b)) (fun (Xf:((b->Prop)->b))=> (forall (X:(b->Prop)), ((Xs X)->(X (Xf X))))))))->(forall (Xr:(a->(b->Prop))), ((ex (a->b)) (fun (Xg:(a->b))=> (forall (Xx:a), (((ex b) (fun (Xy:b)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx))))))))'] % Parameter b:Type. % Parameter a:Type. % Trying to prove ((forall (Xs:((b->Prop)->Prop)), ((forall (X:(b->Prop)), ((Xs X)->((ex b) (fun (Xy:b)=> (X Xy)))))->((ex ((b->Prop)->b)) (fun (Xf:((b->Prop)->b))=> (forall (X:(b->Prop)), ((Xs X)->(X (Xf X))))))))->(forall (Xr:(a->(b->Prop))), ((ex (a->b)) (fun (Xg:(a->b))=> (forall (Xx:a), (((ex b) (fun (Xy:b)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx)))))))) % Found b_DUMMY:b % Found b_DUMMY as proof of b % Found (classical_choice000 b_DUMMY) as proof of ((ex (a->b)) (fun (Xg:(a->b))=> (forall (Xx:a), (((ex b) (fun (Xy:b)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx)))))) % Found ((classical_choice00 Xr) b_DUMMY) as proof of ((ex (a->b)) (fun (Xg:(a->b))=> (forall (Xx:a), (((ex b) (fun (Xy:b)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx)))))) % Found (((classical_choice0 b) Xr) b_DUMMY) as proof of ((ex (a->b)) (fun (Xg:(a->b))=> (forall (Xx:a), (((ex b) (fun (Xy:b)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx)))))) % Found ((((classical_choice a) b) Xr) b_DUMMY) as proof of ((ex (a->b)) (fun (Xg:(a->b))=> (forall (Xx:a), (((ex b) (fun (Xy:b)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx)))))) % Found (fun (Xr:(a->(b->Prop)))=> ((((classical_choice a) b) Xr) b_DUMMY)) as proof of ((ex (a->b)) (fun (Xg:(a->b))=> (forall (Xx:a), (((ex b) (fun (Xy:b)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx)))))) % Found (fun (x:(forall (Xs:((b->Prop)->Prop)), ((forall (X:(b->Prop)), ((Xs X)->((ex b) (fun (Xy:b)=> (X Xy)))))->((ex ((b->Prop)->b)) (fun (Xf:((b->Prop)->b))=> (forall (X:(b->Prop)), ((Xs X)->(X (Xf X))))))))) (Xr:(a->(b->Prop)))=> ((((classical_choice a) b) Xr) b_DUMMY)) as proof of (forall (Xr:(a->(b->Prop))), ((ex (a->b)) (fun (Xg:(a->b))=> (forall (Xx:a), (((ex b) (fun (Xy:b)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx))))))) % Found (fun (x:(forall (Xs:((b->Prop)->Prop)), ((forall (X:(b->Prop)), ((Xs X)->((ex b) (fun (Xy:b)=> (X Xy)))))->((ex ((b->Prop)->b)) (fun (Xf:((b->Prop)->b))=> (forall (X:(b->Prop)), ((Xs X)->(X (Xf X))))))))) (Xr:(a->(b->Prop)))=> ((((classical_choice a) b) Xr) b_DUMMY)) as proof of ((forall (Xs:((b->Prop)->Prop)), ((forall (X:(b->Prop)), ((Xs X)->((ex b) (fun (Xy:b)=> (X Xy)))))->((ex ((b->Prop)->b)) (fun (Xf:((b->Prop)->b))=> (forall (X:(b->Prop)), ((Xs X)->(X (Xf X))))))))->(forall (Xr:(a->(b->Prop))), ((ex (a->b)) (fun (Xg:(a->b))=> (forall (Xx:a), (((ex b) (fun (Xy:b)=> ((Xr Xx) Xy)))->((Xr Xx) (Xg Xx)))))))) % Got proof (fun (x:(forall (Xs:((b->Prop)->Prop)), ((forall (X:(b->Prop)), ((Xs X)->((ex b) (fun (Xy:b)=> (X Xy)))))->((ex ((b->Prop)->b)) (fun (Xf:((b->Prop)->b))=> (forall (X:(b->Prop)), ((Xs X)->(X (Xf X))))))))) (Xr:(a->(b->Prop)))=> ((((classical_choice a) b) Xr) b_DUMMY)) % Time elapsed = 0.179768s % node=11 cost=134.000000 depth=7 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:(forall (Xs:((b->Prop)->Prop)), ((forall (X:(b->Prop)), ((Xs X)->((ex b) (fun (Xy:b)=> (X Xy)))))->((ex ((b->Prop)->b)) (fun (Xf:((b->Prop)->b))=> (forall (X:(b->Prop)), ((Xs X)->(X (Xf X))))))))) (Xr:(a->(b->Prop)))=> ((((classical_choice a) b) Xr) b_DUMMY)) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------