%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU535^2 : TPTP v6.1.0. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % Computer : n094.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:24 EDT 2014 % Result : Theorem 0.35s % Output : Proof 0.35s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU535^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n094.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:33:21 CDT 2014 % % CPUTime : 0.35 % 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 0xf59c20>, <kernel.DependentProduct object at 0x11b9f80>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0xf59128>, <kernel.Single object at 0xf59320>) of role type named emptyset_type % Using role type % Declaring emptyset:fofType % FOF formula (<kernel.Constant object at 0xf59680>, <kernel.Sort object at 0x1014d88>) of role type named emptysetE_type % Using role type % Declaring emptysetE:Prop % FOF formula (((eq Prop) emptysetE) (forall (Xx:fofType), (((in Xx) emptyset)->(forall (Xphi:Prop), Xphi)))) of role definition named emptysetE % A new definition: (((eq Prop) emptysetE) (forall (Xx:fofType), (((in Xx) emptyset)->(forall (Xphi:Prop), Xphi)))) % Defined: emptysetE:=(forall (Xx:fofType), (((in Xx) emptyset)->(forall (Xphi:Prop), Xphi))) % FOF formula (emptysetE->(forall (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) emptyset)->(Xphi Xx)))) of role conjecture named vacuousDall % Conjecture to prove = (emptysetE->(forall (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) emptyset)->(Xphi Xx)))):Prop % We need to prove ['(emptysetE->(forall (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) emptyset)->(Xphi Xx))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter emptyset:fofType. % Definition emptysetE:=(forall (Xx:fofType), (((in Xx) emptyset)->(forall (Xphi:Prop), Xphi))):Prop. % Trying to prove (emptysetE->(forall (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) emptyset)->(Xphi Xx)))) % Found x0:((in Xx) emptyset) % Instantiate: Xx0:=Xx:fofType % Found x0 as proof of ((in Xx0) emptyset) % Found (x10 x0) as proof of (Xphi Xx) % Found (x10 x0) as proof of (Xphi Xx) % Found ((fun (x2:((in Xx0) emptyset))=> ((x1 x2) (Xphi Xx))) x0) as proof of (Xphi Xx) % Found ((fun (x2:((in Xx) emptyset))=> (((x Xx) x2) (Xphi Xx))) x0) as proof of (Xphi Xx) % Found (fun (x0:((in Xx) emptyset))=> ((fun (x2:((in Xx) emptyset))=> (((x Xx) x2) (Xphi Xx))) x0)) as proof of (Xphi Xx) % Found (fun (Xx:fofType) (x0:((in Xx) emptyset))=> ((fun (x2:((in Xx) emptyset))=> (((x Xx) x2) (Xphi Xx))) x0)) as proof of (((in Xx) emptyset)->(Xphi Xx)) % Found (fun (Xphi:(fofType->Prop)) (Xx:fofType) (x0:((in Xx) emptyset))=> ((fun (x2:((in Xx) emptyset))=> (((x Xx) x2) (Xphi Xx))) x0)) as proof of (forall (Xx:fofType), (((in Xx) emptyset)->(Xphi Xx))) % Found (fun (x:emptysetE) (Xphi:(fofType->Prop)) (Xx:fofType) (x0:((in Xx) emptyset))=> ((fun (x2:((in Xx) emptyset))=> (((x Xx) x2) (Xphi Xx))) x0)) as proof of (forall (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) emptyset)->(Xphi Xx))) % Found (fun (x:emptysetE) (Xphi:(fofType->Prop)) (Xx:fofType) (x0:((in Xx) emptyset))=> ((fun (x2:((in Xx) emptyset))=> (((x Xx) x2) (Xphi Xx))) x0)) as proof of (emptysetE->(forall (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) emptyset)->(Xphi Xx)))) % Got proof (fun (x:emptysetE) (Xphi:(fofType->Prop)) (Xx:fofType) (x0:((in Xx) emptyset))=> ((fun (x2:((in Xx) emptyset))=> (((x Xx) x2) (Xphi Xx))) x0)) % Time elapsed = 0.037829s % node=9 cost=756.000000 depth=9 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:emptysetE) (Xphi:(fofType->Prop)) (Xx:fofType) (x0:((in Xx) emptyset))=> ((fun (x2:((in Xx) emptyset))=> (((x Xx) x2) (Xphi Xx))) x0)) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------