%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU606^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 : n089.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:35 EDT 2014 % Result : Theorem 0.50s % Output : Proof 0.50s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU606^2 : TPTP v6.1.0. Released v3.7.0. % % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % % Computer : n089.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:52:31 CDT 2014 % % CPUTime : 0.50 % 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 0x12ddcb0>, <kernel.DependentProduct object at 0x12dd830>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0x12db3f8>, <kernel.DependentProduct object at 0x12dd830>) of role type named setminus_type % Using role type % Declaring setminus:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x12db3f8>, <kernel.Sort object at 0xfc0bd8>) of role type named setminusERneg_type % Using role type % Declaring setminusERneg:Prop % FOF formula (((eq Prop) setminusERneg) (forall (A:fofType) (B:fofType) (Xx:fofType), ((((in Xx) ((setminus A) B))->False)->(((in Xx) A)->((in Xx) B))))) of role definition named setminusERneg % A new definition: (((eq Prop) setminusERneg) (forall (A:fofType) (B:fofType) (Xx:fofType), ((((in Xx) ((setminus A) B))->False)->(((in Xx) A)->((in Xx) B))))) % Defined: setminusERneg:=(forall (A:fofType) (B:fofType) (Xx:fofType), ((((in Xx) ((setminus A) B))->False)->(((in Xx) A)->((in Xx) B)))) % FOF formula (setminusERneg->(forall (A:fofType) (B:fofType) (Xx:fofType), ((((in Xx) ((setminus A) B))->False)->((((in Xx) B)->False)->(((in Xx) A)->False))))) of role conjecture named setminusELneg % Conjecture to prove = (setminusERneg->(forall (A:fofType) (B:fofType) (Xx:fofType), ((((in Xx) ((setminus A) B))->False)->((((in Xx) B)->False)->(((in Xx) A)->False))))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(setminusERneg->(forall (A:fofType) (B:fofType) (Xx:fofType), ((((in Xx) ((setminus A) B))->False)->((((in Xx) B)->False)->(((in Xx) A)->False)))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter setminus:(fofType->(fofType->fofType)). % Definition setminusERneg:=(forall (A:fofType) (B:fofType) (Xx:fofType), ((((in Xx) ((setminus A) B))->False)->(((in Xx) A)->((in Xx) B)))):Prop. % Trying to prove (setminusERneg->(forall (A:fofType) (B:fofType) (Xx:fofType), ((((in Xx) ((setminus A) B))->False)->((((in Xx) B)->False)->(((in Xx) A)->False))))) % Found x30000:=(x3000 x2):((in Xx) B) % Found (x3000 x2) as proof of ((in Xx) B) % Found ((x300 x0) x2) as proof of ((in Xx) B) % Found (((x30 A) x0) x2) as proof of ((in Xx) B) % Found ((((fun (A0:fofType)=> ((x3 A0) Xx)) A) x0) x2) as proof of ((in Xx) B) % Found ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2) as proof of ((in Xx) B) % Found ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2) as proof of ((in Xx) B) % Found (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2)) as proof of False % Found (fun (x2:((in Xx) A))=> (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2))) as proof of False % Found (fun (x1:(((in Xx) B)->False)) (x2:((in Xx) A))=> (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2))) as proof of (((in Xx) A)->False) % Found (fun (x0:(((in Xx) ((setminus A) B))->False)) (x1:(((in Xx) B)->False)) (x2:((in Xx) A))=> (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2))) as proof of ((((in Xx) B)->False)->(((in Xx) A)->False)) % Found (fun (Xx:fofType) (x0:(((in Xx) ((setminus A) B))->False)) (x1:(((in Xx) B)->False)) (x2:((in Xx) A))=> (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2))) as proof of ((((in Xx) ((setminus A) B))->False)->((((in Xx) B)->False)->(((in Xx) A)->False))) % Found (fun (B:fofType) (Xx:fofType) (x0:(((in Xx) ((setminus A) B))->False)) (x1:(((in Xx) B)->False)) (x2:((in Xx) A))=> (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2))) as proof of (forall (Xx:fofType), ((((in Xx) ((setminus A) B))->False)->((((in Xx) B)->False)->(((in Xx) A)->False)))) % Found (fun (A:fofType) (B:fofType) (Xx:fofType) (x0:(((in Xx) ((setminus A) B))->False)) (x1:(((in Xx) B)->False)) (x2:((in Xx) A))=> (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2))) as proof of (forall (B:fofType) (Xx:fofType), ((((in Xx) ((setminus A) B))->False)->((((in Xx) B)->False)->(((in Xx) A)->False)))) % Found (fun (x:setminusERneg) (A:fofType) (B:fofType) (Xx:fofType) (x0:(((in Xx) ((setminus A) B))->False)) (x1:(((in Xx) B)->False)) (x2:((in Xx) A))=> (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2))) as proof of (forall (A:fofType) (B:fofType) (Xx:fofType), ((((in Xx) ((setminus A) B))->False)->((((in Xx) B)->False)->(((in Xx) A)->False)))) % Found (fun (x:setminusERneg) (A:fofType) (B:fofType) (Xx:fofType) (x0:(((in Xx) ((setminus A) B))->False)) (x1:(((in Xx) B)->False)) (x2:((in Xx) A))=> (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2))) as proof of (setminusERneg->(forall (A:fofType) (B:fofType) (Xx:fofType), ((((in Xx) ((setminus A) B))->False)->((((in Xx) B)->False)->(((in Xx) A)->False))))) % Got proof (fun (x:setminusERneg) (A:fofType) (B:fofType) (Xx:fofType) (x0:(((in Xx) ((setminus A) B))->False)) (x1:(((in Xx) B)->False)) (x2:((in Xx) A))=> (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2))) % Time elapsed = 0.182636s % node=47 cost=537.000000 depth=14 % :::::::::::::::::::::: % % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % (fun (x:setminusERneg) (A:fofType) (B:fofType) (Xx:fofType) (x0:(((in Xx) ((setminus A) B))->False)) (x1:(((in Xx) B)->False)) (x2:((in Xx) A))=> (x1 ((((fun (A0:fofType)=> (((fun (A0:fofType)=> ((x A0) B)) A0) Xx)) A) x0) x2))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------