%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU589^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:32 EDT 2014 % Result : Theorem 0.39s % Output : Proof 0.39s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU589^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 10:49:16 CDT 2014 % % CPUTime : 0.39 % 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 0x189d998>, <kernel.DependentProduct object at 0x1882ef0>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x1cd5638>, <kernel.DependentProduct object at 0x1882f80>) of role type named dsetconstr_type % Using role type % Declaring dsetconstr:(fofType->((fofType->Prop)->fofType)) % FOF formula (<kernel.Constant object at 0x189d518>, <kernel.Sort object at 0x1b30ea8>) of role type named dsetconstrI_type % Using role type % Declaring dsetconstrI:Prop % FOF formula (((eq Prop) dsetconstrI) (forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))))) of role definition named dsetconstrI % A new definition: (((eq Prop) dsetconstrI) (forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy)))))))) % Defined: dsetconstrI:=(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))))) % FOF formula (<kernel.Constant object at 0x189db00>, <kernel.DependentProduct object at 0x1882f80>) of role type named binintersect_type % Using role type % Declaring binintersect:(fofType->(fofType->fofType)) % FOF formula (((eq (fofType->(fofType->fofType))) binintersect) (fun (A:fofType) (B:fofType)=> ((dsetconstr A) (fun (Xx:fofType)=> ((in Xx) B))))) of role definition named binintersect % A new definition: (((eq (fofType->(fofType->fofType))) binintersect) (fun (A:fofType) (B:fofType)=> ((dsetconstr A) (fun (Xx:fofType)=> ((in Xx) B))))) % Defined: binintersect:=(fun (A:fofType) (B:fofType)=> ((dsetconstr A) (fun (Xx:fofType)=> ((in Xx) B)))) % FOF formula (dsetconstrI->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(((in Xx) B)->((in Xx) ((binintersect A) B)))))) of role conjecture named binintersectI % Conjecture to prove = (dsetconstrI->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(((in Xx) B)->((in Xx) ((binintersect A) B)))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(dsetconstrI->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(((in Xx) B)->((in Xx) ((binintersect A) B))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter dsetconstr:(fofType->((fofType->Prop)->fofType)). % Definition dsetconstrI:=(forall (A:fofType) (Xphi:(fofType->Prop)) (Xx:fofType), (((in Xx) A)->((Xphi Xx)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (Xphi Xy))))))):Prop. % Definition binintersect:=(fun (A:fofType) (B:fofType)=> ((dsetconstr A) (fun (Xx:fofType)=> ((in Xx) B)))):(fofType->(fofType->fofType)). % Trying to prove (dsetconstrI->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(((in Xx) B)->((in Xx) ((binintersect A) B)))))) % Found x00:=(x0 (fun (x3:fofType)=> ((in x3) B))):(forall (Xx:fofType), (((in Xx) A)->(((in Xx) B)->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> ((in Xy) B))))))) % Found (x0 (fun (x3:fofType)=> ((in x3) B))) as proof of (forall (Xx:fofType), (((in Xx) A)->(((in Xx) B)->((in Xx) ((binintersect A) B))))) % Found ((x A) (fun (x3:fofType)=> ((in x3) B))) as proof of (forall (Xx:fofType), (((in Xx) A)->(((in Xx) B)->((in Xx) ((binintersect A) B))))) % Found (fun (B:fofType)=> ((x A) (fun (x3:fofType)=> ((in x3) B)))) as proof of (forall (Xx:fofType), (((in Xx) A)->(((in Xx) B)->((in Xx) ((binintersect A) B))))) % Found (fun (A:fofType) (B:fofType)=> ((x A) (fun (x3:fofType)=> ((in x3) B)))) as proof of (forall (B:fofType) (Xx:fofType), (((in Xx) A)->(((in Xx) B)->((in Xx) ((binintersect A) B))))) % Found (fun (x:dsetconstrI) (A:fofType) (B:fofType)=> ((x A) (fun (x3:fofType)=> ((in x3) B)))) as proof of (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(((in Xx) B)->((in Xx) ((binintersect A) B))))) % Found (fun (x:dsetconstrI) (A:fofType) (B:fofType)=> ((x A) (fun (x3:fofType)=> ((in x3) B)))) as proof of (dsetconstrI->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->(((in Xx) B)->((in Xx) ((binintersect A) B)))))) % Got proof (fun (x:dsetconstrI) (A:fofType) (B:fofType)=> ((x A) (fun (x3:fofType)=> ((in x3) B)))) % Time elapsed = 0.067323s % node=6 cost=-179.000000 depth=5 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:dsetconstrI) (A:fofType) (B:fofType)=> ((x A) (fun (x3:fofType)=> ((in x3) B)))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------