TSTP Solution File: NUM652^1 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : NUM652^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 : n134.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:18 EST 2018
% Result : Theorem 5.93s
% Output : Proof 5.93s
% 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 : NUM652^1 : TPTP v7.0.0. Released v3.7.0.
% 0.00/0.03 % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.23 % Computer : n134.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:36:05 CST 2018
% 0.02/0.23 % CPUTime :
% 0.02/0.26 Python 2.7.13
% 5.93/6.32 Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/']
% 5.93/6.32 FOF formula (<kernel.Constant object at 0x2b648a1355f0>, <kernel.Type object at 0x2b648abafb00>) of role type named nat_type
% 5.93/6.32 Using role type
% 5.93/6.32 Declaring nat:Type
% 5.93/6.32 FOF formula (<kernel.Constant object at 0x2b648a1395a8>, <kernel.Constant object at 0x2b648abaf128>) of role type named x
% 5.93/6.32 Using role type
% 5.93/6.32 Declaring x:nat
% 5.93/6.32 FOF formula (<kernel.Constant object at 0x2b648a1355f0>, <kernel.Constant object at 0x2b648abaf128>) of role type named y
% 5.93/6.32 Using role type
% 5.93/6.32 Declaring y:nat
% 5.93/6.32 FOF formula (<kernel.Constant object at 0x2b648a1355f0>, <kernel.DependentProduct object at 0x2b648abaf5a8>) of role type named more
% 5.93/6.32 Using role type
% 5.93/6.32 Declaring more:(nat->(nat->Prop))
% 5.93/6.32 FOF formula ((((more x) y)->False)->(((eq nat) x) y)) of role axiom named m
% 5.93/6.32 A new axiom: ((((more x) y)->False)->(((eq nat) x) y))
% 5.93/6.32 FOF formula (<kernel.Constant object at 0x2b648abaf5a8>, <kernel.DependentProduct object at 0x2b648abaf6c8>) of role type named less
% 5.93/6.32 Using role type
% 5.93/6.32 Declaring less:(nat->(nat->Prop))
% 5.93/6.32 FOF formula (forall (Xa:Prop), (((Xa->False)->False)->Xa)) of role axiom named et
% 5.93/6.32 A new axiom: (forall (Xa:Prop), (((Xa->False)->False)->Xa))
% 5.93/6.32 FOF formula (forall (Xx:nat) (Xy:nat), ((((((eq nat) Xx) Xy)->(((more Xx) Xy)->False))->((((((more Xx) Xy)->(((less Xx) Xy)->False))->((((less Xx) Xy)->(not (((eq nat) Xx) Xy)))->False))->False)->False))->False)) of role axiom named satz10b
% 5.93/6.32 A new axiom: (forall (Xx:nat) (Xy:nat), ((((((eq nat) Xx) Xy)->(((more Xx) Xy)->False))->((((((more Xx) Xy)->(((less Xx) Xy)->False))->((((less Xx) Xy)->(not (((eq nat) Xx) Xy)))->False))->False)->False))->False))
% 5.93/6.32 FOF formula (((less x) y)->False) of role conjecture named satz10c
% 5.93/6.32 Conjecture to prove = (((less x) y)->False):Prop
% 5.93/6.32 We need to prove ['(((less x) y)->False)']
% 5.93/6.32 Parameter nat:Type.
% 5.93/6.32 Parameter x:nat.
% 5.93/6.32 Parameter y:nat.
% 5.93/6.32 Parameter more:(nat->(nat->Prop)).
% 5.93/6.32 Axiom m:((((more x) y)->False)->(((eq nat) x) y)).
% 5.93/6.32 Parameter less:(nat->(nat->Prop)).
% 5.93/6.32 Axiom et:(forall (Xa:Prop), (((Xa->False)->False)->Xa)).
% 5.93/6.32 Axiom satz10b:(forall (Xx:nat) (Xy:nat), ((((((eq nat) Xx) Xy)->(((more Xx) Xy)->False))->((((((more Xx) Xy)->(((less Xx) Xy)->False))->((((less Xx) Xy)->(not (((eq nat) Xx) Xy)))->False))->False)->False))->False)).
% 5.93/6.32 Trying to prove (((less x) y)->False)
% 5.93/6.32 Found eq_ref00:=(eq_ref0 Xx):(((eq nat) Xx) Xx)
% 5.93/6.32 Found (eq_ref0 Xx) as proof of (((eq nat) Xx) Xy)
% 5.93/6.32 Found ((eq_ref nat) Xx) as proof of (((eq nat) Xx) Xy)
% 5.93/6.32 Found ((eq_ref nat) Xx) as proof of (((eq nat) Xx) Xy)
% 5.93/6.32 Found ((eq_ref nat) Xx) as proof of (((eq nat) Xx) Xy)
% 5.93/6.32 Found x0:((less x) y)
% 5.93/6.32 Instantiate: Xx:=x:nat;Xy:=y:nat
% 5.93/6.32 Found x0 as proof of ((less Xx) Xy)
% 5.93/6.32 Found x0:((less x) y)
% 5.93/6.32 Instantiate: Xx:=x:nat;Xy:=y:nat
% 5.93/6.32 Found x0 as proof of ((less Xx) Xy)
% 5.93/6.32 Found eq_ref00:=(eq_ref0 Xx):(((eq nat) Xx) Xx)
% 5.93/6.32 Found (eq_ref0 Xx) as proof of (((eq nat) Xx) Xy)
% 5.93/6.32 Found ((eq_ref nat) Xx) as proof of (((eq nat) Xx) Xy)
% 5.93/6.32 Found ((eq_ref nat) Xx) as proof of (((eq nat) Xx) Xy)
% 5.93/6.32 Found ((eq_ref nat) Xx) as proof of (((eq nat) Xx) Xy)
% 5.93/6.32 Found x30:=(fun (x5:((more Xx) Xy))=> ((x3 x5) x0)):(((more Xx) Xy)->False)
% 5.93/6.32 Found (fun (x5:((more Xx) Xy))=> ((x3 x5) x0)) as proof of (((more x) y)->False)
% 5.93/6.32 Found (fun (x5:((more Xx) Xy))=> ((x3 x5) x0)) as proof of (((more x) y)->False)
% 5.93/6.32 Found (m (fun (x5:((more Xx) Xy))=> ((x3 x5) x0))) as proof of (((eq nat) Xx) Xy)
% 5.93/6.32 Found (m (fun (x5:((more Xx) Xy))=> ((x3 x5) x0))) as proof of (((eq nat) Xx) Xy)
% 5.93/6.32 Found ((x4 x0) (m (fun (x5:((more Xx) Xy))=> ((x3 x5) x0)))) as proof of False
% 5.93/6.32 Found (fun (x4:(((less Xx) Xy)->(not (((eq nat) Xx) Xy))))=> ((x4 x0) (m (fun (x5:((more Xx) Xy))=> ((x3 x5) x0))))) as proof of False
% 5.93/6.32 Found (fun (x3:(((more Xx) Xy)->(((less Xx) Xy)->False))) (x4:(((less Xx) Xy)->(not (((eq nat) Xx) Xy))))=> ((x4 x0) (m (fun (x5:((more Xx) Xy))=> ((x3 x5) x0))))) as proof of ((((less Xx) Xy)->(not (((eq nat) Xx) Xy)))->False)
% 5.93/6.32 Found (fun (x3:(((more Xx) Xy)->(((less Xx) Xy)->False))) (x4:(((less Xx) Xy)->(not (((eq nat) Xx) Xy))))=> ((x4 x0) (m (fun (x5:((more Xx) Xy))=> ((x3 x5) x0))))) as proof of ((((more Xx) Xy)->(((less Xx) Xy)->False))->((((less Xx) Xy)->(not (((eq nat) Xx) Xy)))->False))
% 5.93/6.33 Found (x2 (fun (x3:(((more Xx) Xy)->(((less Xx) Xy)->False))) (x4:(((less Xx) Xy)->(not (((eq nat) Xx) Xy))))=> ((x4 x0) (m (fun (x5:((more Xx) Xy))=> ((x3 x5) x0)))))) as proof of False
% 5.93/6.33 Found (fun (x2:(((((more Xx) Xy)->(((less Xx) Xy)->False))->((((less Xx) Xy)->(not (((eq nat) Xx) Xy)))->False))->False))=> (x2 (fun (x3:(((more Xx) Xy)->(((less Xx) Xy)->False))) (x4:(((less Xx) Xy)->(not (((eq nat) Xx) Xy))))=> ((x4 x0) (m (fun (x5:((more Xx) Xy))=> ((x3 x5) x0))))))) as proof of False
% 5.93/6.33 Found (fun (x1:((((eq nat) Xx) Xy)->(((more Xx) Xy)->False))) (x2:(((((more Xx) Xy)->(((less Xx) Xy)->False))->((((less Xx) Xy)->(not (((eq nat) Xx) Xy)))->False))->False))=> (x2 (fun (x3:(((more Xx) Xy)->(((less Xx) Xy)->False))) (x4:(((less Xx) Xy)->(not (((eq nat) Xx) Xy))))=> ((x4 x0) (m (fun (x5:((more Xx) Xy))=> ((x3 x5) x0))))))) as proof of ((((((more Xx) Xy)->(((less Xx) Xy)->False))->((((less Xx) Xy)->(not (((eq nat) Xx) Xy)))->False))->False)->False)
% 5.93/6.33 Found (fun (x1:((((eq nat) Xx) Xy)->(((more Xx) Xy)->False))) (x2:(((((more Xx) Xy)->(((less Xx) Xy)->False))->((((less Xx) Xy)->(not (((eq nat) Xx) Xy)))->False))->False))=> (x2 (fun (x3:(((more Xx) Xy)->(((less Xx) Xy)->False))) (x4:(((less Xx) Xy)->(not (((eq nat) Xx) Xy))))=> ((x4 x0) (m (fun (x5:((more Xx) Xy))=> ((x3 x5) x0))))))) as proof of (((((eq nat) Xx) Xy)->(((more Xx) Xy)->False))->((((((more Xx) Xy)->(((less Xx) Xy)->False))->((((less Xx) Xy)->(not (((eq nat) Xx) Xy)))->False))->False)->False))
% 5.93/6.33 Found (satz10b00 (fun (x1:((((eq nat) Xx) Xy)->(((more Xx) Xy)->False))) (x2:(((((more Xx) Xy)->(((less Xx) Xy)->False))->((((less Xx) Xy)->(not (((eq nat) Xx) Xy)))->False))->False))=> (x2 (fun (x3:(((more Xx) Xy)->(((less Xx) Xy)->False))) (x4:(((less Xx) Xy)->(not (((eq nat) Xx) Xy))))=> ((x4 x0) (m (fun (x5:((more Xx) Xy))=> ((x3 x5) x0)))))))) as proof of False
% 5.93/6.33 Found ((satz10b0 y) (fun (x1:((((eq nat) Xx) y)->(((more Xx) y)->False))) (x2:(((((more Xx) y)->(((less Xx) y)->False))->((((less Xx) y)->(not (((eq nat) Xx) y)))->False))->False))=> (x2 (fun (x3:(((more Xx) y)->(((less Xx) y)->False))) (x4:(((less Xx) y)->(not (((eq nat) Xx) y))))=> ((x4 x0) (m (fun (x5:((more Xx) y))=> ((x3 x5) x0)))))))) as proof of False
% 5.93/6.33 Found (((satz10b x) y) (fun (x1:((((eq nat) x) y)->(((more x) y)->False))) (x2:(((((more x) y)->(((less x) y)->False))->((((less x) y)->(not (((eq nat) x) y)))->False))->False))=> (x2 (fun (x3:(((more x) y)->(((less x) y)->False))) (x4:(((less x) y)->(not (((eq nat) x) y))))=> ((x4 x0) (m (fun (x5:((more x) y))=> ((x3 x5) x0)))))))) as proof of False
% 5.93/6.33 Found (fun (x0:((less x) y))=> (((satz10b x) y) (fun (x1:((((eq nat) x) y)->(((more x) y)->False))) (x2:(((((more x) y)->(((less x) y)->False))->((((less x) y)->(not (((eq nat) x) y)))->False))->False))=> (x2 (fun (x3:(((more x) y)->(((less x) y)->False))) (x4:(((less x) y)->(not (((eq nat) x) y))))=> ((x4 x0) (m (fun (x5:((more x) y))=> ((x3 x5) x0))))))))) as proof of False
% 5.93/6.33 Found (fun (x0:((less x) y))=> (((satz10b x) y) (fun (x1:((((eq nat) x) y)->(((more x) y)->False))) (x2:(((((more x) y)->(((less x) y)->False))->((((less x) y)->(not (((eq nat) x) y)))->False))->False))=> (x2 (fun (x3:(((more x) y)->(((less x) y)->False))) (x4:(((less x) y)->(not (((eq nat) x) y))))=> ((x4 x0) (m (fun (x5:((more x) y))=> ((x3 x5) x0))))))))) as proof of (((less x) y)->False)
% 5.93/6.33 Got proof (fun (x0:((less x) y))=> (((satz10b x) y) (fun (x1:((((eq nat) x) y)->(((more x) y)->False))) (x2:(((((more x) y)->(((less x) y)->False))->((((less x) y)->(not (((eq nat) x) y)))->False))->False))=> (x2 (fun (x3:(((more x) y)->(((less x) y)->False))) (x4:(((less x) y)->(not (((eq nat) x) y))))=> ((x4 x0) (m (fun (x5:((more x) y))=> ((x3 x5) x0)))))))))
% 5.93/6.33 Time elapsed = 5.601062s
% 5.93/6.33 node=1034 cost=933.000000 depth=16
% 5.93/6.33::::::::::::::::::::::
% 5.93/6.33 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.93/6.33 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% 5.93/6.33 (fun (x0:((less x) y))=> (((satz10b x) y) (fun (x1:((((eq nat) x) y)->(((more x) y)->False))) (x2:(((((more x) y)->(((less x) y)->False))->((((less x) y)->(not (((eq nat) x) y)))->False))->False))=> (x2 (fun (x3:(((more x) y)->(((less x) y)->False))) (x4:(((less x) y)->(not (((eq nat) x) y))))=> ((x4 x0) (m (fun (x5:((more x) y))=> ((x3 x5) x0)))))))))
% 5.93/6.37 % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
%------------------------------------------------------------------------------