%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU724^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 : n101.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:56 EDT 2014 % Result : Theorem 0.47s % Output : Proof 0.47s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU724^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n101.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:18:41 CDT 2014 % % CPUTime : 0.47 % 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 0x185d830>, <kernel.DependentProduct object at 0x167a488>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x185d560>, <kernel.DependentProduct object at 0x167ad88>) of role type named powerset_type % Using role type % Declaring powerset:(fofType->fofType) % FOF formula (<kernel.Constant object at 0x185d758>, <kernel.DependentProduct object at 0x167ae18>) of role type named subset_type % Using role type % Declaring subset:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x185d830>, <kernel.Sort object at 0x15405a8>) of role type named subsetE_type % Using role type % Declaring subsetE:Prop % FOF formula (((eq Prop) subsetE) (forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->(((in Xx) A)->((in Xx) B))))) of role definition named subsetE % A new definition: (((eq Prop) subsetE) (forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->(((in Xx) A)->((in Xx) B))))) % Defined: subsetE:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->(((in Xx) A)->((in Xx) B)))) % FOF formula (subsetE->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((subset X) Y)->((((in Xx) Y)->False)->(((in Xx) X)->False)))))))))) of role conjecture named contrasubsetT1 % Conjecture to prove = (subsetE->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((subset X) Y)->((((in Xx) Y)->False)->(((in Xx) X)->False)))))))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(subsetE->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((subset X) Y)->((((in Xx) Y)->False)->(((in Xx) X)->False))))))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter powerset:(fofType->fofType). % Parameter subset:(fofType->(fofType->Prop)). % Definition subsetE:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((subset A) B)->(((in Xx) A)->((in Xx) B)))):Prop. % Trying to prove (subsetE->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((subset X) Y)->((((in Xx) Y)->False)->(((in Xx) X)->False)))))))))) % Found x60000:=(x6000 x5):((in Xx) Y) % Found (x6000 x5) as proof of ((in Xx) Y) % Found ((x600 x3) x5) as proof of ((in Xx) Y) % Found (((x60 X) x3) x5) as proof of ((in Xx) Y) % Found ((((fun (A0:fofType)=> ((x6 A0) Xx)) X) x3) x5) as proof of ((in Xx) Y) % Found ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) Y)) A0) Xx)) X) x3) x5) as proof of ((in Xx) Y) % Found ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) Y)) A0) Xx)) X) x3) x5) as proof of ((in Xx) Y) % Found (x4 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) Y)) A0) Xx)) X) x3) x5)) as proof of False % Found (fun (x5:((in Xx) X))=> (x4 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) Y)) A0) Xx)) X) x3) x5))) as proof of False % Found (fun (x4:(((in Xx) Y)->False)) (x5:((in Xx) X))=> (x4 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) Y)) A0) Xx)) X) x3) x5))) as proof of (((in Xx) X)->False) % Found (fun (x3:((subset X) Y)) (x4:(((in Xx) Y)->False)) (x5:((in Xx) X))=> (x4 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) Y)) A0) Xx)) X) x3) x5))) as proof of ((((in Xx) Y)->False)->(((in Xx) X)->False)) % Found (fun (x2:((in Xx) A)) (x3:((subset X) Y)) (x4:(((in Xx) Y)->False)) (x5:((in Xx) X))=> (x4 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) Y)) A0) Xx)) X) x3) x5))) as proof of (((subset X) Y)->((((in Xx) Y)->False)->(((in Xx) X)->False))) % Found (fun (Xx:fofType) (x2:((in Xx) A)) (x3:((subset X) Y)) (x4:(((in Xx) Y)->False)) (x5:((in Xx) X))=> (x4 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) Y)) A0) Xx)) X) x3) x5))) as proof of (((in Xx) A)->(((subset X) Y)->((((in Xx) Y)->False)->(((in Xx) X)->False)))) % Found (fun (x1:((in Y) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:((subset X) Y)) (x4:(((in Xx) Y)->False)) (x5:((in Xx) X))=> (x4 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) Y)) A0) Xx)) X) x3) x5))) as proof of (forall (Xx:fofType), (((in Xx) A)->(((subset X) Y)->((((in Xx) Y)->False)->(((in Xx) X)->False))))) % Found (fun (Y:fofType) (x1:((in Y) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:((subset X) Y)) (x4:(((in Xx) Y)->False)) (x5:((in Xx) X))=> (x4 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) Y)) A0) Xx)) X) x3) x5))) as proof of (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((subset X) Y)->((((in Xx) Y)->False)->(((in Xx) X)->False)))))) % Found (fun (x0:((in X) (powerset A))) (Y:fofType) (x1:((in Y) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:((subset X) Y)) (x4:(((in Xx) Y)->False)) (x5:((in Xx) X))=> (x4 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) Y)) A0) Xx)) X) x3) x5))) as proof of (forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((subset X) Y)->((((in Xx) Y)->False)->(((in Xx) X)->False))))))) % Found (fun (X:fofType) (x0:((in X) (powerset A))) (Y:fofType) (x1:((in Y) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:((subset X) Y)) (x4:(((in Xx) Y)->False)) (x5:((in Xx) X))=> (x4 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) Y)) A0) Xx)) X) x3) x5))) as proof of (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((subset X) Y)->((((in Xx) Y)->False)->(((in Xx) X)->False)))))))) % Found (fun (A:fofType) (X:fofType) (x0:((in X) (powerset A))) (Y:fofType) (x1:((in Y) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:((subset X) Y)) (x4:(((in Xx) Y)->False)) (x5:((in Xx) X))=> (x4 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) Y)) A0) Xx)) X) x3) x5))) as proof of (forall (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((subset X) Y)->((((in Xx) Y)->False)->(((in Xx) X)->False))))))))) % Found (fun (x:subsetE) (A:fofType) (X:fofType) (x0:((in X) (powerset A))) (Y:fofType) (x1:((in Y) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:((subset X) Y)) (x4:(((in Xx) Y)->False)) (x5:((in Xx) X))=> (x4 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) Y)) A0) Xx)) X) x3) x5))) as proof of (forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((subset X) Y)->((((in Xx) Y)->False)->(((in Xx) X)->False))))))))) % Found (fun (x:subsetE) (A:fofType) (X:fofType) (x0:((in X) (powerset A))) (Y:fofType) (x1:((in Y) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:((subset X) Y)) (x4:(((in Xx) Y)->False)) (x5:((in Xx) X))=> (x4 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) Y)) A0) Xx)) X) x3) x5))) as proof of (subsetE->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((subset X) Y)->((((in Xx) Y)->False)->(((in Xx) X)->False)))))))))) % Got proof (fun (x:subsetE) (A:fofType) (X:fofType) (x0:((in X) (powerset A))) (Y:fofType) (x1:((in Y) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:((subset X) Y)) (x4:(((in Xx) Y)->False)) (x5:((in Xx) X))=> (x4 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) Y)) A0) Xx)) X) x3) x5))) % Time elapsed = 0.150686s % node=25 cost=603.000000 depth=18 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:subsetE) (A:fofType) (X:fofType) (x0:((in X) (powerset A))) (Y:fofType) (x1:((in Y) (powerset A))) (Xx:fofType) (x2:((in Xx) A)) (x3:((subset X) Y)) (x4:(((in Xx) Y)->False)) (x5:((in Xx) X))=> (x4 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) Y)) A0) Xx)) X) x3) x5))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------