TSTP Solution File: NUM713^1 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : NUM713^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 : n043.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:33 EST 2018
% Result : Timeout 300.01s
% Output : None
% Verified :
% SZS Type : None (Parsing solution fails)
% Syntax : Number of formulae : 0
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : NUM713^1 : TPTP v7.0.0. Released v3.7.0.
% 0.00/0.05 % Command : python CASC.py /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.02/0.24 % Computer : n043.star.cs.uiowa.edu
% 0.02/0.24 % Model : x86_64 x86_64
% 0.02/0.24 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz
% 0.02/0.24 % Memory : 32218.625MB
% 0.02/0.24 % OS : Linux 3.10.0-693.2.2.el7.x86_64
% 0.02/0.24 % CPULimit : 300
% 0.02/0.24 % DateTime : Fri Jan 5 13:13:04 CST 2018
% 0.02/0.24 % CPUTime :
% 0.02/0.27 Python 2.7.13
% 112.28/112.65 Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox2/benchmark/', '/export/starexec/sandbox2/benchmark/']
% 112.28/112.65 FOF formula (<kernel.Constant object at 0x2b6e4ab92200>, <kernel.Type object at 0x2b6e4ac767e8>) of role type named nat_type
% 112.28/112.65 Using role type
% 112.28/112.65 Declaring nat:Type
% 112.28/112.65 FOF formula (<kernel.Constant object at 0x2b6e4ab927a0>, <kernel.Constant object at 0x2b6e4ab92b48>) of role type named x
% 112.28/112.65 Using role type
% 112.28/112.65 Declaring x:nat
% 112.28/112.65 FOF formula (<kernel.Constant object at 0x2b6e4ab92ea8>, <kernel.Constant object at 0x2b6e4ab92200>) of role type named y
% 112.28/112.65 Using role type
% 112.28/112.65 Declaring y:nat
% 112.28/112.65 FOF formula (<kernel.Constant object at 0x2b6e4ab927a0>, <kernel.Constant object at 0x2b6e4ac76908>) of role type named z
% 112.28/112.65 Using role type
% 112.28/112.65 Declaring z:nat
% 112.28/112.65 FOF formula (<kernel.Constant object at 0x2b6e4ab92200>, <kernel.DependentProduct object at 0x2b6e4ac76368>) of role type named pl
% 112.28/112.65 Using role type
% 112.28/112.65 Declaring pl:(nat->(nat->nat))
% 112.28/112.65 FOF formula ((forall (Xx_0:nat), (not (((eq nat) x) ((pl y) Xx_0))))->False) of role axiom named m
% 112.28/112.65 A new axiom: ((forall (Xx_0:nat), (not (((eq nat) x) ((pl y) Xx_0))))->False)
% 112.28/112.65 FOF formula (<kernel.Constant object at 0x2b6e4ab92b48>, <kernel.DependentProduct object at 0x2b6e4ac76950>) of role type named ts
% 112.28/112.65 Using role type
% 112.28/112.65 Declaring ts:(nat->(nat->nat))
% 112.28/112.65 FOF formula (forall (Xa:Prop), (((Xa->False)->False)->Xa)) of role axiom named et
% 112.28/112.65 A new axiom: (forall (Xa:Prop), (((Xa->False)->False)->Xa))
% 112.28/112.65 FOF formula (forall (Xx:nat) (Xy:nat), (((eq nat) ((ts Xx) Xy)) ((ts Xy) Xx))) of role axiom named satz29
% 112.28/112.65 A new axiom: (forall (Xx:nat) (Xy:nat), (((eq nat) ((ts Xx) Xy)) ((ts Xy) Xx)))
% 112.28/112.65 FOF formula (forall (Xx:nat) (Xy:nat) (Xz:nat), (((eq nat) ((ts Xx) ((pl Xy) Xz))) ((pl ((ts Xx) Xy)) ((ts Xx) Xz)))) of role axiom named satz30
% 112.28/112.65 A new axiom: (forall (Xx:nat) (Xy:nat) (Xz:nat), (((eq nat) ((ts Xx) ((pl Xy) Xz))) ((pl ((ts Xx) Xy)) ((ts Xx) Xz))))
% 112.28/112.65 FOF formula ((forall (Xx_0:nat), (not (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))))->False) of role conjecture named satz32a
% 112.28/112.65 Conjecture to prove = ((forall (Xx_0:nat), (not (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))))->False):Prop
% 112.28/112.65 We need to prove ['((forall (Xx_0:nat), (not (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))))->False)']
% 112.28/112.65 Parameter nat:Type.
% 112.28/112.65 Parameter x:nat.
% 112.28/112.65 Parameter y:nat.
% 112.28/112.65 Parameter z:nat.
% 112.28/112.65 Parameter pl:(nat->(nat->nat)).
% 112.28/112.65 Axiom m:((forall (Xx_0:nat), (not (((eq nat) x) ((pl y) Xx_0))))->False).
% 112.28/112.65 Parameter ts:(nat->(nat->nat)).
% 112.28/112.65 Axiom et:(forall (Xa:Prop), (((Xa->False)->False)->Xa)).
% 112.28/112.65 Axiom satz29:(forall (Xx:nat) (Xy:nat), (((eq nat) ((ts Xx) Xy)) ((ts Xy) Xx))).
% 112.28/112.65 Axiom satz30:(forall (Xx:nat) (Xy:nat) (Xz:nat), (((eq nat) ((ts Xx) ((pl Xy) Xz))) ((pl ((ts Xx) Xy)) ((ts Xx) Xz)))).
% 112.28/112.65 Trying to prove ((forall (Xx_0:nat), (not (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))))->False)
% 112.28/112.65 Found m0:False
% 112.28/112.65 Found (fun (x0:(forall (Xx_0:nat), (not (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0)))))=> m0) as proof of False
% 112.28/112.65 Found (fun (x0:(forall (Xx_0:nat), (not (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0)))))=> m0) as proof of ((forall (Xx_0:nat), (not (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))))->False)
% 112.28/112.65 Found m0:False
% 112.28/112.65 Found (fun (x0:(((forall (Xx_0:nat), (not (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))))->False)->False))=> m0) as proof of False
% 112.28/112.65 Found (fun (x0:(((forall (Xx_0:nat), (not (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))))->False)->False))=> m0) as proof of ((((forall (Xx_0:nat), (not (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))))->False)->False)->False)
% 112.28/112.65 Found m0:False
% 112.28/112.65 Found (fun (x1:(False->False))=> m0) as proof of False
% 112.28/112.65 Found (fun (x1:(False->False))=> m0) as proof of ((False->False)->False)
% 112.28/112.65 Found m0:False
% 112.28/112.65 Found (fun (x0:(forall (Xx_0:nat), (not (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0)))))=> m0) as proof of False
% 112.28/112.65 Found (fun (x0:(forall (Xx_0:nat), (not (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0)))))=> m0) as proof of (not (forall (Xx_0:nat), (not (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0)))))
% 112.28/112.65 Found m0:False
% 112.28/112.65 Found (fun (x01:((((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))->False))=> m0) as proof of False
% 112.28/112.65 Found (fun (x01:((((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))->False))=> m0) as proof of (((((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))->False)->False)
% 231.32/231.73 Found m0:False
% 231.32/231.73 Found (fun (x0:((not (forall (Xx_0:nat), (not (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0)))))->False))=> m0) as proof of False
% 231.32/231.73 Found (fun (x0:((not (forall (Xx_0:nat), (not (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0)))))->False))=> m0) as proof of (((not (forall (Xx_0:nat), (not (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0)))))->False)->False)
% 231.32/231.73 Found m0:False
% 231.32/231.73 Found (fun (x01:(((P ((ts x) z))->(P ((pl ((ts y) z)) Xx_0)))->False))=> m0) as proof of False
% 231.32/231.73 Found (fun (x01:(((P ((ts x) z))->(P ((pl ((ts y) z)) Xx_0)))->False))=> m0) as proof of ((((P ((ts x) z))->(P ((pl ((ts y) z)) Xx_0)))->False)->False)
% 231.32/231.73 Found m0:False
% 231.32/231.73 Found (fun (x1:(False->False))=> m0) as proof of False
% 231.32/231.73 Found (fun (x1:(False->False))=> m0) as proof of ((False->False)->False)
% 231.32/231.73 Found m0:False
% 231.32/231.73 Found (fun (x1:((P ((pl ((ts y) z)) Xx_0))->False))=> m0) as proof of False
% 231.32/231.73 Found (fun (x1:((P ((pl ((ts y) z)) Xx_0))->False))=> m0) as proof of (((P ((pl ((ts y) z)) Xx_0))->False)->False)
% 231.32/231.73 Found m0:False
% 231.32/231.73 Found (fun (x0:(forall (Xx_0:nat), (not (((eq nat) ((ts z) x)) ((pl ((ts y) z)) Xx_0)))))=> m0) as proof of False
% 231.32/231.73 Found (fun (x0:(forall (Xx_0:nat), (not (((eq nat) ((ts z) x)) ((pl ((ts y) z)) Xx_0)))))=> m0) as proof of (not (forall (Xx_0:nat), (not (((eq nat) ((ts z) x)) ((pl ((ts y) z)) Xx_0)))))
% 231.32/231.73 Found m0:False
% 231.32/231.73 Found (fun (x01:((((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))->False))=> m0) as proof of False
% 231.32/231.73 Found (fun (x01:((((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))->False))=> m0) as proof of (((((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))->False)->False)
% 231.32/231.73 Found (et0 (fun (x01:((((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))->False))=> m0)) as proof of (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))
% 231.32/231.73 Found ((et (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))) (fun (x01:((((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))->False))=> m0)) as proof of (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))
% 231.32/231.73 Found ((et (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))) (fun (x01:((((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))->False))=> m0)) as proof of (((eq nat) ((ts x) z)) ((pl ((ts y) z)) Xx_0))
% 231.32/231.73 Found m0:False
% 231.32/231.73 Found (fun (x01:(((P ((ts x) z))->(P ((pl ((ts y) z)) Xx_0)))->False))=> m0) as proof of False
% 231.32/231.73 Found (fun (x01:(((P ((ts x) z))->(P ((pl ((ts y) z)) Xx_0)))->False))=> m0) as proof of ((((P ((ts x) z))->(P ((pl ((ts y) z)) Xx_0)))->False)->False)
% 231.32/231.73 Found (et0 (fun (x01:(((P ((ts x) z))->(P ((pl ((ts y) z)) Xx_0)))->False))=> m0)) as proof of ((P ((ts x) z))->(P ((pl ((ts y) z)) Xx_0)))
% 231.32/231.73 Found ((et ((P ((ts x) z))->(P ((pl ((ts y) z)) Xx_0)))) (fun (x01:(((P ((ts x) z))->(P ((pl ((ts y) z)) Xx_0)))->False))=> m0)) as proof of ((P ((ts x) z))->(P ((pl ((ts y) z)) Xx_0)))
% 231.32/231.73 Found ((et ((P ((ts x) z))->(P ((pl ((ts y) z)) Xx_0)))) (fun (x01:(((P ((ts x) z))->(P ((pl ((ts y) z)) Xx_0)))->False))=> m0)) as proof of ((P ((ts x) z))->(P ((pl ((ts y) z)) Xx_0)))
% 231.32/231.73 Found m0:False
% 231.32/231.73 Found (fun (x0:((not (forall (Xx_0:nat), (not (((eq nat) ((ts z) x)) ((pl ((ts y) z)) Xx_0)))))->False))=> m0) as proof of False
% 231.32/231.73 Found (fun (x0:((not (forall (Xx_0:nat), (not (((eq nat) ((ts z) x)) ((pl ((ts y) z)) Xx_0)))))->False))=> m0) as proof of (((not (forall (Xx_0:nat), (not (((eq nat) ((ts z) x)) ((pl ((ts y) z)) Xx_0)))))->False)->False)
% 231.32/231.73 Found m0:False
% 231.32/231.73 Found (fun (x0:(forall (Xx_0:nat), (not (((eq nat) ((ts z) x)) ((pl ((ts y) z)) Xx_0)))))=> m0) as proof of False
% 231.32/231.73 Found (fun (x0:(forall (Xx_0:nat), (not (((eq nat) ((ts z) x)) ((pl ((ts y) z)) Xx_0)))))=> m0) as proof of (not (forall (Xx_0:nat), (not (((eq nat) ((ts z) x)) ((pl ((ts y) z)) Xx_0)))))
% 231.32/231.73 Found m0:False
% 231.32/231.73 Found (fun (x1:((P ((pl ((ts y) z)) Xx_0))->False))=> m0) as proof of False
% 231.32/231.73 Found (fun (x1:((P ((pl ((ts y) z)) Xx_0))->False))=> m0) as proof of (((P ((pl ((ts y) z)) Xx_0))->False)->False)
% 231.32/231.73 Found (et0 (fun (x1:((P ((pl ((ts y) z)) Xx_0))->False))=> m0)) as proof of (P ((pl ((ts y) z)) Xx_0))
% 231.32/231.73 Found ((et (P ((pl ((ts y) z)) Xx_0))) (fun (x1:((P ((pl ((ts y) z)) Xx_0))->False))=> m0)) as proof of (P ((pl ((ts y) z)) Xx_0))
%------------------------------------------------------------------------------