TSTP Solution File: NUM787^1 by cocATP---0.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : NUM787^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 : n177.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 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  : NUM787^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 : n177.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:16:35 CST 2018
% 0.03/0.23  % CPUTime  : 
% 0.07/0.25  Python 2.7.13
% 0.48/0.67  Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% 0.48/0.67  FOF formula (<kernel.Constant object at 0x2b8c9e2163f8>, <kernel.Type object at 0x2b8c9e2164d0>) of role type named rat_type
% 0.48/0.67  Using role type
% 0.48/0.67  Declaring rat:Type
% 0.48/0.67  FOF formula (<kernel.Constant object at 0x2b8c9d7a0a70>, <kernel.Constant object at 0x2b8c9e216830>) of role type named x0
% 0.48/0.67  Using role type
% 0.48/0.67  Declaring x0:rat
% 0.48/0.67  FOF formula (<kernel.Constant object at 0x2b8c9d7a0a70>, <kernel.Constant object at 0x2b8c9e216830>) of role type named y0
% 0.48/0.67  Using role type
% 0.48/0.67  Declaring y0:rat
% 0.48/0.67  FOF formula (<kernel.Constant object at 0x2b8c9e2163f8>, <kernel.DependentProduct object at 0x2b8c9e216560>) of role type named less
% 0.48/0.67  Using role type
% 0.48/0.67  Declaring less:(rat->(rat->Prop))
% 0.48/0.67  FOF formula (((less x0) y0)->False) of role axiom named n
% 0.48/0.67  A new axiom: (((less x0) y0)->False)
% 0.48/0.67  FOF formula (<kernel.Constant object at 0x2b8c9e216128>, <kernel.DependentProduct object at 0x2b8c9e216b48>) of role type named more
% 0.48/0.67  Using role type
% 0.48/0.67  Declaring more:(rat->(rat->Prop))
% 0.48/0.67  FOF formula (<kernel.Constant object at 0x2b8c9e2160e0>, <kernel.DependentProduct object at 0x2b8c9e216dd0>) of role type named is
% 0.48/0.67  Using role type
% 0.48/0.67  Declaring is:(rat->(rat->Prop))
% 0.48/0.67  FOF formula (forall (Xa:Prop), (((Xa->False)->False)->Xa)) of role axiom named et
% 0.48/0.67  A new axiom: (forall (Xa:Prop), (((Xa->False)->False)->Xa))
% 0.48/0.67  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.67  A new axiom: (forall (Xx0:rat) (Xy0:rat), ((((is Xx0) Xy0)->False)->((((more Xx0) Xy0)->False)->((less Xx0) Xy0))))
% 0.48/0.67  FOF formula ((((more x0) y0)->False)->((is x0) y0)) of role conjecture named satz81f
% 0.48/0.67  Conjecture to prove = ((((more x0) y0)->False)->((is x0) y0)):Prop
% 0.48/0.67  We need to prove ['((((more x0) y0)->False)->((is x0) y0))']
% 0.48/0.67  Parameter rat:Type.
% 0.48/0.67  Parameter x0:rat.
% 0.48/0.67  Parameter y0:rat.
% 0.48/0.67  Parameter less:(rat->(rat->Prop)).
% 0.48/0.67  Axiom n:(((less x0) y0)->False).
% 0.48/0.67  Parameter more:(rat->(rat->Prop)).
% 0.48/0.67  Parameter is:(rat->(rat->Prop)).
% 0.48/0.67  Axiom et:(forall (Xa:Prop), (((Xa->False)->False)->Xa)).
% 0.48/0.67  Axiom satz81a:(forall (Xx0:rat) (Xy0:rat), ((((is Xx0) Xy0)->False)->((((more Xx0) Xy0)->False)->((less Xx0) Xy0)))).
% 0.48/0.67  Trying to prove ((((more x0) y0)->False)->((is x0) y0))
% 0.48/0.67  Found satz81a0000:=(satz81a000 x):((less x0) y0)
% 0.48/0.67  Found (satz81a000 x) as proof of ((less x0) y0)
% 0.48/0.67  Found ((satz81a00 x1) x) as proof of ((less x0) y0)
% 0.48/0.67  Found (((satz81a0 y0) x1) x) as proof of ((less x0) y0)
% 0.48/0.67  Found ((((satz81a x0) y0) x1) x) as proof of ((less x0) y0)
% 0.48/0.67  Found ((((satz81a x0) y0) x1) x) as proof of ((less x0) y0)
% 0.48/0.67  Found (n ((((satz81a x0) y0) x1) x)) as proof of False
% 0.48/0.67  Found (fun (x1:(((is x0) y0)->False))=> (n ((((satz81a x0) y0) x1) x))) as proof of False
% 0.48/0.67  Found (fun (x1:(((is x0) y0)->False))=> (n ((((satz81a x0) y0) x1) x))) as proof of ((((is x0) y0)->False)->False)
% 0.48/0.67  Found (et0 (fun (x1:(((is x0) y0)->False))=> (n ((((satz81a x0) y0) x1) x)))) as proof of ((is x0) y0)
% 0.48/0.67  Found ((et ((is x0) y0)) (fun (x1:(((is x0) y0)->False))=> (n ((((satz81a x0) y0) x1) x)))) as proof of ((is x0) y0)
% 0.48/0.67  Found (fun (x:(((more x0) y0)->False))=> ((et ((is x0) y0)) (fun (x1:(((is x0) y0)->False))=> (n ((((satz81a x0) y0) x1) x))))) as proof of ((is x0) y0)
% 0.48/0.67  Found (fun (x:(((more x0) y0)->False))=> ((et ((is x0) y0)) (fun (x1:(((is x0) y0)->False))=> (n ((((satz81a x0) y0) x1) x))))) as proof of ((((more x0) y0)->False)->((is x0) y0))
% 0.48/0.67  Got proof (fun (x:(((more x0) y0)->False))=> ((et ((is x0) y0)) (fun (x1:(((is x0) y0)->False))=> (n ((((satz81a x0) y0) x1) x)))))
% 0.48/0.67  Time elapsed = 0.146630s
% 0.48/0.67  node=55 cost=156.000000 depth=11
% 0.48/0.67::::::::::::::::::::::
% 0.48/0.67  % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.67  % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.48/0.67  (fun (x:(((more x0) y0)->False))=> ((et ((is x0) y0)) (fun (x1:(((is x0) y0)->False))=> (n ((((satz81a x0) y0) x1) x)))))
% 0.48/0.67  % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
%------------------------------------------------------------------------------