%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU548^2 : TPTP v6.1.0. Bugfixed v4.0.0. % Transfm : none % Format : tptp:raw % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % Computer : n188.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:32:26 EDT 2014 % Result : Theorem 0.98s % Output : Proof 0.98s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU548^2 : TPTP v6.1.0. Bugfixed v4.0.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n188.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:38:26 CDT 2014 % % CPUTime : 0.98 % 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 0x22c2e60>, <kernel.DependentProduct object at 0x22c2e18>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x26fcd88>, <kernel.Sort object at 0x218c998>) of role type named inCongP_type % Using role type % Declaring inCongP:Prop % FOF formula (((eq Prop) inCongP) (forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->(((in Xx) A)->((in Xy) B))))))) of role definition named inCongP % A new definition: (((eq Prop) inCongP) (forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->(((in Xx) A)->((in Xy) B))))))) % Defined: inCongP:=(forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->(((in Xx) A)->((in Xy) B)))))) % FOF formula (inCongP->(forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) B))))))) of role conjecture named in__Cong % Conjecture to prove = (inCongP->(forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) B))))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(inCongP->(forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) B)))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Definition inCongP:=(forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->(((in Xx) A)->((in Xy) B)))))):Prop. % Trying to prove (inCongP->(forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) B))))))) % Found iff_refl0:=(iff_refl ((in Xx) A)):((iff ((in Xx) A)) ((in Xx) A)) % Found (iff_refl ((in Xx) A)) as proof of ((iff ((in Xx) A)) ((in Xx) A)) % Found (iff_refl ((in Xx) A)) as proof of ((iff ((in Xx) A)) ((in Xx) A)) % Found (x100 (iff_refl ((in Xx) A))) as proof of ((iff ((in Xx) A)) ((in Xy) A)) % Found ((x10 (fun (x2:fofType)=> ((iff ((in Xx) A)) ((in x2) A)))) (iff_refl ((in Xx) A))) as proof of ((iff ((in Xx) A)) ((in Xy) A)) % Found (fun (x10:(((eq fofType) Xx) Xy))=> ((x10 (fun (x2:fofType)=> ((iff ((in Xx) A)) ((in x2) A)))) (iff_refl ((in Xx) A)))) as proof of ((iff ((in Xx) A)) ((in Xy) A)) % Found (fun (Xy:fofType) (x10:(((eq fofType) Xx) Xy))=> ((x10 (fun (x2:fofType)=> ((iff ((in Xx) A)) ((in x2) A)))) (iff_refl ((in Xx) A)))) as proof of ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) A))) % Found (fun (Xx:fofType) (Xy:fofType) (x10:(((eq fofType) Xx) Xy))=> ((x10 (fun (x2:fofType)=> ((iff ((in Xx) A)) ((in x2) A)))) (iff_refl ((in Xx) A)))) as proof of (forall (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) A)))) % Found (fun (Xx:fofType) (Xy:fofType) (x10:(((eq fofType) Xx) Xy))=> ((x10 (fun (x2:fofType)=> ((iff ((in Xx) A)) ((in x2) A)))) (iff_refl ((in Xx) A)))) as proof of (forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) A)))) % Found (x00 (fun (Xx:fofType) (Xy:fofType) (x10:(((eq fofType) Xx) Xy))=> ((x10 (fun (x2:fofType)=> ((iff ((in Xx) A)) ((in x2) A)))) (iff_refl ((in Xx) A))))) as proof of (forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) B)))) % Found ((x0 (fun (x2:fofType)=> (forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) x2)))))) (fun (Xx:fofType) (Xy:fofType) (x10:(((eq fofType) Xx) Xy))=> ((x10 (fun (x2:fofType)=> ((iff ((in Xx) A)) ((in x2) A)))) (iff_refl ((in Xx) A))))) as proof of (forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) B)))) % Found (fun (x0:(((eq fofType) A) B))=> ((x0 (fun (x2:fofType)=> (forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) x2)))))) (fun (Xx:fofType) (Xy:fofType) (x10:(((eq fofType) Xx) Xy))=> ((x10 (fun (x2:fofType)=> ((iff ((in Xx) A)) ((in x2) A)))) (iff_refl ((in Xx) A)))))) as proof of (forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) B)))) % Found (fun (B:fofType) (x0:(((eq fofType) A) B))=> ((x0 (fun (x2:fofType)=> (forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) x2)))))) (fun (Xx:fofType) (Xy:fofType) (x10:(((eq fofType) Xx) Xy))=> ((x10 (fun (x2:fofType)=> ((iff ((in Xx) A)) ((in x2) A)))) (iff_refl ((in Xx) A)))))) as proof of ((((eq fofType) A) B)->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) B))))) % Found (fun (A:fofType) (B:fofType) (x0:(((eq fofType) A) B))=> ((x0 (fun (x2:fofType)=> (forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) x2)))))) (fun (Xx:fofType) (Xy:fofType) (x10:(((eq fofType) Xx) Xy))=> ((x10 (fun (x2:fofType)=> ((iff ((in Xx) A)) ((in x2) A)))) (iff_refl ((in Xx) A)))))) as proof of (forall (B:fofType), ((((eq fofType) A) B)->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) B)))))) % Found (fun (x:inCongP) (A:fofType) (B:fofType) (x0:(((eq fofType) A) B))=> ((x0 (fun (x2:fofType)=> (forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) x2)))))) (fun (Xx:fofType) (Xy:fofType) (x10:(((eq fofType) Xx) Xy))=> ((x10 (fun (x2:fofType)=> ((iff ((in Xx) A)) ((in x2) A)))) (iff_refl ((in Xx) A)))))) as proof of (forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) B)))))) % Found (fun (x:inCongP) (A:fofType) (B:fofType) (x0:(((eq fofType) A) B))=> ((x0 (fun (x2:fofType)=> (forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) x2)))))) (fun (Xx:fofType) (Xy:fofType) (x10:(((eq fofType) Xx) Xy))=> ((x10 (fun (x2:fofType)=> ((iff ((in Xx) A)) ((in x2) A)))) (iff_refl ((in Xx) A)))))) as proof of (inCongP->(forall (A:fofType) (B:fofType), ((((eq fofType) A) B)->(forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) B))))))) % Got proof (fun (x:inCongP) (A:fofType) (B:fofType) (x0:(((eq fofType) A) B))=> ((x0 (fun (x2:fofType)=> (forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) x2)))))) (fun (Xx:fofType) (Xy:fofType) (x10:(((eq fofType) Xx) Xy))=> ((x10 (fun (x2:fofType)=> ((iff ((in Xx) A)) ((in x2) A)))) (iff_refl ((in Xx) A)))))) % Time elapsed = 0.656937s % node=80 cost=58.000000 depth=14 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:inCongP) (A:fofType) (B:fofType) (x0:(((eq fofType) A) B))=> ((x0 (fun (x2:fofType)=> (forall (Xx:fofType) (Xy:fofType), ((((eq fofType) Xx) Xy)->((iff ((in Xx) A)) ((in Xy) x2)))))) (fun (Xx:fofType) (Xy:fofType) (x10:(((eq fofType) Xx) Xy))=> ((x10 (fun (x2:fofType)=> ((iff ((in Xx) A)) ((in x2) A)))) (iff_refl ((in Xx) A)))))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------