%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEV240^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 : n089.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:55 EDT 2014 % Result : Theorem 0.43s % Output : Proof 0.43s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEV240^5 : TPTP v6.1.0. Released v4.0.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n089.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 08:35:41 CDT 2014 % % CPUTime : 0.43 % 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 0x24a0638>, <kernel.Type object at 0x287bcb0>) of role type named a_type % Using role type % Declaring a:Type % FOF formula (<kernel.Constant object at 0x236ef38>, <kernel.DependentProduct object at 0x287bcf8>) of role type named cA % Using role type % Declaring cA:((a->Prop)->Prop) % FOF formula (forall (Xx:(a->Prop)), ((cA Xx)->(forall (Xx0:a), ((Xx Xx0)->((ex (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0)))))))) of role conjecture named cDOMTHM1_pme % Conjecture to prove = (forall (Xx:(a->Prop)), ((cA Xx)->(forall (Xx0:a), ((Xx Xx0)->((ex (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0)))))))):Prop % Parameter a_DUMMY:a. % We need to prove ['(forall (Xx:(a->Prop)), ((cA Xx)->(forall (Xx0:a), ((Xx Xx0)->((ex (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0))))))))'] % Parameter a:Type. % Parameter cA:((a->Prop)->Prop). % Trying to prove (forall (Xx:(a->Prop)), ((cA Xx)->(forall (Xx0:a), ((Xx Xx0)->((ex (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0)))))))) % Found x:(cA Xx) % Instantiate: x1:=Xx:(a->Prop) % Found x as proof of (cA x1) % Found x0:(Xx Xx0) % Found x0 as proof of (x1 Xx0) % Found ((conj00 x) x0) as proof of ((and (cA x1)) (x1 Xx0)) % Found (((conj0 (x1 Xx0)) x) x0) as proof of ((and (cA x1)) (x1 Xx0)) % Found ((((conj (cA x1)) (x1 Xx0)) x) x0) as proof of ((and (cA x1)) (x1 Xx0)) % Found ((((conj (cA x1)) (x1 Xx0)) x) x0) as proof of ((and (cA x1)) (x1 Xx0)) % Found (ex_intro000 ((((conj (cA x1)) (x1 Xx0)) x) x0)) as proof of ((ex (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0)))) % Found ((ex_intro00 Xx) ((((conj (cA Xx)) (Xx Xx0)) x) x0)) as proof of ((ex (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0)))) % Found (((ex_intro0 (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0)))) Xx) ((((conj (cA Xx)) (Xx Xx0)) x) x0)) as proof of ((ex (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0)))) % Found ((((ex_intro (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0)))) Xx) ((((conj (cA Xx)) (Xx Xx0)) x) x0)) as proof of ((ex (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0)))) % Found (fun (x0:(Xx Xx0))=> ((((ex_intro (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0)))) Xx) ((((conj (cA Xx)) (Xx Xx0)) x) x0))) as proof of ((ex (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0)))) % Found (fun (Xx0:a) (x0:(Xx Xx0))=> ((((ex_intro (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0)))) Xx) ((((conj (cA Xx)) (Xx Xx0)) x) x0))) as proof of ((Xx Xx0)->((ex (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0))))) % Found (fun (x:(cA Xx)) (Xx0:a) (x0:(Xx Xx0))=> ((((ex_intro (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0)))) Xx) ((((conj (cA Xx)) (Xx Xx0)) x) x0))) as proof of (forall (Xx0:a), ((Xx Xx0)->((ex (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0)))))) % Found (fun (Xx:(a->Prop)) (x:(cA Xx)) (Xx0:a) (x0:(Xx Xx0))=> ((((ex_intro (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0)))) Xx) ((((conj (cA Xx)) (Xx Xx0)) x) x0))) as proof of ((cA Xx)->(forall (Xx0:a), ((Xx Xx0)->((ex (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0))))))) % Found (fun (Xx:(a->Prop)) (x:(cA Xx)) (Xx0:a) (x0:(Xx Xx0))=> ((((ex_intro (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0)))) Xx) ((((conj (cA Xx)) (Xx Xx0)) x) x0))) as proof of (forall (Xx:(a->Prop)), ((cA Xx)->(forall (Xx0:a), ((Xx Xx0)->((ex (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0)))))))) % Got proof (fun (Xx:(a->Prop)) (x:(cA Xx)) (Xx0:a) (x0:(Xx Xx0))=> ((((ex_intro (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0)))) Xx) ((((conj (cA Xx)) (Xx Xx0)) x) x0))) % Time elapsed = 0.119322s % node=15 cost=396.000000 depth=13 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (Xx:(a->Prop)) (x:(cA Xx)) (Xx0:a) (x0:(Xx Xx0))=> ((((ex_intro (a->Prop)) (fun (S:(a->Prop))=> ((and (cA S)) (S Xx0)))) Xx) ((((conj (cA Xx)) (Xx Xx0)) x) x0))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------