%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : NUM695^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 : n129.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:28 EST 2018 % Result : Theorem 0.99s % Output : Proof 0.99s % 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 : NUM695^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 : n129.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 13:00:49 CST 2018 % 0.02/0.23 % CPUTime : % 0.06/0.25 Python 2.7.13 % 0.99/1.20 Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox2/benchmark/', '/export/starexec/sandbox2/benchmark/'] % 0.99/1.20 FOF formula (<kernel.Constant object at 0x2b124efb4a70>, <kernel.Type object at 0x2b124efb4368>) of role type named nat_type % 0.99/1.20 Using role type % 0.99/1.20 Declaring nat:Type % 0.99/1.20 FOF formula (<kernel.Constant object at 0x2b124ebc2d88>, <kernel.Constant object at 0x2b124efb4ef0>) of role type named x % 0.99/1.20 Using role type % 0.99/1.20 Declaring x:nat % 0.99/1.20 FOF formula (<kernel.Constant object at 0x2b124ebc2d88>, <kernel.DependentProduct object at 0x2b124efb4320>) of role type named more % 0.99/1.20 Using role type % 0.99/1.20 Declaring more:(nat->(nat->Prop)) % 0.99/1.20 FOF formula (<kernel.Constant object at 0x2b124efb4638>, <kernel.DependentProduct object at 0x2b124efb4cb0>) of role type named suc % 0.99/1.20 Using role type % 0.99/1.20 Declaring suc:(nat->nat) % 0.99/1.20 FOF formula (<kernel.Constant object at 0x2b124efb4ef0>, <kernel.Constant object at 0x2b124efb4cb0>) of role type named n_1 % 0.99/1.20 Using role type % 0.99/1.20 Declaring n_1:nat % 0.99/1.20 FOF formula (forall (Xa:Prop), (((Xa->False)->False)->Xa)) of role axiom named et % 0.99/1.20 A new axiom: (forall (Xa:Prop), (((Xa->False)->False)->Xa)) % 0.99/1.20 FOF formula (forall (Xx:nat), ((not (((eq nat) Xx) n_1))->((forall (Xx_0:nat), (not (((eq nat) Xx) (suc Xx_0))))->False))) of role axiom named satz3 % 0.99/1.20 A new axiom: (forall (Xx:nat), ((not (((eq nat) Xx) n_1))->((forall (Xx_0:nat), (not (((eq nat) Xx) (suc Xx_0))))->False))) % 0.99/1.20 FOF formula (forall (Xx:nat), (not (((eq nat) (suc Xx)) n_1))) of role axiom named ax3 % 0.99/1.20 A new axiom: (forall (Xx:nat), (not (((eq nat) (suc Xx)) n_1))) % 0.99/1.20 FOF formula (<kernel.Constant object at 0x2b124efb46c8>, <kernel.DependentProduct object at 0x2b124efb4710>) of role type named pl % 0.99/1.20 Using role type % 0.99/1.20 Declaring pl:(nat->(nat->nat)) % 0.99/1.20 FOF formula (forall (Xx:nat) (Xy:nat), ((more ((pl Xx) Xy)) Xx)) of role axiom named satz18 % 0.99/1.20 A new axiom: (forall (Xx:nat) (Xy:nat), ((more ((pl Xx) Xy)) Xx)) % 0.99/1.20 FOF formula (forall (Xx:nat), (((eq nat) (suc Xx)) ((pl n_1) Xx))) of role axiom named satz4g % 0.99/1.20 A new axiom: (forall (Xx:nat), (((eq nat) (suc Xx)) ((pl n_1) Xx))) % 0.99/1.20 FOF formula ((more (suc x)) n_1) of role conjecture named satz24b % 0.99/1.20 Conjecture to prove = ((more (suc x)) n_1):Prop % 0.99/1.20 We need to prove ['((more (suc x)) n_1)'] % 0.99/1.20 Parameter nat:Type. % 0.99/1.20 Parameter x:nat. % 0.99/1.20 Parameter more:(nat->(nat->Prop)). % 0.99/1.20 Parameter suc:(nat->nat). % 0.99/1.20 Parameter n_1:nat. % 0.99/1.20 Axiom et:(forall (Xa:Prop), (((Xa->False)->False)->Xa)). % 0.99/1.20 Axiom satz3:(forall (Xx:nat), ((not (((eq nat) Xx) n_1))->((forall (Xx_0:nat), (not (((eq nat) Xx) (suc Xx_0))))->False))). % 0.99/1.20 Axiom ax3:(forall (Xx:nat), (not (((eq nat) (suc Xx)) n_1))). % 0.99/1.20 Parameter pl:(nat->(nat->nat)). % 0.99/1.20 Axiom satz18:(forall (Xx:nat) (Xy:nat), ((more ((pl Xx) Xy)) Xx)). % 0.99/1.20 Axiom satz4g:(forall (Xx:nat), (((eq nat) (suc Xx)) ((pl n_1) Xx))). % 0.99/1.20 Trying to prove ((more (suc x)) n_1) % 0.99/1.20 Found satz1800:=(satz180 x):((more ((pl n_1) x)) n_1) % 0.99/1.20 Found (satz180 x) as proof of ((more ((pl n_1) x)) n_1) % 0.99/1.20 Found ((satz18 n_1) x) as proof of ((more ((pl n_1) x)) n_1) % 0.99/1.20 Found ((satz18 n_1) x) as proof of ((more ((pl n_1) x)) n_1) % 0.99/1.20 Found (satz4g__eq_sym00 ((satz18 n_1) x)) as proof of ((more (suc x)) n_1) % 0.99/1.20 Found ((satz4g__eq_sym0 (fun (x1:nat)=> ((more x1) n_1))) ((satz18 n_1) x)) as proof of ((more (suc x)) n_1) % 0.99/1.20 Found (((satz4g__eq_sym x) (fun (x1:nat)=> ((more x1) n_1))) ((satz18 n_1) x)) as proof of ((more (suc x)) n_1) % 0.99/1.20 Found (((satz4g__eq_sym x) (fun (x1:nat)=> ((more x1) n_1))) ((satz18 n_1) x)) as proof of ((more (suc x)) n_1) % 0.99/1.20 Got proof ((((fun (Xx:nat)=> ((((eq_sym nat) (suc Xx)) ((pl n_1) Xx)) (satz4g Xx))) x) (fun (x1:nat)=> ((more x1) n_1))) ((satz18 n_1) x)) % 0.99/1.20 Time elapsed = 0.670488s % 0.99/1.20 node=148 cost=348.000000 depth=6 % 0.99/1.20:::::::::::::::::::::: % 0.99/1.20 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.99/1.20 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.99/1.20 ((((fun (Xx:nat)=> ((((eq_sym nat) (suc Xx)) ((pl n_1) Xx)) (satz4g Xx))) x) (fun (x1:nat)=> ((more x1) n_1))) ((satz18 n_1) x)) % 0.99/1.20 % SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p %------------------------------------------------------------------------------