%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU723^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 : n096.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.94s % Output : Proof 0.94s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU723^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n096.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:31 CDT 2014 % % CPUTime : 0.94 % 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 0x24720e0>, <kernel.DependentProduct object at 0x2472a28>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x2472f38>, <kernel.DependentProduct object at 0x24725f0>) of role type named powerset_type % Using role type % Declaring powerset:(fofType->fofType) % FOF formula (<kernel.Constant object at 0x2472098>, <kernel.DependentProduct object at 0x24725a8>) of role type named subset_type % Using role type % Declaring subset:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x2472878>, <kernel.Sort object at 0x1f5fd88>) 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 (<kernel.Constant object at 0x24720e0>, <kernel.DependentProduct object at 0x24723b0>) of role type named setminus_type % Using role type % Declaring setminus:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x2472098>, <kernel.Sort object at 0x1f5fd88>) 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 (subsetE->(setminusER->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((subset X) ((setminus A) Y))->(((in Xx) Y)->(((in Xx) X)->False))))))))))) of role conjecture named contrasubsetT % Conjecture to prove = (subsetE->(setminusER->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((subset X) ((setminus A) Y))->(((in Xx) Y)->(((in Xx) X)->False))))))))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(subsetE->(setminusER->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((subset X) ((setminus A) Y))->(((in Xx) Y)->(((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. % 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 (subsetE->(setminusER->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((subset X) ((setminus A) Y))->(((in Xx) Y)->(((in Xx) X)->False))))))))))) % Found x3:((in Xx) A) % Found x3 as proof of ((in Xx) A) % Found x5:((in Xx) Y) % Found x5 as proof of ((in Xx) Y) % Found x4:((subset X) ((setminus A) Y)) % Instantiate: A0:=A:fofType % Found x4 as proof of ((subset X) ((setminus A0) Y)) % Found (x7000 x4) as proof of ((in Xx) ((setminus A0) Y)) % Found ((fun (x8:((subset X) ((setminus A0) Y)))=> ((x700 x8) x6)) x4) as proof of ((in Xx) ((setminus A0) Y)) % Found ((fun (x8:((subset X) ((setminus A0) Y)))=> (((x70 X) x8) x6)) x4) as proof of ((in Xx) ((setminus A0) Y)) % Found ((fun (x8:((subset X) ((setminus A0) Y)))=> ((((fun (A1:fofType)=> ((x7 A1) Xx)) X) x8) x6)) x4) as proof of ((in Xx) ((setminus A0) Y)) % Found ((fun (x8:((subset X) ((setminus A0) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A0) Y))) A1) Xx)) X) x8) x6)) x4) as proof of ((in Xx) ((setminus A0) Y)) % Found ((fun (x8:((subset X) ((setminus A0) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A0) Y))) A1) Xx)) X) x8) x6)) x4) as proof of ((in Xx) ((setminus A0) Y)) % Found (x0000 ((fun (x8:((subset X) ((setminus A0) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A0) Y))) A1) Xx)) X) x8) x6)) x4)) as proof of False % Found ((x000 A) ((fun (x8:((subset X) ((setminus A) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A) Y))) A1) Xx)) X) x8) x6)) x4)) as proof of False % Found (((fun (A0:fofType) (x7:((in Xx) ((setminus A0) Y)))=> (((x00 A0) x7) x5)) A) ((fun (x8:((subset X) ((setminus A) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A) Y))) A1) Xx)) X) x8) x6)) x4)) as proof of False % Found (((fun (A0:fofType) (x7:((in Xx) ((setminus A0) Y)))=> ((((fun (A0:fofType)=> (((x0 A0) Y) Xx)) A0) x7) x5)) A) ((fun (x8:((subset X) ((setminus A) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A) Y))) A1) Xx)) X) x8) x6)) x4)) as proof of False % Found (fun (x6:((in Xx) X))=> (((fun (A0:fofType) (x7:((in Xx) ((setminus A0) Y)))=> ((((fun (A0:fofType)=> (((x0 A0) Y) Xx)) A0) x7) x5)) A) ((fun (x8:((subset X) ((setminus A) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A) Y))) A1) Xx)) X) x8) x6)) x4))) as proof of False % Found (fun (x5:((in Xx) Y)) (x6:((in Xx) X))=> (((fun (A0:fofType) (x7:((in Xx) ((setminus A0) Y)))=> ((((fun (A0:fofType)=> (((x0 A0) Y) Xx)) A0) x7) x5)) A) ((fun (x8:((subset X) ((setminus A) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A) Y))) A1) Xx)) X) x8) x6)) x4))) as proof of (((in Xx) X)->False) % Found (fun (x4:((subset X) ((setminus A) Y))) (x5:((in Xx) Y)) (x6:((in Xx) X))=> (((fun (A0:fofType) (x7:((in Xx) ((setminus A0) Y)))=> ((((fun (A0:fofType)=> (((x0 A0) Y) Xx)) A0) x7) x5)) A) ((fun (x8:((subset X) ((setminus A) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A) Y))) A1) Xx)) X) x8) x6)) x4))) as proof of (((in Xx) Y)->(((in Xx) X)->False)) % Found (fun (x3:((in Xx) A)) (x4:((subset X) ((setminus A) Y))) (x5:((in Xx) Y)) (x6:((in Xx) X))=> (((fun (A0:fofType) (x7:((in Xx) ((setminus A0) Y)))=> ((((fun (A0:fofType)=> (((x0 A0) Y) Xx)) A0) x7) x5)) A) ((fun (x8:((subset X) ((setminus A) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A) Y))) A1) Xx)) X) x8) x6)) x4))) as proof of (((subset X) ((setminus A) Y))->(((in Xx) Y)->(((in Xx) X)->False))) % Found (fun (Xx:fofType) (x3:((in Xx) A)) (x4:((subset X) ((setminus A) Y))) (x5:((in Xx) Y)) (x6:((in Xx) X))=> (((fun (A0:fofType) (x7:((in Xx) ((setminus A0) Y)))=> ((((fun (A0:fofType)=> (((x0 A0) Y) Xx)) A0) x7) x5)) A) ((fun (x8:((subset X) ((setminus A) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A) Y))) A1) Xx)) X) x8) x6)) x4))) as proof of (((in Xx) A)->(((subset X) ((setminus A) Y))->(((in Xx) Y)->(((in Xx) X)->False)))) % Found (fun (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((subset X) ((setminus A) Y))) (x5:((in Xx) Y)) (x6:((in Xx) X))=> (((fun (A0:fofType) (x7:((in Xx) ((setminus A0) Y)))=> ((((fun (A0:fofType)=> (((x0 A0) Y) Xx)) A0) x7) x5)) A) ((fun (x8:((subset X) ((setminus A) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A) Y))) A1) Xx)) X) x8) x6)) x4))) as proof of (forall (Xx:fofType), (((in Xx) A)->(((subset X) ((setminus A) Y))->(((in Xx) Y)->(((in Xx) X)->False))))) % Found (fun (Y:fofType) (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((subset X) ((setminus A) Y))) (x5:((in Xx) Y)) (x6:((in Xx) X))=> (((fun (A0:fofType) (x7:((in Xx) ((setminus A0) Y)))=> ((((fun (A0:fofType)=> (((x0 A0) Y) Xx)) A0) x7) x5)) A) ((fun (x8:((subset X) ((setminus A) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A) Y))) A1) Xx)) X) x8) x6)) x4))) as proof of (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((subset X) ((setminus A) Y))->(((in Xx) Y)->(((in Xx) X)->False)))))) % Found (fun (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((subset X) ((setminus A) Y))) (x5:((in Xx) Y)) (x6:((in Xx) X))=> (((fun (A0:fofType) (x7:((in Xx) ((setminus A0) Y)))=> ((((fun (A0:fofType)=> (((x0 A0) Y) Xx)) A0) x7) x5)) A) ((fun (x8:((subset X) ((setminus A) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A) Y))) A1) Xx)) X) x8) x6)) x4))) as proof of (forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((subset X) ((setminus A) Y))->(((in Xx) Y)->(((in Xx) X)->False))))))) % Found (fun (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((subset X) ((setminus A) Y))) (x5:((in Xx) Y)) (x6:((in Xx) X))=> (((fun (A0:fofType) (x7:((in Xx) ((setminus A0) Y)))=> ((((fun (A0:fofType)=> (((x0 A0) Y) Xx)) A0) x7) x5)) A) ((fun (x8:((subset X) ((setminus A) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A) Y))) A1) Xx)) X) x8) x6)) x4))) as proof of (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((subset X) ((setminus A) Y))->(((in Xx) Y)->(((in Xx) X)->False)))))))) % Found (fun (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((subset X) ((setminus A) Y))) (x5:((in Xx) Y)) (x6:((in Xx) X))=> (((fun (A0:fofType) (x7:((in Xx) ((setminus A0) Y)))=> ((((fun (A0:fofType)=> (((x0 A0) Y) Xx)) A0) x7) x5)) A) ((fun (x8:((subset X) ((setminus A) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A) Y))) A1) Xx)) X) x8) x6)) x4))) 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) ((setminus A) Y))->(((in Xx) Y)->(((in Xx) X)->False))))))))) % Found (fun (x0:setminusER) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((subset X) ((setminus A) Y))) (x5:((in Xx) Y)) (x6:((in Xx) X))=> (((fun (A0:fofType) (x7:((in Xx) ((setminus A0) Y)))=> ((((fun (A0:fofType)=> (((x0 A0) Y) Xx)) A0) x7) x5)) A) ((fun (x8:((subset X) ((setminus A) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A) Y))) A1) Xx)) X) x8) x6)) x4))) 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) ((setminus A) Y))->(((in Xx) Y)->(((in Xx) X)->False))))))))) % Found (fun (x:subsetE) (x0:setminusER) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((subset X) ((setminus A) Y))) (x5:((in Xx) Y)) (x6:((in Xx) X))=> (((fun (A0:fofType) (x7:((in Xx) ((setminus A0) Y)))=> ((((fun (A0:fofType)=> (((x0 A0) Y) Xx)) A0) x7) x5)) A) ((fun (x8:((subset X) ((setminus A) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A) Y))) A1) Xx)) X) x8) x6)) x4))) as proof of (setminusER->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((subset X) ((setminus A) Y))->(((in Xx) Y)->(((in Xx) X)->False)))))))))) % Found (fun (x:subsetE) (x0:setminusER) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((subset X) ((setminus A) Y))) (x5:((in Xx) Y)) (x6:((in Xx) X))=> (((fun (A0:fofType) (x7:((in Xx) ((setminus A0) Y)))=> ((((fun (A0:fofType)=> (((x0 A0) Y) Xx)) A0) x7) x5)) A) ((fun (x8:((subset X) ((setminus A) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A) Y))) A1) Xx)) X) x8) x6)) x4))) as proof of (subsetE->(setminusER->(forall (A:fofType) (X:fofType), (((in X) (powerset A))->(forall (Y:fofType), (((in Y) (powerset A))->(forall (Xx:fofType), (((in Xx) A)->(((subset X) ((setminus A) Y))->(((in Xx) Y)->(((in Xx) X)->False))))))))))) % Got proof (fun (x:subsetE) (x0:setminusER) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((subset X) ((setminus A) Y))) (x5:((in Xx) Y)) (x6:((in Xx) X))=> (((fun (A0:fofType) (x7:((in Xx) ((setminus A0) Y)))=> ((((fun (A0:fofType)=> (((x0 A0) Y) Xx)) A0) x7) x5)) A) ((fun (x8:((subset X) ((setminus A) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A) Y))) A1) Xx)) X) x8) x6)) x4))) % Time elapsed = 0.611283s % node=157 cost=1020.000000 depth=23 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:subsetE) (x0:setminusER) (A:fofType) (X:fofType) (x1:((in X) (powerset A))) (Y:fofType) (x2:((in Y) (powerset A))) (Xx:fofType) (x3:((in Xx) A)) (x4:((subset X) ((setminus A) Y))) (x5:((in Xx) Y)) (x6:((in Xx) X))=> (((fun (A0:fofType) (x7:((in Xx) ((setminus A0) Y)))=> ((((fun (A0:fofType)=> (((x0 A0) Y) Xx)) A0) x7) x5)) A) ((fun (x8:((subset X) ((setminus A) Y)))=> ((((fun (A1:fofType)=> (((fun (A1:fofType)=> ((x A1) ((setminus A) Y))) A1) Xx)) X) x8) x6)) x4))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------