TSTP Solution File: NUM790^1 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : NUM790^1 : TPTP v7.0.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n131.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:45 EST 2018
% Result : Theorem 0.48s
% Output : Proof 0.48s
% 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 : NUM790^1 : TPTP v7.0.0. Released v3.7.0.
% 0.00/0.04 % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.03/0.23 % Computer : n131.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:17:49 CST 2018
% 0.03/0.23 % CPUTime :
% 0.08/0.25 Python 2.7.13
% 0.48/0.69 Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% 0.48/0.69 FOF formula (<kernel.Constant object at 0x2b8442df6560>, <kernel.Type object at 0x2b8442df6908>) of role type named rat_type
% 0.48/0.69 Using role type
% 0.48/0.69 Declaring rat:Type
% 0.48/0.69 FOF formula (<kernel.Constant object at 0x2b84434edf38>, <kernel.Constant object at 0x2b8442df6638>) of role type named x0
% 0.48/0.69 Using role type
% 0.48/0.69 Declaring x0:rat
% 0.48/0.69 FOF formula (<kernel.Constant object at 0x2b8442df6710>, <kernel.Constant object at 0x2b8442df6638>) of role type named y0
% 0.48/0.69 Using role type
% 0.48/0.69 Declaring y0:rat
% 0.48/0.69 FOF formula (<kernel.Constant object at 0x2b8442df6560>, <kernel.DependentProduct object at 0x2b8442a97950>) of role type named more
% 0.48/0.69 Using role type
% 0.48/0.69 Declaring more:(rat->(rat->Prop))
% 0.48/0.69 FOF formula (<kernel.Constant object at 0x2b8442df6e18>, <kernel.DependentProduct object at 0x2b8442a97f80>) of role type named is
% 0.48/0.69 Using role type
% 0.48/0.69 Declaring is:(rat->(rat->Prop))
% 0.48/0.69 FOF formula (((((more x0) y0)->False)->((is x0) y0))->False) of role axiom named n
% 0.48/0.69 A new axiom: (((((more x0) y0)->False)->((is x0) y0))->False)
% 0.48/0.69 FOF formula (<kernel.Constant object at 0x2b8442df6560>, <kernel.DependentProduct object at 0x2b8442a97950>) of role type named less
% 0.48/0.69 Using role type
% 0.48/0.69 Declaring less:(rat->(rat->Prop))
% 0.48/0.69 FOF formula (forall (Xx0:rat) (Xy0:rat), ((((is Xx0) Xy0)->False)->((((more Xx0) Xy0)->False)->((less Xx0) Xy0)))) of role axiom named satz81a
% 0.48/0.69 A new axiom: (forall (Xx0:rat) (Xy0:rat), ((((is Xx0) Xy0)->False)->((((more Xx0) Xy0)->False)->((less Xx0) Xy0))))
% 0.48/0.69 FOF formula (forall (Xa:Prop), (((Xa->False)->False)->Xa)) of role axiom named et
% 0.48/0.69 A new axiom: (forall (Xa:Prop), (((Xa->False)->False)->Xa))
% 0.48/0.69 FOF formula ((less x0) y0) of role conjecture named satz81j
% 0.48/0.69 Conjecture to prove = ((less x0) y0):Prop
% 0.48/0.69 We need to prove ['((less x0) y0)']
% 0.48/0.69 Parameter rat:Type.
% 0.48/0.69 Parameter x0:rat.
% 0.48/0.69 Parameter y0:rat.
% 0.48/0.69 Parameter more:(rat->(rat->Prop)).
% 0.48/0.69 Parameter is:(rat->(rat->Prop)).
% 0.48/0.69 Axiom n:(((((more x0) y0)->False)->((is x0) y0))->False).
% 0.48/0.69 Parameter less:(rat->(rat->Prop)).
% 0.48/0.69 Axiom satz81a:(forall (Xx0:rat) (Xy0:rat), ((((is Xx0) Xy0)->False)->((((more Xx0) Xy0)->False)->((less Xx0) Xy0)))).
% 0.48/0.69 Axiom et:(forall (Xa:Prop), (((Xa->False)->False)->Xa)).
% 0.48/0.69 Trying to prove ((less x0) y0)
% 0.48/0.69 Found x:((is x0) y0)
% 0.48/0.69 Found (fun (x1:(((more x0) y0)->False))=> x) as proof of ((is x0) y0)
% 0.48/0.69 Found (fun (x1:(((more x0) y0)->False))=> x) as proof of ((((more x0) y0)->False)->((is x0) y0))
% 0.48/0.69 Found (n (fun (x1:(((more x0) y0)->False))=> x)) as proof of False
% 0.48/0.69 Found (fun (x:((is x0) y0))=> (n (fun (x1:(((more x0) y0)->False))=> x))) as proof of False
% 0.48/0.69 Found (fun (x:((is x0) y0))=> (n (fun (x1:(((more x0) y0)->False))=> x))) as proof of (((is x0) y0)->False)
% 0.48/0.69 Found x10:=(x1 x):False
% 0.48/0.69 Found (x1 x) as proof of False
% 0.48/0.69 Found (fun (x2:(((is x0) y0)->False))=> (x1 x)) as proof of False
% 0.48/0.69 Found (fun (x2:(((is x0) y0)->False))=> (x1 x)) as proof of ((((is x0) y0)->False)->False)
% 0.48/0.69 Found (et0 (fun (x2:(((is x0) y0)->False))=> (x1 x))) as proof of ((is x0) y0)
% 0.48/0.69 Found ((et ((is x0) y0)) (fun (x2:(((is x0) y0)->False))=> (x1 x))) as proof of ((is x0) y0)
% 0.48/0.69 Found (fun (x1:(((more x0) y0)->False))=> ((et ((is x0) y0)) (fun (x2:(((is x0) y0)->False))=> (x1 x)))) as proof of ((is x0) y0)
% 0.48/0.69 Found (fun (x1:(((more x0) y0)->False))=> ((et ((is x0) y0)) (fun (x2:(((is x0) y0)->False))=> (x1 x)))) as proof of ((((more x0) y0)->False)->((is x0) y0))
% 0.48/0.69 Found (n (fun (x1:(((more x0) y0)->False))=> ((et ((is x0) y0)) (fun (x2:(((is x0) y0)->False))=> (x1 x))))) as proof of False
% 0.48/0.69 Found (fun (x:((more x0) y0))=> (n (fun (x1:(((more x0) y0)->False))=> ((et ((is x0) y0)) (fun (x2:(((is x0) y0)->False))=> (x1 x)))))) as proof of False
% 0.48/0.69 Found (fun (x:((more x0) y0))=> (n (fun (x1:(((more x0) y0)->False))=> ((et ((is x0) y0)) (fun (x2:(((is x0) y0)->False))=> (x1 x)))))) as proof of (((more x0) y0)->False)
% 0.48/0.69 Found ((satz81a00 (fun (x:((is x0) y0))=> (n (fun (x1:(((more x0) y0)->False))=> x)))) (fun (x:((more x0) y0))=> (n (fun (x1:(((more x0) y0)->False))=> ((et ((is x0) y0)) (fun (x2:(((is x0) y0)->False))=> (x1 x))))))) as proof of ((less x0) y0)
% 0.48/0.69 Found (((satz81a0 y0) (fun (x:((is x0) y0))=> (n (fun (x1:(((more x0) y0)->False))=> x)))) (fun (x:((more x0) y0))=> (n (fun (x1:(((more x0) y0)->False))=> ((et ((is x0) y0)) (fun (x2:(((is x0) y0)->False))=> (x1 x))))))) as proof of ((less x0) y0)
% 0.48/0.69 Found ((((satz81a x0) y0) (fun (x:((is x0) y0))=> (n (fun (x1:(((more x0) y0)->False))=> x)))) (fun (x:((more x0) y0))=> (n (fun (x1:(((more x0) y0)->False))=> ((et ((is x0) y0)) (fun (x2:(((is x0) y0)->False))=> (x1 x))))))) as proof of ((less x0) y0)
% 0.48/0.69 Found ((((satz81a x0) y0) (fun (x:((is x0) y0))=> (n (fun (x1:(((more x0) y0)->False))=> x)))) (fun (x:((more x0) y0))=> (n (fun (x1:(((more x0) y0)->False))=> ((et ((is x0) y0)) (fun (x2:(((is x0) y0)->False))=> (x1 x))))))) as proof of ((less x0) y0)
% 0.48/0.69 Got proof ((((satz81a x0) y0) (fun (x:((is x0) y0))=> (n (fun (x1:(((more x0) y0)->False))=> x)))) (fun (x:((more x0) y0))=> (n (fun (x1:(((more x0) y0)->False))=> ((et ((is x0) y0)) (fun (x2:(((is x0) y0)->False))=> (x1 x)))))))
% 0.48/0.69 Time elapsed = 0.166056s
% 0.48/0.69 node=69 cost=171.000000 depth=13
% 0.48/0.69::::::::::::::::::::::
% 0.48/0.69 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.69 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.69 ((((satz81a x0) y0) (fun (x:((is x0) y0))=> (n (fun (x1:(((more x0) y0)->False))=> x)))) (fun (x:((more x0) y0))=> (n (fun (x1:(((more x0) y0)->False))=> ((et ((is x0) y0)) (fun (x2:(((is x0) y0)->False))=> (x1 x)))))))
% 0.48/0.69 % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
%------------------------------------------------------------------------------