%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU567^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:29 EDT 2014 % Result : Theorem 0.67s % Output : Proof 0.67s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU567^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 10:44:56 CDT 2014 % % CPUTime : 0.67 % 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 0x163b3f8>, <kernel.DependentProduct object at 0x163b7e8>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x1894950>, <kernel.DependentProduct object at 0x163b7e8>) of role type named subset_type % Using role type % Declaring subset:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x163bef0>, <kernel.Sort object at 0x13209e0>) of role type named subsetI1_type % Using role type % Declaring subsetI1:Prop % FOF formula (((eq Prop) subsetI1) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B)))) of role definition named subsetI1 % A new definition: (((eq Prop) subsetI1) (forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B)))) % Defined: subsetI1:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B))) % FOF formula (subsetI1->(forall (A:fofType) (B:fofType), ((((subset A) B)->False)->(not (((eq fofType) A) B))))) of role conjecture named notequalI1 % Conjecture to prove = (subsetI1->(forall (A:fofType) (B:fofType), ((((subset A) B)->False)->(not (((eq fofType) A) B))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(subsetI1->(forall (A:fofType) (B:fofType), ((((subset A) B)->False)->(not (((eq fofType) A) B)))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter subset:(fofType->(fofType->Prop)). % Definition subsetI1:=(forall (A:fofType) (B:fofType), ((forall (Xx:fofType), (((in Xx) A)->((in Xx) B)))->((subset A) B))):Prop. % Trying to prove (subsetI1->(forall (A:fofType) (B:fofType), ((((subset A) B)->False)->(not (((eq fofType) A) B))))) % Found x10:=(x1 (in Xx)):(((in Xx) A)->((in Xx) B)) % Found (x1 (in Xx)) as proof of (((in Xx) A)->((in Xx) B)) % Found (fun (Xx:fofType)=> (x1 (in Xx))) as proof of (((in Xx) A)->((in Xx) B)) % Found (fun (Xx:fofType)=> (x1 (in Xx))) as proof of (forall (Xx:fofType), (((in Xx) A)->((in Xx) B))) % Found (x20 (fun (Xx:fofType)=> (x1 (in Xx)))) as proof of ((subset A) B) % Found ((x2 B) (fun (Xx:fofType)=> (x1 (in Xx)))) as proof of ((subset A) B) % Found (((x A) B) (fun (Xx:fofType)=> (x1 (in Xx)))) as proof of ((subset A) B) % Found (((x A) B) (fun (Xx:fofType)=> (x1 (in Xx)))) as proof of ((subset A) B) % Found (x0 (((x A) B) (fun (Xx:fofType)=> (x1 (in Xx))))) as proof of False % Found (fun (x1:(((eq fofType) A) B))=> (x0 (((x A) B) (fun (Xx:fofType)=> (x1 (in Xx)))))) as proof of False % Found (fun (x0:(((subset A) B)->False)) (x1:(((eq fofType) A) B))=> (x0 (((x A) B) (fun (Xx:fofType)=> (x1 (in Xx)))))) as proof of (not (((eq fofType) A) B)) % Found (fun (B:fofType) (x0:(((subset A) B)->False)) (x1:(((eq fofType) A) B))=> (x0 (((x A) B) (fun (Xx:fofType)=> (x1 (in Xx)))))) as proof of ((((subset A) B)->False)->(not (((eq fofType) A) B))) % Found (fun (A:fofType) (B:fofType) (x0:(((subset A) B)->False)) (x1:(((eq fofType) A) B))=> (x0 (((x A) B) (fun (Xx:fofType)=> (x1 (in Xx)))))) as proof of (forall (B:fofType), ((((subset A) B)->False)->(not (((eq fofType) A) B)))) % Found (fun (x:subsetI1) (A:fofType) (B:fofType) (x0:(((subset A) B)->False)) (x1:(((eq fofType) A) B))=> (x0 (((x A) B) (fun (Xx:fofType)=> (x1 (in Xx)))))) as proof of (forall (A:fofType) (B:fofType), ((((subset A) B)->False)->(not (((eq fofType) A) B)))) % Found (fun (x:subsetI1) (A:fofType) (B:fofType) (x0:(((subset A) B)->False)) (x1:(((eq fofType) A) B))=> (x0 (((x A) B) (fun (Xx:fofType)=> (x1 (in Xx)))))) as proof of (subsetI1->(forall (A:fofType) (B:fofType), ((((subset A) B)->False)->(not (((eq fofType) A) B))))) % Got proof (fun (x:subsetI1) (A:fofType) (B:fofType) (x0:(((subset A) B)->False)) (x1:(((eq fofType) A) B))=> (x0 (((x A) B) (fun (Xx:fofType)=> (x1 (in Xx)))))) % Time elapsed = 0.356319s % node=49 cost=44.000000 depth=13 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:subsetI1) (A:fofType) (B:fofType) (x0:(((subset A) B)->False)) (x1:(((eq fofType) A) B))=> (x0 (((x A) B) (fun (Xx:fofType)=> (x1 (in Xx)))))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------