%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEV230^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 : n107.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:54 EDT 2014 % Result : Theorem 0.45s % Output : Proof 0.45s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEV230^5 : TPTP v6.1.0. Released v4.0.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n107.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:33:56 CDT 2014 % % CPUTime : 0.45 % 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 0x1f255f0>, <kernel.Type object at 0x1d42368>) of role type named a_type % Using role type % Declaring a:Type % FOF formula (forall (U:(a->Prop)) (V:(a->Prop)), ((forall (Xx:a), ((U Xx)->(V Xx)))->(forall (Xx:((a->Prop)->Prop)), ((forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(U Xx1)))))->(forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(V Xx1))))))))) of role conjecture named cTHM88_pme % Conjecture to prove = (forall (U:(a->Prop)) (V:(a->Prop)), ((forall (Xx:a), ((U Xx)->(V Xx)))->(forall (Xx:((a->Prop)->Prop)), ((forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(U Xx1)))))->(forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(V Xx1))))))))):Prop % Parameter a_DUMMY:a. % We need to prove ['(forall (U:(a->Prop)) (V:(a->Prop)), ((forall (Xx:a), ((U Xx)->(V Xx)))->(forall (Xx:((a->Prop)->Prop)), ((forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(U Xx1)))))->(forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(V Xx1)))))))))'] % Parameter a:Type. % Trying to prove (forall (U:(a->Prop)) (V:(a->Prop)), ((forall (Xx:a), ((U Xx)->(V Xx)))->(forall (Xx:((a->Prop)->Prop)), ((forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(U Xx1)))))->(forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(V Xx1))))))))) % Found x00000:=(x0000 x2):(U Xx1) % Found (x0000 x2) as proof of (U Xx1) % Found ((x000 x1) x2) as proof of (U Xx1) % Found (((x00 Xx0) x1) x2) as proof of (U Xx1) % Found ((((fun (Xx00:(a->Prop)) (x4:(Xx Xx00))=> (((x0 Xx00) x4) Xx1)) Xx0) x1) x2) as proof of (U Xx1) % Found ((((fun (Xx00:(a->Prop)) (x4:(Xx Xx00))=> (((x0 Xx00) x4) Xx1)) Xx0) x1) x2) as proof of (U Xx1) % Found (x3 ((((fun (Xx00:(a->Prop)) (x4:(Xx Xx00))=> (((x0 Xx00) x4) Xx1)) Xx0) x1) x2)) as proof of (V Xx1) % Found ((x Xx1) ((((fun (Xx00:(a->Prop)) (x4:(Xx Xx00))=> (((x0 Xx00) x4) Xx1)) Xx0) x1) x2)) as proof of (V Xx1) % Found (fun (x2:(Xx0 Xx1))=> ((x Xx1) ((((fun (Xx00:(a->Prop)) (x4:(Xx Xx00))=> (((x0 Xx00) x4) Xx1)) Xx0) x1) x2))) as proof of (V Xx1) % Found (fun (Xx1:a) (x2:(Xx0 Xx1))=> ((x Xx1) ((((fun (Xx00:(a->Prop)) (x4:(Xx Xx00))=> (((x0 Xx00) x4) Xx1)) Xx0) x1) x2))) as proof of ((Xx0 Xx1)->(V Xx1)) % Found (fun (x1:(Xx Xx0)) (Xx1:a) (x2:(Xx0 Xx1))=> ((x Xx1) ((((fun (Xx00:(a->Prop)) (x4:(Xx Xx00))=> (((x0 Xx00) x4) Xx1)) Xx0) x1) x2))) as proof of (forall (Xx1:a), ((Xx0 Xx1)->(V Xx1))) % Found (fun (Xx0:(a->Prop)) (x1:(Xx Xx0)) (Xx1:a) (x2:(Xx0 Xx1))=> ((x Xx1) ((((fun (Xx00:(a->Prop)) (x4:(Xx Xx00))=> (((x0 Xx00) x4) Xx1)) Xx0) x1) x2))) as proof of ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(V Xx1)))) % Found (fun (x0:(forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(U Xx1)))))) (Xx0:(a->Prop)) (x1:(Xx Xx0)) (Xx1:a) (x2:(Xx0 Xx1))=> ((x Xx1) ((((fun (Xx00:(a->Prop)) (x4:(Xx Xx00))=> (((x0 Xx00) x4) Xx1)) Xx0) x1) x2))) as proof of (forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(V Xx1))))) % Found (fun (Xx:((a->Prop)->Prop)) (x0:(forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(U Xx1)))))) (Xx0:(a->Prop)) (x1:(Xx Xx0)) (Xx1:a) (x2:(Xx0 Xx1))=> ((x Xx1) ((((fun (Xx00:(a->Prop)) (x4:(Xx Xx00))=> (((x0 Xx00) x4) Xx1)) Xx0) x1) x2))) as proof of ((forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(U Xx1)))))->(forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(V Xx1)))))) % Found (fun (x:(forall (Xx:a), ((U Xx)->(V Xx)))) (Xx:((a->Prop)->Prop)) (x0:(forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(U Xx1)))))) (Xx0:(a->Prop)) (x1:(Xx Xx0)) (Xx1:a) (x2:(Xx0 Xx1))=> ((x Xx1) ((((fun (Xx00:(a->Prop)) (x4:(Xx Xx00))=> (((x0 Xx00) x4) Xx1)) Xx0) x1) x2))) as proof of (forall (Xx:((a->Prop)->Prop)), ((forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(U Xx1)))))->(forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(V Xx1))))))) % Found (fun (V:(a->Prop)) (x:(forall (Xx:a), ((U Xx)->(V Xx)))) (Xx:((a->Prop)->Prop)) (x0:(forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(U Xx1)))))) (Xx0:(a->Prop)) (x1:(Xx Xx0)) (Xx1:a) (x2:(Xx0 Xx1))=> ((x Xx1) ((((fun (Xx00:(a->Prop)) (x4:(Xx Xx00))=> (((x0 Xx00) x4) Xx1)) Xx0) x1) x2))) as proof of ((forall (Xx:a), ((U Xx)->(V Xx)))->(forall (Xx:((a->Prop)->Prop)), ((forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(U Xx1)))))->(forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(V Xx1)))))))) % Found (fun (U:(a->Prop)) (V:(a->Prop)) (x:(forall (Xx:a), ((U Xx)->(V Xx)))) (Xx:((a->Prop)->Prop)) (x0:(forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(U Xx1)))))) (Xx0:(a->Prop)) (x1:(Xx Xx0)) (Xx1:a) (x2:(Xx0 Xx1))=> ((x Xx1) ((((fun (Xx00:(a->Prop)) (x4:(Xx Xx00))=> (((x0 Xx00) x4) Xx1)) Xx0) x1) x2))) as proof of (forall (V:(a->Prop)), ((forall (Xx:a), ((U Xx)->(V Xx)))->(forall (Xx:((a->Prop)->Prop)), ((forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(U Xx1)))))->(forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(V Xx1))))))))) % Found (fun (U:(a->Prop)) (V:(a->Prop)) (x:(forall (Xx:a), ((U Xx)->(V Xx)))) (Xx:((a->Prop)->Prop)) (x0:(forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(U Xx1)))))) (Xx0:(a->Prop)) (x1:(Xx Xx0)) (Xx1:a) (x2:(Xx0 Xx1))=> ((x Xx1) ((((fun (Xx00:(a->Prop)) (x4:(Xx Xx00))=> (((x0 Xx00) x4) Xx1)) Xx0) x1) x2))) as proof of (forall (U:(a->Prop)) (V:(a->Prop)), ((forall (Xx:a), ((U Xx)->(V Xx)))->(forall (Xx:((a->Prop)->Prop)), ((forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(U Xx1)))))->(forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(V Xx1))))))))) % Got proof (fun (U:(a->Prop)) (V:(a->Prop)) (x:(forall (Xx:a), ((U Xx)->(V Xx)))) (Xx:((a->Prop)->Prop)) (x0:(forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(U Xx1)))))) (Xx0:(a->Prop)) (x1:(Xx Xx0)) (Xx1:a) (x2:(Xx0 Xx1))=> ((x Xx1) ((((fun (Xx00:(a->Prop)) (x4:(Xx Xx00))=> (((x0 Xx00) x4) Xx1)) Xx0) x1) x2))) % Time elapsed = 0.145083s % node=27 cost=489.000000 depth=16 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (U:(a->Prop)) (V:(a->Prop)) (x:(forall (Xx:a), ((U Xx)->(V Xx)))) (Xx:((a->Prop)->Prop)) (x0:(forall (Xx0:(a->Prop)), ((Xx Xx0)->(forall (Xx1:a), ((Xx0 Xx1)->(U Xx1)))))) (Xx0:(a->Prop)) (x1:(Xx Xx0)) (Xx1:a) (x2:(Xx0 Xx1))=> ((x Xx1) ((((fun (Xx00:(a->Prop)) (x4:(Xx Xx00))=> (((x0 Xx00) x4) Xx1)) Xx0) x1) x2))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------