%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SEU607^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.42s % Output : Proof 0.42s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----ERROR: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % % Problem : SEU607^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:41 CDT 2014 % % CPUTime : 0.42 % 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 0x9b4dd0>, <kernel.DependentProduct object at 0x9b4bd8>) of role type named in_type % Using role type % Declaring in:(fofType->(fofType->Prop)) % FOF formula (<kernel.Constant object at 0xb923f8>, <kernel.DependentProduct object at 0x9b4bd8>) of role type named setminus_type % Using role type % Declaring setminus:(fofType->(fofType->fofType)) % FOF formula (<kernel.Constant object at 0x9b4878>, <kernel.Sort object at 0x894bd8>) of role type named setminusEL_type % Using role type % Declaring setminusEL:Prop % FOF formula (((eq Prop) setminusEL) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->((in Xx) A)))) of role definition named setminusEL % A new definition: (((eq Prop) setminusEL) (forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->((in Xx) A)))) % Defined: setminusEL:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->((in Xx) A))) % FOF formula (setminusEL->(forall (A:fofType) (B:fofType) (Xx:fofType), ((((in Xx) A)->False)->(((in Xx) ((setminus A) B))->False)))) of role conjecture named setminusILneg % Conjecture to prove = (setminusEL->(forall (A:fofType) (B:fofType) (Xx:fofType), ((((in Xx) A)->False)->(((in Xx) ((setminus A) B))->False)))):Prop % Parameter fofType_DUMMY:fofType. % We need to prove ['(setminusEL->(forall (A:fofType) (B:fofType) (Xx:fofType), ((((in Xx) A)->False)->(((in Xx) ((setminus A) B))->False))))'] % Parameter fofType:Type. % Parameter in:(fofType->(fofType->Prop)). % Parameter setminus:(fofType->(fofType->fofType)). % Definition setminusEL:=(forall (A:fofType) (B:fofType) (Xx:fofType), (((in Xx) ((setminus A) B))->((in Xx) A))):Prop. % Trying to prove (setminusEL->(forall (A:fofType) (B:fofType) (Xx:fofType), ((((in Xx) A)->False)->(((in Xx) ((setminus A) B))->False)))) % Found x2000:=(x200 x1):((in Xx) A) % Found (x200 x1) as proof of ((in Xx) A) % Found ((x20 B) x1) as proof of ((in Xx) A) % Found (((fun (B0:fofType)=> ((x2 B0) Xx)) B) x1) as proof of ((in Xx) A) % Found (((fun (B0:fofType)=> (((x A) B0) Xx)) B) x1) as proof of ((in Xx) A) % Found (((fun (B0:fofType)=> (((x A) B0) Xx)) B) x1) as proof of ((in Xx) A) % Found (x0 (((fun (B0:fofType)=> (((x A) B0) Xx)) B) x1)) as proof of False % Found (fun (x1:((in Xx) ((setminus A) B)))=> (x0 (((fun (B0:fofType)=> (((x A) B0) Xx)) B) x1))) as proof of False % Found (fun (x0:(((in Xx) A)->False)) (x1:((in Xx) ((setminus A) B)))=> (x0 (((fun (B0:fofType)=> (((x A) B0) Xx)) B) x1))) as proof of (((in Xx) ((setminus A) B))->False) % Found (fun (Xx:fofType) (x0:(((in Xx) A)->False)) (x1:((in Xx) ((setminus A) B)))=> (x0 (((fun (B0:fofType)=> (((x A) B0) Xx)) B) x1))) as proof of ((((in Xx) A)->False)->(((in Xx) ((setminus A) B))->False)) % Found (fun (B:fofType) (Xx:fofType) (x0:(((in Xx) A)->False)) (x1:((in Xx) ((setminus A) B)))=> (x0 (((fun (B0:fofType)=> (((x A) B0) Xx)) B) x1))) as proof of (forall (Xx:fofType), ((((in Xx) A)->False)->(((in Xx) ((setminus A) B))->False))) % Found (fun (A:fofType) (B:fofType) (Xx:fofType) (x0:(((in Xx) A)->False)) (x1:((in Xx) ((setminus A) B)))=> (x0 (((fun (B0:fofType)=> (((x A) B0) Xx)) B) x1))) as proof of (forall (B:fofType) (Xx:fofType), ((((in Xx) A)->False)->(((in Xx) ((setminus A) B))->False))) % Found (fun (x:setminusEL) (A:fofType) (B:fofType) (Xx:fofType) (x0:(((in Xx) A)->False)) (x1:((in Xx) ((setminus A) B)))=> (x0 (((fun (B0:fofType)=> (((x A) B0) Xx)) B) x1))) as proof of (forall (A:fofType) (B:fofType) (Xx:fofType), ((((in Xx) A)->False)->(((in Xx) ((setminus A) B))->False))) % Found (fun (x:setminusEL) (A:fofType) (B:fofType) (Xx:fofType) (x0:(((in Xx) A)->False)) (x1:((in Xx) ((setminus A) B)))=> (x0 (((fun (B0:fofType)=> (((x A) B0) Xx)) B) x1))) as proof of (setminusEL->(forall (A:fofType) (B:fofType) (Xx:fofType), ((((in Xx) A)->False)->(((in Xx) ((setminus A) B))->False)))) % Got proof (fun (x:setminusEL) (A:fofType) (B:fofType) (Xx:fofType) (x0:(((in Xx) A)->False)) (x1:((in Xx) ((setminus A) B)))=> (x0 (((fun (B0:fofType)=> (((x A) B0) Xx)) B) x1))) % Time elapsed = 0.101432s % node=26 cost=411.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:setminusEL) (A:fofType) (B:fofType) (Xx:fofType) (x0:(((in Xx) A)->False)) (x1:((in Xx) ((setminus A) B)))=> (x0 (((fun (B0:fofType)=> (((x A) B0) Xx)) B) x1))) % % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % EOF %------------------------------------------------------------------------------