%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU666^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 : n184.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:45 EDT 2014 % Result : Theorem 0.50s % Output : Proof 0.50s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU666^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n184.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:06:06 CDT 2014 % % CPUTime : 0.50 % 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 0xf59320>, <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 0xf59878>, <kernel.DependentProduct object at 0xf59368>) of role type named dsetconstr_type % Using role type % Declaring dsetconstr:(fofType->((fofType->Prop)->fofType)) % FOF formula (<kernel.Constant object at 0xf59680>, <kernel.Sort object at 0x1014d88>) of role type named dsetconstrEL_type % Using role type % Declaring dsetconstrEL:Prop % FOF formula (((eq Prop) dsetconstrEL) (forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->((in Xx) A)))) of role definition named dsetconstrEL % A new definition: (((eq Prop) dsetconstrEL) (forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->((in Xx) A)))) % Defined: dsetconstrEL:=(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->((in Xx) A))) % FOF formula (<kernel.Constant object at 0xc477e8>, <kernel.DependentProduct object at 0xf59128>) of role type named subset_type % Using role type % Declaring subset:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0xc477e8>, <kernel.Sort object at 0x1014d88>) of role type named subsetI2_type % Using role type % Declaring subsetI2:Prop % FOF formula (((eq Prop) subsetI2) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B)))) of role definition named subsetI2 % A new definition: (((eq Prop) subsetI2) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B)))) % Defined: subsetI2:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B))) % FOF formula (<kernel.Constant object at 0xf59368>, <kernel.DependentProduct object at 0xd814d0>) of role type named kpair_type % Using role type % Declaring kpair:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0xf59d40>, <kernel.DependentProduct object at 0xd81ef0>) of role type named cartprod_type % Using role type % Declaring cartprod:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0xf59c20>, <kernel.DependentProduct object at 0xd81ef0>) of role type named dpsetconstr_type % Using role type % Declaring dpsetconstr:(fofType->(fofType->((fofType->(fofType->Prop))->fofType))) % FOF formula (((eq (fofType->(fofType->((fofType->(fofType->Prop))->fofType)))) dpsetconstr) (fun (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop)))=> ((dsetconstr ((cartprod A) B)) (fun (Xu:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) ((ex fofType) (fun (Xy:fofType)=> ((and ((and ((in Xy) B)) ((Xphi Xx) Xy))) (((eq fofType) Xu) ((kpair Xx) Xy)))))))))))) of role definition named dpsetconstr % A new definition: (((eq (fofType->(fofType->((fofType->(fofType->Prop))->fofType)))) dpsetconstr) (fun (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop)))=> ((dsetconstr ((cartprod A) B)) (fun (Xu:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) ((ex fofType) (fun (Xy:fofType)=> ((and ((and ((in Xy) B)) ((Xphi Xx) Xy))) (((eq fofType) Xu) ((kpair Xx) Xy)))))))))))) % Defined: dpsetconstr:=(fun (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop)))=> ((dsetconstr ((cartprod A) B)) (fun (Xu:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) ((ex fofType) (fun (Xy:fofType)=> ((and ((and ((in Xy) B)) ((Xphi Xx) Xy))) (((eq fofType) Xu) ((kpair Xx) Xy))))))))))) % FOF formula (dsetconstrEL->(subsetI2->(forall (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop))), ((subset (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B))))) of role conjecture named dpsetconstrSub % Conjecture to prove = (dsetconstrEL->(subsetI2->(forall (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop))), ((subset (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(dsetconstrEL->(subsetI2->(forall (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop))), ((subset (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B)))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter dsetconstr:(fofType->((fofType->Prop)->fofType)). % Definition dsetconstrEL:=(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))->((in Xx) A))):Prop. % Parameter subset:(fofType->(fofType->Prop)). % Definition subsetI2:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B))):Prop. % Parameter kpair:(fofType->(fofType->fofType)). % Parameter cartprod:(fofType->(fofType->fofType)). % Definition dpsetconstr:=(fun (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop)))=> ((dsetconstr ((cartprod A) B)) (fun (Xu:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) ((ex fofType) (fun (Xy:fofType)=> ((and ((and ((in Xy) B)) ((Xphi Xx) Xy))) (((eq fofType) Xu) ((kpair Xx) Xy))))))))))):(fofType->(fofType->((fofType->(fofType->Prop))->fofType))). % Trying to prove (dsetconstrEL->(subsetI2->(forall (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop))), ((subset (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B))))) % Found x10:=(x1 (fun (x4:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) ((ex fofType) (fun (Xy:fofType)=> ((and ((and ((in Xy) B)) ((Xphi Xx) Xy))) (((eq fofType) x4) ((kpair Xx) Xy)))))))))):(forall (Xx:fofType), (((in Xx) ((dsetconstr ((cartprod A) B)) (fun (Xy:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) ((ex fofType) (fun (Xy0:fofType)=> ((and ((and ((in Xy0) B)) ((Xphi Xx) Xy0))) (((eq fofType) Xy) ((kpair Xx) Xy0)))))))))))->((in Xx) ((cartprod A) B)))) % Found (x1 (fun (x4:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) ((ex fofType) (fun (Xy:fofType)=> ((and ((and ((in Xy) B)) ((Xphi Xx) Xy))) (((eq fofType) x4) ((kpair Xx) Xy)))))))))) as proof of (forall (Xx:fofType), (((in Xx) (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy))))->((in Xx) ((cartprod A) B)))) % Found ((x ((cartprod A) B)) (fun (x4:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) ((ex fofType) (fun (Xy:fofType)=> ((and ((and ((in Xy) B)) ((Xphi Xx) Xy))) (((eq fofType) x4) ((kpair Xx) Xy)))))))))) as proof of (forall (Xx:fofType), (((in Xx) (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy))))->((in Xx) ((cartprod A) B)))) % Found ((x ((cartprod A) B)) (fun (x4:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) ((ex fofType) (fun (Xy:fofType)=> ((and ((and ((in Xy) B)) ((Xphi Xx) Xy))) (((eq fofType) x4) ((kpair Xx) Xy)))))))))) as proof of (forall (Xx:fofType), (((in Xx) (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy))))->((in Xx) ((cartprod A) B)))) % Found (x000 ((x ((cartprod A) B)) (fun (x4:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) ((ex fofType) (fun (Xy:fofType)=> ((and ((and ((in Xy) B)) ((Xphi Xx) Xy))) (((eq fofType) x4) ((kpair Xx) Xy))))))))))) as proof of ((subset (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B)) % Found ((x00 ((cartprod A) B)) ((x ((cartprod A) B)) (fun (x4:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) ((ex fofType) (fun (Xy:fofType)=> ((and ((and ((in Xy) B)) ((Xphi Xx) Xy))) (((eq fofType) x4) ((kpair Xx) Xy))))))))))) as proof of ((subset (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B)) % Found (((x0 (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B)) ((x ((cartprod A) B)) (fun (x4:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) ((ex fofType) (fun (Xy:fofType)=> ((and ((and ((in Xy) B)) ((Xphi Xx) Xy))) (((eq fofType) x4) ((kpair Xx) Xy))))))))))) as proof of ((subset (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B)) % Found (fun (Xphi:(fofType->(fofType->Prop)))=> (((x0 (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B)) ((x ((cartprod A) B)) (fun (x4:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) ((ex fofType) (fun (Xy:fofType)=> ((and ((and ((in Xy) B)) ((Xphi Xx) Xy))) (((eq fofType) x4) ((kpair Xx) Xy)))))))))))) as proof of ((subset (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B)) % Found (fun (B:fofType) (Xphi:(fofType->(fofType->Prop)))=> (((x0 (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B)) ((x ((cartprod A) B)) (fun (x4:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) ((ex fofType) (fun (Xy:fofType)=> ((and ((and ((in Xy) B)) ((Xphi Xx) Xy))) (((eq fofType) x4) ((kpair Xx) Xy)))))))))))) as proof of (forall (Xphi:(fofType->(fofType->Prop))), ((subset (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B))) % Found (fun (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop)))=> (((x0 (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B)) ((x ((cartprod A) B)) (fun (x4:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) ((ex fofType) (fun (Xy:fofType)=> ((and ((and ((in Xy) B)) ((Xphi Xx) Xy))) (((eq fofType) x4) ((kpair Xx) Xy)))))))))))) as proof of (forall (B:fofType) (Xphi:(fofType->(fofType->Prop))), ((subset (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B))) % Found (fun (x0:subsetI2) (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop)))=> (((x0 (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B)) ((x ((cartprod A) B)) (fun (x4:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) ((ex fofType) (fun (Xy:fofType)=> ((and ((and ((in Xy) B)) ((Xphi Xx) Xy))) (((eq fofType) x4) ((kpair Xx) Xy)))))))))))) as proof of (forall (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop))), ((subset (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B))) % Found (fun (x:dsetconstrEL) (x0:subsetI2) (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop)))=> (((x0 (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B)) ((x ((cartprod A) B)) (fun (x4:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) ((ex fofType) (fun (Xy:fofType)=> ((and ((and ((in Xy) B)) ((Xphi Xx) Xy))) (((eq fofType) x4) ((kpair Xx) Xy)))))))))))) as proof of (subsetI2->(forall (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop))), ((subset (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B)))) % Found (fun (x:dsetconstrEL) (x0:subsetI2) (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop)))=> (((x0 (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B)) ((x ((cartprod A) B)) (fun (x4:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) ((ex fofType) (fun (Xy:fofType)=> ((and ((and ((in Xy) B)) ((Xphi Xx) Xy))) (((eq fofType) x4) ((kpair Xx) Xy)))))))))))) as proof of (dsetconstrEL->(subsetI2->(forall (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop))), ((subset (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B))))) % Got proof (fun (x:dsetconstrEL) (x0:subsetI2) (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop)))=> (((x0 (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B)) ((x ((cartprod A) B)) (fun (x4:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) ((ex fofType) (fun (Xy:fofType)=> ((and ((and ((in Xy) B)) ((Xphi Xx) Xy))) (((eq fofType) x4) ((kpair Xx) Xy)))))))))))) % Time elapsed = 0.158044s % node=19 cost=-95.000000 depth=11 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:dsetconstrEL) (x0:subsetI2) (A:fofType) (B:fofType) (Xphi:(fofType->(fofType->Prop)))=> (((x0 (((dpsetconstr A) B) (fun (Xx:fofType) (Xy:fofType)=> ((Xphi Xx) Xy)))) ((cartprod A) B)) ((x ((cartprod A) B)) (fun (x4:fofType)=> ((ex fofType) (fun (Xx:fofType)=> ((and ((in Xx) A)) ((ex fofType) (fun (Xy:fofType)=> ((and ((and ((in Xy) B)) ((Xphi Xx) Xy))) (((eq fofType) x4) ((kpair Xx) Xy)))))))))))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------