%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : NUM788^1 : TPTP v7.0.0. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : python CASC.py /export/starexec/sandbox2/benchmark/theBenchmark.p % Computer : n031.star.cs.uiowa.edu % Model : x86_64 x86_64 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 2.40GHz % Memory : 32218.625MB % OS : Linux 3.10.0-693.2.2.el7.x86_64 % CPULimit : 300s % DateTime : Mon Jan 8 13:11:44 EST 2018 % Result : Theorem 2.21s % Output : Proof 2.21s % Verified : % SZS Type : None (Parsing solution fails) % Syntax : Number of formulae : 0 % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.03 % Problem : NUM788^1 : TPTP v7.0.0. Released v3.7.0. % 0.00/0.03 % Command : python CASC.py /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.03/0.23 % Computer : n031.star.cs.uiowa.edu % 0.03/0.23 % Model : x86_64 x86_64 % 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz % 0.03/0.23 % Memory : 32218.625MB % 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 % 0.03/0.23 % CPULimit : 300 % 0.03/0.23 % DateTime : Fri Jan 5 14:14:34 CST 2018 % 0.03/0.23 % CPUTime : % 0.08/0.25 Python 2.7.13 % 2.18/2.38 Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox2/benchmark/', '/export/starexec/sandbox2/benchmark/'] % 2.18/2.38 FOF formula (<kernel.Constant object at 0x2b44a5775128>, <kernel.Type object at 0x2b44a5852128>) of role type named rat_type % 2.18/2.38 Using role type % 2.18/2.38 Declaring rat:Type % 2.18/2.38 FOF formula (<kernel.Constant object at 0x2b44a584f680>, <kernel.Constant object at 0x2b44a5852518>) of role type named x0 % 2.18/2.38 Using role type % 2.18/2.38 Declaring x0:rat % 2.18/2.38 FOF formula (<kernel.Constant object at 0x2b44a5775128>, <kernel.Constant object at 0x2b44a5852518>) of role type named y0 % 2.18/2.38 Using role type % 2.18/2.38 Declaring y0:rat % 2.18/2.38 FOF formula (<kernel.Constant object at 0x2b44a5775128>, <kernel.DependentProduct object at 0x2b44a5b3df80>) of role type named more % 2.18/2.38 Using role type % 2.18/2.38 Declaring more:(rat->(rat->Prop)) % 2.18/2.38 FOF formula ((more x0) y0) of role axiom named m % 2.18/2.38 A new axiom: ((more x0) y0) % 2.18/2.38 FOF formula (<kernel.Constant object at 0x2b44a5852440>, <kernel.DependentProduct object at 0x2b44a5b3dcb0>) of role type named less % 2.18/2.38 Using role type % 2.18/2.38 Declaring less:(rat->(rat->Prop)) % 2.18/2.38 FOF formula (<kernel.Constant object at 0x2b44a5852290>, <kernel.DependentProduct object at 0x2b44a5b3db00>) of role type named is % 2.18/2.38 Using role type % 2.18/2.38 Declaring is:(rat->(rat->Prop)) % 2.18/2.38 FOF formula (forall (Xa:Prop), (((Xa->False)->False)->Xa)) of role axiom named et % 2.18/2.38 A new axiom: (forall (Xa:Prop), (((Xa->False)->False)->Xa)) % 2.18/2.38 FOF formula (forall (Xx0:rat) (Xy0:rat), (((((is Xx0) Xy0)->(((more Xx0) Xy0)->False))->((((((more Xx0) Xy0)->(((less Xx0) Xy0)->False))->((((less Xx0) Xy0)->(((is Xx0) Xy0)->False))->False))->False)->False))->False)) of role axiom named satz81b % 2.18/2.38 A new axiom: (forall (Xx0:rat) (Xy0:rat), (((((is Xx0) Xy0)->(((more Xx0) Xy0)->False))->((((((more Xx0) Xy0)->(((less Xx0) Xy0)->False))->((((less Xx0) Xy0)->(((is Xx0) Xy0)->False))->False))->False)->False))->False)) % 2.18/2.38 FOF formula (((((less x0) y0)->False)->((is x0) y0))->False) of role conjecture named satz81g % 2.18/2.38 Conjecture to prove = (((((less x0) y0)->False)->((is x0) y0))->False):Prop % 2.18/2.38 We need to prove ['(((((less x0) y0)->False)->((is x0) y0))->False)'] % 2.18/2.38 Parameter rat:Type. % 2.18/2.38 Parameter x0:rat. % 2.18/2.38 Parameter y0:rat. % 2.18/2.38 Parameter more:(rat->(rat->Prop)). % 2.18/2.38 Axiom m:((more x0) y0). % 2.18/2.38 Parameter less:(rat->(rat->Prop)). % 2.18/2.38 Parameter is:(rat->(rat->Prop)). % 2.18/2.38 Axiom et:(forall (Xa:Prop), (((Xa->False)->False)->Xa)). % 2.18/2.38 Axiom satz81b:(forall (Xx0:rat) (Xy0:rat), (((((is Xx0) Xy0)->(((more Xx0) Xy0)->False))->((((((more Xx0) Xy0)->(((less Xx0) Xy0)->False))->((((less Xx0) Xy0)->(((is Xx0) Xy0)->False))->False))->False)->False))->False)). % 2.18/2.38 Trying to prove (((((less x0) y0)->False)->((is x0) y0))->False) % 2.18/2.38 Found m:((more x0) y0) % 2.18/2.38 Instantiate: Xy0:=y0:rat;Xx0:=x0:rat % 2.18/2.38 Found m as proof of ((more Xx0) Xy0) % 2.18/2.38 Found m:((more x0) y0) % 2.18/2.38 Instantiate: Xy0:=y0:rat;Xx0:=x0:rat % 2.18/2.38 Found m as proof of ((more Xx0) Xy0) % 2.18/2.38 Found m:((more x0) y0) % 2.18/2.38 Instantiate: Xy0:=y0:rat;Xx0:=x0:rat % 2.18/2.38 Found m as proof of ((more Xx0) Xy0) % 2.18/2.38 Found m:((more x0) y0) % 2.18/2.38 Instantiate: Xy0:=y0:rat;Xx0:=x0:rat % 2.18/2.38 Found m as proof of ((more Xx0) Xy0) % 2.18/2.38 Found m:((more x0) y0) % 2.18/2.38 Instantiate: Xy0:=y0:rat;Xx0:=x0:rat % 2.18/2.38 Found m as proof of ((more Xx0) Xy0) % 2.18/2.38 Found m:((more x0) y0) % 2.18/2.38 Instantiate: Xy0:=y0:rat;Xx0:=x0:rat % 2.18/2.38 Found m as proof of ((more Xx0) Xy0) % 2.18/2.38 Found m:((more x0) y0) % 2.18/2.38 Instantiate: Xy0:=y0:rat;Xx0:=x0:rat % 2.18/2.38 Found m as proof of ((more Xx0) Xy0) % 2.18/2.38 Found x30:=(x3 m):(((less Xx0) Xy0)->False) % 2.18/2.38 Found (x3 m) as proof of (((less x0) y0)->False) % 2.18/2.38 Found (x3 m) as proof of (((less x0) y0)->False) % 2.18/2.38 Found (x (x3 m)) as proof of ((is Xx0) Xy0) % 2.18/2.38 Found (x (x3 m)) as proof of ((is Xx0) Xy0) % 2.18/2.38 Found ((x1 (x (x3 m))) m) as proof of False % 2.18/2.38 Found (fun (x4:(((less Xx0) Xy0)->(((is Xx0) Xy0)->False)))=> ((x1 (x (x3 m))) m)) as proof of False % 2.18/2.38 Found (fun (x3:(((more Xx0) Xy0)->(((less Xx0) Xy0)->False))) (x4:(((less Xx0) Xy0)->(((is Xx0) Xy0)->False)))=> ((x1 (x (x3 m))) m)) as proof of ((((less Xx0) Xy0)->(((is Xx0) Xy0)->False))->False) % 2.18/2.38 Found (fun (x3:(((more Xx0) Xy0)->(((less Xx0) Xy0)->False))) (x4:(((less Xx0) Xy0)->(((is Xx0) Xy0)->False)))=> ((x1 (x (x3 m))) m)) as proof of ((((more Xx0) Xy0)->(((less Xx0) Xy0)->False))->((((less Xx0) Xy0)->(((is Xx0) Xy0)->False))->False)) % 2.21/2.40 Found (x2 (fun (x3:(((more Xx0) Xy0)->(((less Xx0) Xy0)->False))) (x4:(((less Xx0) Xy0)->(((is Xx0) Xy0)->False)))=> ((x1 (x (x3 m))) m))) as proof of False % 2.21/2.40 Found (fun (x2:(((((more Xx0) Xy0)->(((less Xx0) Xy0)->False))->((((less Xx0) Xy0)->(((is Xx0) Xy0)->False))->False))->False))=> (x2 (fun (x3:(((more Xx0) Xy0)->(((less Xx0) Xy0)->False))) (x4:(((less Xx0) Xy0)->(((is Xx0) Xy0)->False)))=> ((x1 (x (x3 m))) m)))) as proof of False % 2.21/2.40 Found (fun (x1:(((is Xx0) Xy0)->(((more Xx0) Xy0)->False))) (x2:(((((more Xx0) Xy0)->(((less Xx0) Xy0)->False))->((((less Xx0) Xy0)->(((is Xx0) Xy0)->False))->False))->False))=> (x2 (fun (x3:(((more Xx0) Xy0)->(((less Xx0) Xy0)->False))) (x4:(((less Xx0) Xy0)->(((is Xx0) Xy0)->False)))=> ((x1 (x (x3 m))) m)))) as proof of ((((((more Xx0) Xy0)->(((less Xx0) Xy0)->False))->((((less Xx0) Xy0)->(((is Xx0) Xy0)->False))->False))->False)->False) % 2.21/2.40 Found (fun (x1:(((is Xx0) Xy0)->(((more Xx0) Xy0)->False))) (x2:(((((more Xx0) Xy0)->(((less Xx0) Xy0)->False))->((((less Xx0) Xy0)->(((is Xx0) Xy0)->False))->False))->False))=> (x2 (fun (x3:(((more Xx0) Xy0)->(((less Xx0) Xy0)->False))) (x4:(((less Xx0) Xy0)->(((is Xx0) Xy0)->False)))=> ((x1 (x (x3 m))) m)))) as proof of ((((is Xx0) Xy0)->(((more Xx0) Xy0)->False))->((((((more Xx0) Xy0)->(((less Xx0) Xy0)->False))->((((less Xx0) Xy0)->(((is Xx0) Xy0)->False))->False))->False)->False)) % 2.21/2.40 Found (satz81b00 (fun (x1:(((is Xx0) Xy0)->(((more Xx0) Xy0)->False))) (x2:(((((more Xx0) Xy0)->(((less Xx0) Xy0)->False))->((((less Xx0) Xy0)->(((is Xx0) Xy0)->False))->False))->False))=> (x2 (fun (x3:(((more Xx0) Xy0)->(((less Xx0) Xy0)->False))) (x4:(((less Xx0) Xy0)->(((is Xx0) Xy0)->False)))=> ((x1 (x (x3 m))) m))))) as proof of False % 2.21/2.40 Found ((satz81b0 y0) (fun (x1:(((is Xx0) y0)->(((more Xx0) y0)->False))) (x2:(((((more Xx0) y0)->(((less Xx0) y0)->False))->((((less Xx0) y0)->(((is Xx0) y0)->False))->False))->False))=> (x2 (fun (x3:(((more Xx0) y0)->(((less Xx0) y0)->False))) (x4:(((less Xx0) y0)->(((is Xx0) y0)->False)))=> ((x1 (x (x3 m))) m))))) as proof of False % 2.21/2.40 Found (((satz81b x0) y0) (fun (x1:(((is x0) y0)->(((more x0) y0)->False))) (x2:(((((more x0) y0)->(((less x0) y0)->False))->((((less x0) y0)->(((is x0) y0)->False))->False))->False))=> (x2 (fun (x3:(((more x0) y0)->(((less x0) y0)->False))) (x4:(((less x0) y0)->(((is x0) y0)->False)))=> ((x1 (x (x3 m))) m))))) as proof of False % 2.21/2.40 Found (fun (x:((((less x0) y0)->False)->((is x0) y0)))=> (((satz81b x0) y0) (fun (x1:(((is x0) y0)->(((more x0) y0)->False))) (x2:(((((more x0) y0)->(((less x0) y0)->False))->((((less x0) y0)->(((is x0) y0)->False))->False))->False))=> (x2 (fun (x3:(((more x0) y0)->(((less x0) y0)->False))) (x4:(((less x0) y0)->(((is x0) y0)->False)))=> ((x1 (x (x3 m))) m)))))) as proof of False % 2.21/2.40 Found (fun (x:((((less x0) y0)->False)->((is x0) y0)))=> (((satz81b x0) y0) (fun (x1:(((is x0) y0)->(((more x0) y0)->False))) (x2:(((((more x0) y0)->(((less x0) y0)->False))->((((less x0) y0)->(((is x0) y0)->False))->False))->False))=> (x2 (fun (x3:(((more x0) y0)->(((less x0) y0)->False))) (x4:(((less x0) y0)->(((is x0) y0)->False)))=> ((x1 (x (x3 m))) m)))))) as proof of (((((less x0) y0)->False)->((is x0) y0))->False) % 2.21/2.40 Got proof (fun (x:((((less x0) y0)->False)->((is x0) y0)))=> (((satz81b x0) y0) (fun (x1:(((is x0) y0)->(((more x0) y0)->False))) (x2:(((((more x0) y0)->(((less x0) y0)->False))->((((less x0) y0)->(((is x0) y0)->False))->False))->False))=> (x2 (fun (x3:(((more x0) y0)->(((less x0) y0)->False))) (x4:(((less x0) y0)->(((is x0) y0)->False)))=> ((x1 (x (x3 m))) m)))))) % 2.21/2.40 Time elapsed = 1.874990s % 2.21/2.40 node=517 cost=928.000000 depth=16 % 2.21/2.40:::::::::::::::::::::: % 2.21/2.40 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.21/2.40 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p % 2.21/2.40 (fun (x:((((less x0) y0)->False)->((is x0) y0)))=> (((satz81b x0) y0) (fun (x1:(((is x0) y0)->(((more x0) y0)->False))) (x2:(((((more x0) y0)->(((less x0) y0)->False))->((((less x0) y0)->(((is x0) y0)->False))->False))->False))=> (x2 (fun (x3:(((more x0) y0)->(((less x0) y0)->False))) (x4:(((less x0) y0)->(((is x0) y0)->False)))=> ((x1 (x (x3 m))) m)))))) % 2.21/2.43 % SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p %------------------------------------------------------------------------------