%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU680^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 : n111.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:48 EDT 2014 % Result : Theorem 0.74s % Output : Proof 0.74s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU680^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n111.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 11:09:01 CDT 2014 % % CPUTime : 0.74 % 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 0x11bcbd8>, <kernel.DependentProduct object at 0x11a2d40>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0xf46050>, <kernel.Single object at 0x11bcdd0>) of role type named emptyset_type % Using role type % Declaring emptyset:fofType % FOF formula (<kernel.Constant object at 0x11bcd40>, <kernel.DependentProduct object at 0x11a2ef0>) of role type named setadjoin_type % Using role type % Declaring setadjoin:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x11a29e0>, <kernel.DependentProduct object at 0xf66ab8>) of role type named dsetconstr_type % Using role type % Declaring dsetconstr:(fofType->((fofType->Prop)->fofType)) % FOF formula (<kernel.Constant object at 0x11a29e0>, <kernel.DependentProduct object at 0xf66b00>) of role type named subset_type % Using role type % Declaring subset:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x11bcdd0>, <kernel.DependentProduct object at 0xf66b00>) of role type named kpair_type % Using role type % Declaring kpair:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x11bc7a0>, <kernel.DependentProduct object at 0xf66b00>) of role type named cartprod_type % Using role type % Declaring cartprod:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x11bcdd0>, <kernel.DependentProduct object at 0xf666c8>) of role type named singleton_type % Using role type % Declaring singleton:(fofType->Prop) % FOF formula (((eq (fofType->Prop)) singleton) (fun (A:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (((eq fofType) A) ((setadjoin Xx) emptyset))))))) of role definition named singleton % A new definition: (((eq (fofType->Prop)) singleton) (fun (A:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (((eq fofType) A) ((setadjoin Xx) emptyset))))))) % Defined: singleton:=(fun (A:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (((eq fofType) A) ((setadjoin Xx) emptyset)))))) % FOF formula (<kernel.Constant object at 0x11bcdd0>, <kernel.DependentProduct object at 0xf66c68>) of role type named ex1_type % Using role type % Declaring ex1:(fofType->((fofType->Prop)->Prop)) % FOF formula (((eq (fofType->((fofType->Prop)->Prop))) ex1) (fun (A:fofType) (Xphi:(fofType->Prop))=> (singleton ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))))) of role definition named ex1 % A new definition: (((eq (fofType->((fofType->Prop)->Prop))) ex1) (fun (A:fofType) (Xphi:(fofType->Prop))=> (singleton ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx)))))) % Defined: ex1:=(fun (A:fofType) (Xphi:(fofType->Prop))=> (singleton ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx))))) % FOF formula (<kernel.Constant object at 0x11bcdd0>, <kernel.DependentProduct object at 0xf66098>) of role type named breln_type % Using role type % Declaring breln:(fofType->(fofType->(fofType->Prop))) % FOF formula (((eq (fofType->(fofType->(fofType->Prop)))) breln) (fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B)))) of role definition named breln % A new definition: (((eq (fofType->(fofType->(fofType->Prop)))) breln) (fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B)))) % Defined: breln:=(fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B))) % FOF formula (<kernel.Constant object at 0xf66098>, <kernel.DependentProduct object at 0xf66518>) of role type named dpsetconstr_type % Using role type % Declaring dpsetconstr:(fofType->(fofType->((fofType->(fofType->Prop))->fofType))) % FOF formula (<kernel.Constant object at 0xf66320>, <kernel.DependentProduct object at 0xf66368>) of role type named func_type % Using role type % Declaring func:(fofType->(fofType->(fofType->Prop))) % FOF formula (((eq (fofType->(fofType->(fofType->Prop)))) func) (fun (A:fofType) (B:fofType) (R:fofType)=> ((and (((breln A) B) R)) (forall (Xx:fofType), (((in Xx) A)->((ex1 B) (fun (Xy:fofType)=> ((in ((kpair Xx) Xy)) R)))))))) of role definition named func % A new definition: (((eq (fofType->(fofType->(fofType->Prop)))) func) (fun (A:fofType) (B:fofType) (R:fofType)=> ((and (((breln A) B) R)) (forall (Xx:fofType), (((in Xx) A)->((ex1 B) (fun (Xy:fofType)=> ((in ((kpair Xx) Xy)) R)))))))) % Defined: func:=(fun (A:fofType) (B:fofType) (R:fofType)=> ((and (((breln A) B) R)) (forall (Xx:fofType), (((in Xx) A)->((ex1 B) (fun (Xy:fofType)=> ((in ((kpair Xx) Xy)) R))))))) % FOF formula (<kernel.Constant object at 0x11bb3f8>, <kernel.DependentProduct object at 0xf66320>) of role type named funcSet_type % Using role type % Declaring funcSet:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x11bb3f8>, <kernel.Sort object at 0xc4d248>) of role type named funcinfuncset_type % Using role type % Declaring funcinfuncset:Prop % FOF formula (((eq Prop) funcinfuncset) (forall (A:fofType) (B:fofType) (Xf:fofType), ((((func A) B) Xf)->((in Xf) ((funcSet A) B))))) of role definition named funcinfuncset % A new definition: (((eq Prop) funcinfuncset) (forall (A:fofType) (B:fofType) (Xf:fofType), ((((func A) B) Xf)->((in Xf) ((funcSet A) B))))) % Defined: funcinfuncset:=(forall (A:fofType) (B:fofType) (Xf:fofType), ((((func A) B) Xf)->((in Xf) ((funcSet A) B)))) % FOF formula (<kernel.Constant object at 0xc47560>, <kernel.DependentProduct object at 0xf669e0>) of role type named lam_type % Using role type % Declaring lam:(fofType->(fofType->((fofType->fofType)->fofType))) % FOF formula (((eq (fofType->(fofType->((fofType->fofType)->fofType)))) lam) (fun (A:fofType) (B:fofType) (Xf:(fofType->fofType))=> (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> (((eq fofType) (Xf Xx)) Xy))))) of role definition named lam % A new definition: (((eq (fofType->(fofType->((fofType->fofType)->fofType)))) lam) (fun (A:fofType) (B:fofType) (Xf:(fofType->fofType))=> (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> (((eq fofType) (Xf Xx)) Xy))))) % Defined: lam:=(fun (A:fofType) (B:fofType) (Xf:(fofType->fofType))=> (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> (((eq fofType) (Xf Xx)) Xy)))) % FOF formula (<kernel.Constant object at 0xc51a70>, <kernel.Sort object at 0xc4d248>) of role type named lamp_type % Using role type % Declaring lamp:Prop % FOF formula (((eq Prop) lamp) (forall (A:fofType) (B:fofType) (Xf:(fofType->fofType)), ((forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B)))->(((func A) B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx))))))) of role definition named lamp % A new definition: (((eq Prop) lamp) (forall (A:fofType) (B:fofType) (Xf:(fofType->fofType)), ((forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B)))->(((func A) B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx))))))) % Defined: lamp:=(forall (A:fofType) (B:fofType) (Xf:(fofType->fofType)), ((forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B)))->(((func A) B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))))) % FOF formula (funcinfuncset->(lamp->(forall (A:fofType) (B:fofType) (Xf:(fofType->fofType)), ((forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B)))->((in (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((funcSet A) B)))))) of role conjecture named lam2p % Conjecture to prove = (funcinfuncset->(lamp->(forall (A:fofType) (B:fofType) (Xf:(fofType->fofType)), ((forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B)))->((in (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((funcSet A) B)))))):Prop % We need to prove ['(funcinfuncset->(lamp->(forall (A:fofType) (B:fofType) (Xf:(fofType->fofType)), ((forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B)))->((in (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((funcSet A) B))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter emptyset:fofType. % Parameter setadjoin:(fofType->(fofType->fofType)). % Parameter dsetconstr:(fofType->((fofType->Prop)->fofType)). % Parameter subset:(fofType->(fofType->Prop)). % Parameter kpair:(fofType->(fofType->fofType)). % Parameter cartprod:(fofType->(fofType->fofType)). % Definition singleton:=(fun (A:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) (((eq fofType) A) ((setadjoin Xx) emptyset)))))):(fofType->Prop). % Definition ex1:=(fun (A:fofType) (Xphi:(fofType->Prop))=> (singleton ((dsetconstr A) (fun (Xx:fofType)=> (Xphi Xx))))):(fofType->((fofType->Prop)->Prop)). % Definition breln:=(fun (A:fofType) (B:fofType) (C:fofType)=> ((subset C) ((cartprod A) B))):(fofType->(fofType->(fofType->Prop))). % Parameter dpsetconstr:(fofType->(fofType->((fofType->(fofType->Prop))->fofType))). % Definition func:=(fun (A:fofType) (B:fofType) (R:fofType)=> ((and (((breln A) B) R)) (forall (Xx:fofType), (((in Xx) A)->((ex1 B) (fun (Xy:fofType)=> ((in ((kpair Xx) Xy)) R))))))):(fofType->(fofType->(fofType->Prop))). % Parameter funcSet:(fofType->(fofType->fofType)). % Definition funcinfuncset:=(forall (A:fofType) (B:fofType) (Xf:fofType), ((((func A) B) Xf)->((in Xf) ((funcSet A) B)))):Prop. % Definition lam:=(fun (A:fofType) (B:fofType) (Xf:(fofType->fofType))=> (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> (((eq fofType) (Xf Xx)) Xy)))):(fofType->(fofType->((fofType->fofType)->fofType))). % Definition lamp:=(forall (A:fofType) (B:fofType) (Xf:(fofType->fofType)), ((forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B)))->(((func A) B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))))):Prop. % Trying to prove (funcinfuncset->(lamp->(forall (A:fofType) (B:fofType) (Xf:(fofType->fofType)), ((forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B)))->((in (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((funcSet A) B)))))) % Found x00000:=(x0000 x1):(((func A) B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) % Found (x0000 x1) as proof of (((func A) B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) % Found ((x000 Xf) x1) as proof of (((func A) B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) % Found (((x00 B) Xf) x1) as proof of (((func A) B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) % Found ((((x0 A) B) Xf) x1) as proof of (((func A) B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) % Found ((((x0 A) B) Xf) x1) as proof of (((func A) B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) % Found (x200 ((((x0 A) B) Xf) x1)) as proof of ((in (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((funcSet A) B)) % Found ((x20 (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((((x0 A) B) Xf) x1)) as proof of ((in (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((funcSet A) B)) % Found (((x2 B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((((x0 A) B) Xf) x1)) as proof of ((in (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((funcSet A) B)) % Found ((((x A) B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((((x0 A) B) Xf) x1)) as proof of ((in (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((funcSet A) B)) % Found (fun (x1:(forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B))))=> ((((x A) B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((((x0 A) B) Xf) x1))) as proof of ((in (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((funcSet A) B)) % Found (fun (Xf:(fofType->fofType)) (x1:(forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B))))=> ((((x A) B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((((x0 A) B) Xf) x1))) as proof of ((forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B)))->((in (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((funcSet A) B))) % Found (fun (B:fofType) (Xf:(fofType->fofType)) (x1:(forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B))))=> ((((x A) B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((((x0 A) B) Xf) x1))) as proof of (forall (Xf:(fofType->fofType)), ((forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B)))->((in (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((funcSet A) B)))) % Found (fun (A:fofType) (B:fofType) (Xf:(fofType->fofType)) (x1:(forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B))))=> ((((x A) B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((((x0 A) B) Xf) x1))) as proof of (forall (B:fofType) (Xf:(fofType->fofType)), ((forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B)))->((in (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((funcSet A) B)))) % Found (fun (x0:lamp) (A:fofType) (B:fofType) (Xf:(fofType->fofType)) (x1:(forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B))))=> ((((x A) B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((((x0 A) B) Xf) x1))) as proof of (forall (A:fofType) (B:fofType) (Xf:(fofType->fofType)), ((forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B)))->((in (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((funcSet A) B)))) % Found (fun (x:funcinfuncset) (x0:lamp) (A:fofType) (B:fofType) (Xf:(fofType->fofType)) (x1:(forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B))))=> ((((x A) B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((((x0 A) B) Xf) x1))) as proof of (lamp->(forall (A:fofType) (B:fofType) (Xf:(fofType->fofType)), ((forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B)))->((in (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((funcSet A) B))))) % Found (fun (x:funcinfuncset) (x0:lamp) (A:fofType) (B:fofType) (Xf:(fofType->fofType)) (x1:(forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B))))=> ((((x A) B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((((x0 A) B) Xf) x1))) as proof of (funcinfuncset->(lamp->(forall (A:fofType) (B:fofType) (Xf:(fofType->fofType)), ((forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B)))->((in (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((funcSet A) B)))))) % Got proof (fun (x:funcinfuncset) (x0:lamp) (A:fofType) (B:fofType) (Xf:(fofType->fofType)) (x1:(forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B))))=> ((((x A) B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((((x0 A) B) Xf) x1))) % Time elapsed = 0.380479s % node=32 cost=226.000000 depth=15 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:funcinfuncset) (x0:lamp) (A:fofType) (B:fofType) (Xf:(fofType->fofType)) (x1:(forall (Xx:fofType), (((in Xx) A)->((in (Xf Xx)) B))))=> ((((x A) B) (((lam A) B) (fun (Xx:fofType)=> (Xf Xx)))) ((((x0 A) B) Xf) x1))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------