↑ Up

cocATP---0.2.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : NUM789^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 : n157.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 1.51s
% Output   : Proof 1.60s
% 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  : NUM789^1 : TPTP v7.0.0. Released v3.7.0.
% 0.00/0.04  % Command  : python CASC.py /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.03/0.23  % Computer : n157.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:20:05 CST 2018
% 0.03/0.23  % CPUTime  : 
% 0.03/0.25  Python 2.7.13
% 1.51/1.76  Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox2/benchmark/', '/export/starexec/sandbox2/benchmark/']
% 1.51/1.76  FOF formula (<kernel.Constant object at 0x2b0154d4f290>, <kernel.Type object at 0x2b0154d4f7e8>) of role type named rat_type
% 1.51/1.76  Using role type
% 1.51/1.76  Declaring rat:Type
% 1.51/1.76  FOF formula (<kernel.Constant object at 0x2b0154d4c830>, <kernel.Constant object at 0x2b0154d4f128>) of role type named x0
% 1.51/1.76  Using role type
% 1.51/1.76  Declaring x0:rat
% 1.51/1.76  FOF formula (<kernel.Constant object at 0x2b0154d4f4d0>, <kernel.Constant object at 0x2b0154d4f128>) of role type named y0
% 1.51/1.76  Using role type
% 1.51/1.76  Declaring y0:rat
% 1.51/1.76  FOF formula (<kernel.Constant object at 0x2b0154d4f290>, <kernel.DependentProduct object at 0x2b0155117290>) of role type named less
% 1.51/1.76  Using role type
% 1.51/1.76  Declaring less:(rat->(rat->Prop))
% 1.51/1.76  FOF formula ((less x0) y0) of role axiom named l
% 1.51/1.76  A new axiom: ((less x0) y0)
% 1.51/1.76  FOF formula (<kernel.Constant object at 0x2b0154d4f560>, <kernel.DependentProduct object at 0x2b01551170e0>) of role type named more
% 1.51/1.76  Using role type
% 1.51/1.76  Declaring more:(rat->(rat->Prop))
% 1.51/1.76  FOF formula (<kernel.Constant object at 0x2b0154d4f248>, <kernel.DependentProduct object at 0x2b0155117128>) of role type named is
% 1.51/1.76  Using role type
% 1.51/1.76  Declaring is:(rat->(rat->Prop))
% 1.51/1.76  FOF formula (forall (Xa:Prop), (((Xa->False)->False)->Xa)) of role axiom named et
% 1.51/1.76  A new axiom: (forall (Xa:Prop), (((Xa->False)->False)->Xa))
% 1.51/1.76  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
% 1.51/1.76  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))
% 1.51/1.76  FOF formula (((((more x0) y0)->False)->((is x0) y0))->False) of role conjecture named satz81h
% 1.51/1.76  Conjecture to prove = (((((more x0) y0)->False)->((is x0) y0))->False):Prop
% 1.51/1.76  We need to prove ['(((((more x0) y0)->False)->((is x0) y0))->False)']
% 1.51/1.76  Parameter rat:Type.
% 1.51/1.76  Parameter x0:rat.
% 1.51/1.76  Parameter y0:rat.
% 1.51/1.76  Parameter less:(rat->(rat->Prop)).
% 1.51/1.76  Axiom l:((less x0) y0).
% 1.51/1.76  Parameter more:(rat->(rat->Prop)).
% 1.51/1.76  Parameter is:(rat->(rat->Prop)).
% 1.51/1.76  Axiom et:(forall (Xa:Prop), (((Xa->False)->False)->Xa)).
% 1.51/1.76  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)).
% 1.51/1.76  Trying to prove (((((more x0) y0)->False)->((is x0) y0))->False)
% 1.51/1.76  Found l:((less x0) y0)
% 1.51/1.76  Instantiate: Xy0:=y0:rat;Xx0:=x0:rat
% 1.51/1.76  Found l as proof of ((less Xx0) Xy0)
% 1.51/1.76  Found l:((less x0) y0)
% 1.51/1.76  Instantiate: Xy0:=y0:rat;Xx0:=x0:rat
% 1.51/1.76  Found l as proof of ((less Xx0) Xy0)
% 1.51/1.76  Found x30:=(fun (x5:((more Xx0) Xy0))=> ((x3 x5) l)):(((more Xx0) Xy0)->False)
% 1.51/1.76  Found (fun (x5:((more Xx0) Xy0))=> ((x3 x5) l)) as proof of (((more x0) y0)->False)
% 1.51/1.76  Found (fun (x5:((more Xx0) Xy0))=> ((x3 x5) l)) as proof of (((more x0) y0)->False)
% 1.51/1.76  Found (x (fun (x5:((more Xx0) Xy0))=> ((x3 x5) l))) as proof of ((is Xx0) Xy0)
% 1.51/1.76  Found (x (fun (x5:((more Xx0) Xy0))=> ((x3 x5) l))) as proof of ((is Xx0) Xy0)
% 1.51/1.76  Found ((x4 l) (x (fun (x5:((more Xx0) Xy0))=> ((x3 x5) l)))) as proof of False
% 1.51/1.76  Found (fun (x4:(((less Xx0) Xy0)->(((is Xx0) Xy0)->False)))=> ((x4 l) (x (fun (x5:((more Xx0) Xy0))=> ((x3 x5) l))))) as proof of False
% 1.51/1.76  Found (fun (x3:(((more Xx0) Xy0)->(((less Xx0) Xy0)->False))) (x4:(((less Xx0) Xy0)->(((is Xx0) Xy0)->False)))=> ((x4 l) (x (fun (x5:((more Xx0) Xy0))=> ((x3 x5) l))))) as proof of ((((less Xx0) Xy0)->(((is Xx0) Xy0)->False))->False)
% 1.51/1.76  Found (fun (x3:(((more Xx0) Xy0)->(((less Xx0) Xy0)->False))) (x4:(((less Xx0) Xy0)->(((is Xx0) Xy0)->False)))=> ((x4 l) (x (fun (x5:((more Xx0) Xy0))=> ((x3 x5) l))))) as proof of ((((more Xx0) Xy0)->(((less Xx0) Xy0)->False))->((((less Xx0) Xy0)->(((is Xx0) Xy0)->False))->False))
% 1.51/1.76  Found (x2 (fun (x3:(((more Xx0) Xy0)->(((less Xx0) Xy0)->False))) (x4:(((less Xx0) Xy0)->(((is Xx0) Xy0)->False)))=> ((x4 l) (x (fun (x5:((more Xx0) Xy0))=> ((x3 x5) l)))))) as proof of False
% 1.51/1.76  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)))=> ((x4 l) (x (fun (x5:((more Xx0) Xy0))=> ((x3 x5) l))))))) as proof of False
% 1.51/1.76  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)))=> ((x4 l) (x (fun (x5:((more Xx0) Xy0))=> ((x3 x5) l))))))) as proof of ((((((more Xx0) Xy0)->(((less Xx0) Xy0)->False))->((((less Xx0) Xy0)->(((is Xx0) Xy0)->False))->False))->False)->False)
% 1.51/1.76  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)))=> ((x4 l) (x (fun (x5:((more Xx0) Xy0))=> ((x3 x5) l))))))) 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))
% 1.51/1.76  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)))=> ((x4 l) (x (fun (x5:((more Xx0) Xy0))=> ((x3 x5) l)))))))) as proof of False
% 1.51/1.76  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)))=> ((x4 l) (x (fun (x5:((more Xx0) y0))=> ((x3 x5) l)))))))) as proof of False
% 1.51/1.76  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)))=> ((x4 l) (x (fun (x5:((more x0) y0))=> ((x3 x5) l)))))))) as proof of False
% 1.51/1.76  Found (fun (x:((((more 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)))=> ((x4 l) (x (fun (x5:((more x0) y0))=> ((x3 x5) l))))))))) as proof of False
% 1.51/1.76  Found (fun (x:((((more 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)))=> ((x4 l) (x (fun (x5:((more x0) y0))=> ((x3 x5) l))))))))) as proof of (((((more x0) y0)->False)->((is x0) y0))->False)
% 1.51/1.76  Got proof (fun (x:((((more 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)))=> ((x4 l) (x (fun (x5:((more x0) y0))=> ((x3 x5) l)))))))))
% 1.51/1.76  Time elapsed = 1.233936s
% 1.51/1.76  node=400 cost=925.000000 depth=16
% 1.51/1.76::::::::::::::::::::::
% 1.51/1.76  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.51/1.76  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.51/1.76  (fun (x:((((more 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)))=> ((x4 l) (x (fun (x5:((more x0) y0))=> ((x3 x5) l)))))))))
% 1.60/1.78  % SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
%------------------------------------------------------------------------------