↑ Up

cocATP---0.2.0.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : NUM658^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 : n063.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:20 EST 2018

% Result   : Theorem 1.28s
% Output   : Proof 1.28s
% 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  : NUM658^1 : TPTP v7.0.0. Released v3.7.0.
% 0.00/0.04  % Command  : python CASC.py /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.23  % Computer : n063.star.cs.uiowa.edu
% 0.02/0.23  % Model    : x86_64 x86_64
% 0.02/0.23  % CPU      : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.23  % Memory   : 32218.625MB
% 0.02/0.23  % OS       : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.23  % CPULimit : 300
% 0.02/0.23  % DateTime : Fri Jan  5 11:43:00 CST 2018
% 0.02/0.23  % CPUTime  : 
% 0.06/0.25  Python 2.7.13
% 1.28/1.49  Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox2/benchmark/', '/export/starexec/sandbox2/benchmark/']
% 1.28/1.49  FOF formula (<kernel.Constant object at 0x2b6613056830>, <kernel.Type object at 0x2b66130567e8>) of role type named nat_type
% 1.28/1.49  Using role type
% 1.28/1.49  Declaring nat:Type
% 1.28/1.49  FOF formula (<kernel.Constant object at 0x2b6613107128>, <kernel.Constant object at 0x2b6613056e60>) of role type named x
% 1.28/1.49  Using role type
% 1.28/1.49  Declaring x:nat
% 1.28/1.49  FOF formula (<kernel.Constant object at 0x2b66130567a0>, <kernel.Constant object at 0x2b6613056830>) of role type named y
% 1.28/1.49  Using role type
% 1.28/1.49  Declaring y:nat
% 1.28/1.49  FOF formula (<kernel.Constant object at 0x2b6613056b00>, <kernel.DependentProduct object at 0x2b6612c87cb0>) of role type named more
% 1.28/1.49  Using role type
% 1.28/1.49  Declaring more:(nat->(nat->Prop))
% 1.28/1.49  FOF formula (((((more x) y)->False)->(((eq nat) x) y))->False) of role axiom named n
% 1.28/1.49  A new axiom: (((((more x) y)->False)->(((eq nat) x) y))->False)
% 1.28/1.49  FOF formula (<kernel.Constant object at 0x2b6613056830>, <kernel.DependentProduct object at 0x2b6612c87680>) of role type named less
% 1.28/1.49  Using role type
% 1.28/1.49  Declaring less:(nat->(nat->Prop))
% 1.28/1.49  FOF formula (forall (Xx:nat) (Xy:nat), ((not (((eq nat) Xx) Xy))->((((more Xx) Xy)->False)->((less Xx) Xy)))) of role axiom named satz10a
% 1.28/1.49  A new axiom: (forall (Xx:nat) (Xy:nat), ((not (((eq nat) Xx) Xy))->((((more Xx) Xy)->False)->((less Xx) Xy))))
% 1.28/1.49  FOF formula (forall (Xa:Prop), (((Xa->False)->False)->Xa)) of role axiom named et
% 1.28/1.49  A new axiom: (forall (Xa:Prop), (((Xa->False)->False)->Xa))
% 1.28/1.49  FOF formula ((less x) y) of role conjecture named satz10j
% 1.28/1.49  Conjecture to prove = ((less x) y):Prop
% 1.28/1.49  We need to prove ['((less x) y)']
% 1.28/1.49  Parameter nat:Type.
% 1.28/1.49  Parameter x:nat.
% 1.28/1.49  Parameter y:nat.
% 1.28/1.49  Parameter more:(nat->(nat->Prop)).
% 1.28/1.49  Axiom n:(((((more x) y)->False)->(((eq nat) x) y))->False).
% 1.28/1.49  Parameter less:(nat->(nat->Prop)).
% 1.28/1.49  Axiom satz10a:(forall (Xx:nat) (Xy:nat), ((not (((eq nat) Xx) Xy))->((((more Xx) Xy)->False)->((less Xx) Xy)))).
% 1.28/1.49  Axiom et:(forall (Xa:Prop), (((Xa->False)->False)->Xa)).
% 1.28/1.49  Trying to prove ((less x) y)
% 1.28/1.49  Found x0:(((eq nat) x) y)
% 1.28/1.49  Found (fun (x00:(((more x) y)->False))=> x0) as proof of (((eq nat) x) y)
% 1.28/1.49  Found (fun (x00:(((more x) y)->False))=> x0) as proof of ((((more x) y)->False)->(((eq nat) x) y))
% 1.28/1.49  Found (n (fun (x00:(((more x) y)->False))=> x0)) as proof of False
% 1.28/1.49  Found (fun (x0:(((eq nat) x) y))=> (n (fun (x00:(((more x) y)->False))=> x0))) as proof of False
% 1.28/1.49  Found (fun (x0:(((eq nat) x) y))=> (n (fun (x00:(((more x) y)->False))=> x0))) as proof of (not (((eq nat) x) y))
% 1.28/1.49  Found x000:=(x00 x0):False
% 1.28/1.49  Found (x00 x0) as proof of False
% 1.28/1.49  Found (fun (x01:((((eq nat) x) y)->False))=> (x00 x0)) as proof of False
% 1.28/1.49  Found (fun (x01:((((eq nat) x) y)->False))=> (x00 x0)) as proof of (((((eq nat) x) y)->False)->False)
% 1.28/1.49  Found (et0 (fun (x01:((((eq nat) x) y)->False))=> (x00 x0))) as proof of (((eq nat) x) y)
% 1.28/1.49  Found ((et (((eq nat) x) y)) (fun (x01:((((eq nat) x) y)->False))=> (x00 x0))) as proof of (((eq nat) x) y)
% 1.28/1.49  Found (fun (x00:(((more x) y)->False))=> ((et (((eq nat) x) y)) (fun (x01:((((eq nat) x) y)->False))=> (x00 x0)))) as proof of (((eq nat) x) y)
% 1.28/1.49  Found (fun (x00:(((more x) y)->False))=> ((et (((eq nat) x) y)) (fun (x01:((((eq nat) x) y)->False))=> (x00 x0)))) as proof of ((((more x) y)->False)->(((eq nat) x) y))
% 1.28/1.49  Found (n (fun (x00:(((more x) y)->False))=> ((et (((eq nat) x) y)) (fun (x01:((((eq nat) x) y)->False))=> (x00 x0))))) as proof of False
% 1.28/1.49  Found (fun (x0:((more x) y))=> (n (fun (x00:(((more x) y)->False))=> ((et (((eq nat) x) y)) (fun (x01:((((eq nat) x) y)->False))=> (x00 x0)))))) as proof of False
% 1.28/1.49  Found (fun (x0:((more x) y))=> (n (fun (x00:(((more x) y)->False))=> ((et (((eq nat) x) y)) (fun (x01:((((eq nat) x) y)->False))=> (x00 x0)))))) as proof of (((more x) y)->False)
% 1.28/1.49  Found ((satz10a00 (fun (x0:(((eq nat) x) y))=> (n (fun (x00:(((more x) y)->False))=> x0)))) (fun (x0:((more x) y))=> (n (fun (x00:(((more x) y)->False))=> ((et (((eq nat) x) y)) (fun (x01:((((eq nat) x) y)->False))=> (x00 x0))))))) as proof of ((less x) y)
% 1.28/1.49  Found (((satz10a0 y) (fun (x0:(((eq nat) x) y))=> (n (fun (x00:(((more x) y)->False))=> x0)))) (fun (x0:((more x) y))=> (n (fun (x00:(((more x) y)->False))=> ((et (((eq nat) x) y)) (fun (x01:((((eq nat) x) y)->False))=> (x00 x0))))))) as proof of ((less x) y)
% 1.28/1.50  Found ((((satz10a x) y) (fun (x0:(((eq nat) x) y))=> (n (fun (x00:(((more x) y)->False))=> x0)))) (fun (x0:((more x) y))=> (n (fun (x00:(((more x) y)->False))=> ((et (((eq nat) x) y)) (fun (x01:((((eq nat) x) y)->False))=> (x00 x0))))))) as proof of ((less x) y)
% 1.28/1.50  Found ((((satz10a x) y) (fun (x0:(((eq nat) x) y))=> (n (fun (x00:(((more x) y)->False))=> x0)))) (fun (x0:((more x) y))=> (n (fun (x00:(((more x) y)->False))=> ((et (((eq nat) x) y)) (fun (x01:((((eq nat) x) y)->False))=> (x00 x0))))))) as proof of ((less x) y)
% 1.28/1.50  Got proof ((((satz10a x) y) (fun (x0:(((eq nat) x) y))=> (n (fun (x00:(((more x) y)->False))=> x0)))) (fun (x0:((more x) y))=> (n (fun (x00:(((more x) y)->False))=> ((et (((eq nat) x) y)) (fun (x01:((((eq nat) x) y)->False))=> (x00 x0)))))))
% 1.28/1.50  Time elapsed = 0.966947s
% 1.28/1.50  node=152 cost=177.000000 depth=13
% 1.28/1.50::::::::::::::::::::::
% 1.28/1.50  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.28/1.50  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.28/1.50  ((((satz10a x) y) (fun (x0:(((eq nat) x) y))=> (n (fun (x00:(((more x) y)->False))=> x0)))) (fun (x0:((more x) y))=> (n (fun (x00:(((more x) y)->False))=> ((et (((eq nat) x) y)) (fun (x01:((((eq nat) x) y)->False))=> (x00 x0)))))))
% 1.28/1.50  % SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
%------------------------------------------------------------------------------