%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU719^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 : n098.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:55 EDT 2014 % Result : Theorem 0.59s % Output : Proof 0.59s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU719^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n098.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:17:51 CDT 2014 % % CPUTime : 0.59 % 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 0x1c2ad40>, <kernel.DependentProduct object at 0x1c2b290>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x1c7f680>, <kernel.DependentProduct object at 0x1c2b908>) of role type named powerset_type % Using role type % Declaring powerset:(fofType->fofType) % FOF formula (<kernel.Constant object at 0x1c2ad40>, <kernel.DependentProduct object at 0x1c2b908>) of role type named setminus_type % Using role type % Declaring setminus:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x1c88bd8>, <kernel.Sort object at 0x1712cf8>) of role type named setminusER_type % Using role type % Declaring setminusER:Prop % FOF formula (((eq Prop) setminusER) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->(((in Xx) B)->False)))) of role definition named setminusER % A new definition: (((eq Prop) setminusER) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->(((in Xx) B)->False)))) % Defined: setminusER:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->(((in Xx) B)->False))) % FOF formula (setminusER->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->(((in Xx) ((setminus A) X))->False))))))) of role conjecture named complementTI1 % Conjecture to prove = (setminusER->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->(((in Xx) ((setminus A) X))->False))))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(setminusER->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->(((in Xx) ((setminus A) X))->False)))))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter powerset:(fofType->fofType). % Parameter setminus:(fofType->(fofType->fofType)). % Definition setminusER:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->(((in Xx) B)->False))):Prop. % Trying to prove (setminusER->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->(((in Xx) ((setminus A) X))->False))))))) % Found x4000:=(x400 x3):False % Found (x400 x3) as proof of False % Found ((x40 A) x3) as proof of False % Found (((fun (A0:fofType) (x5:((in Xx) ((setminus A0) X)))=> (((x4 A0) x5) x2)) A) x3) as proof of False % Found (((fun (A0:fofType) (x5:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x A0) X) Xx)) A0) x5) x2)) A) x3) as proof of False % Found (fun (x3:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x5:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x A0) X) Xx)) A0) x5) x2)) A) x3)) as proof of False % Found (fun (x2:((in Xx) X)) (x3:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x5:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x A0) X) Xx)) A0) x5) x2)) A) x3)) as proof of (((in Xx) ((setminus A) X))->False) % Found (fun (x1:((in Xx) A)) (x2:((in Xx) X)) (x3:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x5:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x A0) X) Xx)) A0) x5) x2)) A) x3)) as proof of (((in Xx) X)->(((in Xx) ((setminus A) X))->False)) % Found (fun (Xx:fofType) (x1:((in Xx) A)) (x2:((in Xx) X)) (x3:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x5:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x A0) X) Xx)) A0) x5) x2)) A) x3)) as proof of (((in Xx) A)->(((in Xx) X)->(((in Xx) ((setminus A) X))->False))) % Found (fun (x0:((in X) (powerset A))) (Xx:fofType) (x1:((in Xx) A)) (x2:((in Xx) X)) (x3:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x5:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x A0) X) Xx)) A0) x5) x2)) A) x3)) as proof of (forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->(((in Xx) ((setminus A) X))->False)))) % Found (fun (X:fofType) (x0:((in X) (powerset A))) (Xx:fofType) (x1:((in Xx) A)) (x2:((in Xx) X)) (x3:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x5:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x A0) X) Xx)) A0) x5) x2)) A) x3)) as proof of (((in X) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->(((in Xx) ((setminus A) X))->False))))) % Found (fun (A:fofType) (X:fofType) (x0:((in X) (powerset A))) (Xx:fofType) (x1:((in Xx) A)) (x2:((in Xx) X)) (x3:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x5:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x A0) X) Xx)) A0) x5) x2)) A) x3)) as proof of (forall (X:fofType), (((in X) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->(((in Xx) ((setminus A) X))->False)))))) % Found (fun (x:setminusER) (A:fofType) (X:fofType) (x0:((in X) (powerset A))) (Xx:fofType) (x1:((in Xx) A)) (x2:((in Xx) X)) (x3:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x5:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x A0) X) Xx)) A0) x5) x2)) A) x3)) as proof of (forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->(((in Xx) ((setminus A) X))->False)))))) % Found (fun (x:setminusER) (A:fofType) (X:fofType) (x0:((in X) (powerset A))) (Xx:fofType) (x1:((in Xx) A)) (x2:((in Xx) X)) (x3:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x5:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x A0) X) Xx)) A0) x5) x2)) A) x3)) as proof of (setminusER->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((in Xx) X)->(((in Xx) ((setminus A) X))->False))))))) % Got proof (fun (x:setminusER) (A:fofType) (X:fofType) (x0:((in X) (powerset A))) (Xx:fofType) (x1:((in Xx) A)) (x2:((in Xx) X)) (x3:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x5:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x A0) X) Xx)) A0) x5) x2)) A) x3)) % Time elapsed = 0.274008s % node=73 cost=524.000000 depth=12 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:setminusER) (A:fofType) (X:fofType) (x0:((in X) (powerset A))) (Xx:fofType) (x1:((in Xx) A)) (x2:((in Xx) X)) (x3:((in Xx) ((setminus A) X)))=> (((fun (A0:fofType) (x5:((in Xx) ((setminus A0) X)))=> ((((fun (A0:fofType)=> (((x A0) X) Xx)) A0) x5) x2)) A) x3)) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------