%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU601^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:34 EDT 2014 % Result : Theorem 0.42s % Output : Proof 0.42s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU601^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:51:31 CDT 2014 % % CPUTime : 0.42 % 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 0x2381248>, <kernel.DependentProduct object at 0x2381b48>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x219f440>, <kernel.DependentProduct object at 0x23817a0>) of role type named dsetconstr_type % Using role type % Declaring dsetconstr:(fofType->((fofType->Prop)->fofType)) % FOF formula (<kernel.Constant object at 0x2381950>, <kernel.Sort object at 0x2065f38>) 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 0x231a560>, <kernel.DependentProduct object at 0x2381cb0>) of role type named setminus_type % Using role type % Declaring setminus:(fofType->(fofType->fofType)) % FOF formula (((eq (fofType->(fofType->fofType))) setminus) (fun (A:fofType) (B:fofType)=> ((dsetconstr A) (fun (Xx:fofType)=> (((in Xx) B)->False))))) of role definition named setminus % A new definition: (((eq (fofType->(fofType->fofType))) setminus) (fun (A:fofType) (B:fofType)=> ((dsetconstr A) (fun (Xx:fofType)=> (((in Xx) B)->False))))) % Defined: setminus:=(fun (A:fofType) (B:fofType)=> ((dsetconstr A) (fun (Xx:fofType)=> (((in Xx) B)->False)))) % FOF formula (dsetconstrI->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->((in Xx) ((setminus A) B)))))) of role conjecture named setminusI % Conjecture to prove = (dsetconstrI->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->((in Xx) ((setminus 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)->False)->((in Xx) ((setminus 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 setminus:=(fun (A:fofType) (B:fofType)=> ((dsetconstr A) (fun (Xx:fofType)=> (((in Xx) B)->False)))):(fofType->(fofType->fofType)). % Trying to prove (dsetconstrI->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->((in Xx) ((setminus A) B)))))) % Found x00:=(x0 (fun (x3:fofType)=> (not ((in x3) B)))):(forall (Xx:fofType), (((in Xx) A)->((not ((in Xx) B))->((in Xx) ((dsetconstr A) (fun (Xy:fofType)=> (not ((in Xy) B)))))))) % Found (x0 (fun (x3:fofType)=> (not ((in x3) B)))) as proof of (forall (Xx:fofType), (((in Xx) A)->((not ((in Xx) B))->((in Xx) ((setminus A) B))))) % Found ((x A) (fun (x3:fofType)=> (not ((in x3) B)))) as proof of (forall (Xx:fofType), (((in Xx) A)->((not ((in Xx) B))->((in Xx) ((setminus A) B))))) % Found (fun (B:fofType)=> ((x A) (fun (x3:fofType)=> (not ((in x3) B))))) as proof of (forall (Xx:fofType), (((in Xx) A)->((not ((in Xx) B))->((in Xx) ((setminus A) B))))) % Found (fun (A:fofType) (B:fofType)=> ((x A) (fun (x3:fofType)=> (not ((in x3) B))))) as proof of (forall (B:fofType) (Xx:fofType), (((in Xx) A)->((not ((in Xx) B))->((in Xx) ((setminus A) B))))) % Found (fun (x:dsetconstrI) (A:fofType) (B:fofType)=> ((x A) (fun (x3:fofType)=> (not ((in x3) B))))) as proof of (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((not ((in Xx) B))->((in Xx) ((setminus A) B))))) % Found (fun (x:dsetconstrI) (A:fofType) (B:fofType)=> ((x A) (fun (x3:fofType)=> (not ((in x3) B))))) as proof of (dsetconstrI->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((not ((in Xx) B))->((in Xx) ((setminus A) B)))))) % Found (fun (x:dsetconstrI) (A:fofType) (B:fofType)=> ((x A) (fun (x3:fofType)=> (not ((in x3) B))))) as proof of (dsetconstrI->(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) A)->((((in Xx) B)->False)->((in Xx) ((setminus A) B)))))) % Got proof (fun (x:dsetconstrI) (A:fofType) (B:fofType)=> ((x A) (fun (x3:fofType)=> (not ((in x3) B))))) % Time elapsed = 0.094708s % node=14 cost=-126.000000 depth=6 % :::::::::::::::::::::: % % 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)=> (not ((in x3) B))))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------