%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : NUM638^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 : n186.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:14 EST 2018 % Result : Theorem 1.31s % Output : Proof 1.31s % 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.04 % Problem : NUM638^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 : n186.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 11:18:00 CST 2018 % 0.02/0.24 % CPUTime : % 0.02/0.26 Python 2.7.13 % 1.31/1.56 Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox2/benchmark/', '/export/starexec/sandbox2/benchmark/'] % 1.31/1.56 FOF formula (<kernel.Constant object at 0x2aca99094710>, <kernel.Type object at 0x2aca9908d050>) of role type named nat_type % 1.31/1.56 Using role type % 1.31/1.56 Declaring nat:Type % 1.31/1.56 FOF formula (<kernel.Constant object at 0x2aca99094908>, <kernel.Constant object at 0x2aca9908d710>) of role type named x % 1.31/1.56 Using role type % 1.31/1.56 Declaring x:nat % 1.31/1.56 FOF formula (<kernel.Constant object at 0x2aca99094710>, <kernel.Constant object at 0x2aca9908d3b0>) of role type named n_1 % 1.31/1.56 Using role type % 1.31/1.56 Declaring n_1:nat % 1.31/1.56 FOF formula (not (((eq nat) x) n_1)) of role axiom named n % 1.31/1.56 A new axiom: (not (((eq nat) x) n_1)) % 1.31/1.56 FOF formula (<kernel.Constant object at 0x2aca99094710>, <kernel.DependentProduct object at 0x2aca9908d830>) of role type named suc % 1.31/1.56 Using role type % 1.31/1.56 Declaring suc:(nat->nat) % 1.31/1.56 FOF formula (<kernel.Constant object at 0x2aca99094710>, <kernel.DependentProduct object at 0x2aca9908d320>) of role type named some % 1.31/1.56 Using role type % 1.31/1.56 Declaring some:((nat->Prop)->Prop) % 1.31/1.56 FOF formula (forall (Xx:nat) (Xy:nat), ((((eq nat) (suc Xx)) (suc Xy))->(((eq nat) Xx) Xy))) of role axiom named ax4 % 1.31/1.56 A new axiom: (forall (Xx:nat) (Xy:nat), ((((eq nat) (suc Xx)) (suc Xy))->(((eq nat) Xx) Xy))) % 1.31/1.56 FOF formula (forall (Xx:nat), ((not (((eq nat) Xx) n_1))->(some (fun (Xu:nat)=> (((eq nat) Xx) (suc Xu)))))) of role axiom named satz3 % 1.31/1.56 A new axiom: (forall (Xx:nat), ((not (((eq nat) Xx) n_1))->(some (fun (Xu:nat)=> (((eq nat) Xx) (suc Xu)))))) % 1.31/1.56 FOF formula (((forall (Xx_0:nat) (Xy:nat), ((((eq nat) x) (suc Xx_0))->((((eq nat) x) (suc Xy))->(((eq nat) Xx_0) Xy))))->((some (fun (Xu:nat)=> (((eq nat) x) (suc Xu))))->False))->False) of role conjecture named satz3a % 1.31/1.56 Conjecture to prove = (((forall (Xx_0:nat) (Xy:nat), ((((eq nat) x) (suc Xx_0))->((((eq nat) x) (suc Xy))->(((eq nat) Xx_0) Xy))))->((some (fun (Xu:nat)=> (((eq nat) x) (suc Xu))))->False))->False):Prop % 1.31/1.56 We need to prove ['(((forall (Xx_0:nat) (Xy:nat), ((((eq nat) x) (suc Xx_0))->((((eq nat) x) (suc Xy))->(((eq nat) Xx_0) Xy))))->((some (fun (Xu:nat)=> (((eq nat) x) (suc Xu))))->False))->False)'] % 1.31/1.56 Parameter nat:Type. % 1.31/1.56 Parameter x:nat. % 1.31/1.56 Parameter n_1:nat. % 1.31/1.56 Axiom n:(not (((eq nat) x) n_1)). % 1.31/1.56 Parameter suc:(nat->nat). % 1.31/1.56 Parameter some:((nat->Prop)->Prop). % 1.31/1.56 Axiom ax4:(forall (Xx:nat) (Xy:nat), ((((eq nat) (suc Xx)) (suc Xy))->(((eq nat) Xx) Xy))). % 1.31/1.56 Axiom satz3:(forall (Xx:nat), ((not (((eq nat) Xx) n_1))->(some (fun (Xu:nat)=> (((eq nat) Xx) (suc Xu)))))). % 1.31/1.56 Trying to prove (((forall (Xx_0:nat) (Xy:nat), ((((eq nat) x) (suc Xx_0))->((((eq nat) x) (suc Xy))->(((eq nat) Xx_0) Xy))))->((some (fun (Xu:nat)=> (((eq nat) x) (suc Xu))))->False))->False) % 1.31/1.56 Found satz300:=(satz30 n):(some (fun (Xu:nat)=> (((eq nat) x) (suc Xu)))) % 1.31/1.56 Found (satz30 n) as proof of (some (fun (Xu:nat)=> (((eq nat) x) (suc Xu)))) % 1.31/1.56 Found ((satz3 x) n) as proof of (some (fun (Xu:nat)=> (((eq nat) x) (suc Xu)))) % 1.31/1.56 Found ((satz3 x) n) as proof of (some (fun (Xu:nat)=> (((eq nat) x) (suc Xu)))) % 1.31/1.56 Found x0000:=(x000 x1):(((eq nat) (suc Xx_0)) (suc Xy)) % 1.31/1.56 Found (x000 x1) as proof of (((eq nat) (suc Xx_0)) (suc Xy)) % 1.31/1.56 Found ((x00 (fun (x2:nat)=> (((eq nat) x2) (suc Xy)))) x1) as proof of (((eq nat) (suc Xx_0)) (suc Xy)) % 1.31/1.56 Found ((x00 (fun (x2:nat)=> (((eq nat) x2) (suc Xy)))) x1) as proof of (((eq nat) (suc Xx_0)) (suc Xy)) % 1.31/1.56 Found (ax400 ((x00 (fun (x2:nat)=> (((eq nat) x2) (suc Xy)))) x1)) as proof of (((eq nat) Xx_0) Xy) % 1.31/1.56 Found ((ax40 Xy) ((x00 (fun (x2:nat)=> (((eq nat) x2) (suc Xy)))) x1)) as proof of (((eq nat) Xx_0) Xy) % 1.31/1.56 Found (((ax4 Xx_0) Xy) ((x00 (fun (x2:nat)=> (((eq nat) x2) (suc Xy)))) x1)) as proof of (((eq nat) Xx_0) Xy) % 1.31/1.56 Found (fun (x1:(((eq nat) x) (suc Xy)))=> (((ax4 Xx_0) Xy) ((x00 (fun (x2:nat)=> (((eq nat) x2) (suc Xy)))) x1))) as proof of (((eq nat) Xx_0) Xy) % 1.31/1.56 Found (fun (x00:(((eq nat) x) (suc Xx_0))) (x1:(((eq nat) x) (suc Xy)))=> (((ax4 Xx_0) Xy) ((x00 (fun (x2:nat)=> (((eq nat) x2) (suc Xy)))) x1))) as proof of ((((eq nat) x) (suc Xy))->(((eq nat) Xx_0) Xy)) % 1.31/1.56 Found (fun (Xy:nat) (x00:(((eq nat) x) (suc Xx_0))) (x1:(((eq nat) x) (suc Xy)))=> (((ax4 Xx_0) Xy) ((x00 (fun (x2:nat)=> (((eq nat) x2) (suc Xy)))) x1))) as proof of ((((eq nat) x) (suc Xx_0))->((((eq nat) x) (suc Xy))->(((eq nat) Xx_0) Xy))) % 1.31/1.57 Found (fun (Xx_0:nat) (Xy:nat) (x00:(((eq nat) x) (suc Xx_0))) (x1:(((eq nat) x) (suc Xy)))=> (((ax4 Xx_0) Xy) ((x00 (fun (x2:nat)=> (((eq nat) x2) (suc Xy)))) x1))) as proof of (forall (Xy:nat), ((((eq nat) x) (suc Xx_0))->((((eq nat) x) (suc Xy))->(((eq nat) Xx_0) Xy)))) % 1.31/1.57 Found (fun (Xx_0:nat) (Xy:nat) (x00:(((eq nat) x) (suc Xx_0))) (x1:(((eq nat) x) (suc Xy)))=> (((ax4 Xx_0) Xy) ((x00 (fun (x2:nat)=> (((eq nat) x2) (suc Xy)))) x1))) as proof of (forall (Xx_0:nat) (Xy:nat), ((((eq nat) x) (suc Xx_0))->((((eq nat) x) (suc Xy))->(((eq nat) Xx_0) Xy)))) % 1.31/1.57 Found ((x0 (fun (Xx_0:nat) (Xy:nat) (x00:(((eq nat) x) (suc Xx_0))) (x1:(((eq nat) x) (suc Xy)))=> (((ax4 Xx_0) Xy) ((x00 (fun (x2:nat)=> (((eq nat) x2) (suc Xy)))) x1)))) ((satz3 x) n)) as proof of False % 1.31/1.57 Found (fun (x0:((forall (Xx_0:nat) (Xy:nat), ((((eq nat) x) (suc Xx_0))->((((eq nat) x) (suc Xy))->(((eq nat) Xx_0) Xy))))->((some (fun (Xu:nat)=> (((eq nat) x) (suc Xu))))->False)))=> ((x0 (fun (Xx_0:nat) (Xy:nat) (x00:(((eq nat) x) (suc Xx_0))) (x1:(((eq nat) x) (suc Xy)))=> (((ax4 Xx_0) Xy) ((x00 (fun (x2:nat)=> (((eq nat) x2) (suc Xy)))) x1)))) ((satz3 x) n))) as proof of False % 1.31/1.57 Found (fun (x0:((forall (Xx_0:nat) (Xy:nat), ((((eq nat) x) (suc Xx_0))->((((eq nat) x) (suc Xy))->(((eq nat) Xx_0) Xy))))->((some (fun (Xu:nat)=> (((eq nat) x) (suc Xu))))->False)))=> ((x0 (fun (Xx_0:nat) (Xy:nat) (x00:(((eq nat) x) (suc Xx_0))) (x1:(((eq nat) x) (suc Xy)))=> (((ax4 Xx_0) Xy) ((x00 (fun (x2:nat)=> (((eq nat) x2) (suc Xy)))) x1)))) ((satz3 x) n))) as proof of (((forall (Xx_0:nat) (Xy:nat), ((((eq nat) x) (suc Xx_0))->((((eq nat) x) (suc Xy))->(((eq nat) Xx_0) Xy))))->((some (fun (Xu:nat)=> (((eq nat) x) (suc Xu))))->False))->False) % 1.31/1.57 Got proof (fun (x0:((forall (Xx_0:nat) (Xy:nat), ((((eq nat) x) (suc Xx_0))->((((eq nat) x) (suc Xy))->(((eq nat) Xx_0) Xy))))->((some (fun (Xu:nat)=> (((eq nat) x) (suc Xu))))->False)))=> ((x0 (fun (Xx_0:nat) (Xy:nat) (x00:(((eq nat) x) (suc Xx_0))) (x1:(((eq nat) x) (suc Xy)))=> (((ax4 Xx_0) Xy) ((x00 (fun (x2:nat)=> (((eq nat) x2) (suc Xy)))) x1)))) ((satz3 x) n))) % 1.31/1.57 Time elapsed = 1.029380s % 1.31/1.57 node=152 cost=174.000000 depth=13 % 1.31/1.57:::::::::::::::::::::: % 1.31/1.57 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.31/1.57 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.31/1.57 (fun (x0:((forall (Xx_0:nat) (Xy:nat), ((((eq nat) x) (suc Xx_0))->((((eq nat) x) (suc Xy))->(((eq nat) Xx_0) Xy))))->((some (fun (Xu:nat)=> (((eq nat) x) (suc Xu))))->False)))=> ((x0 (fun (Xx_0:nat) (Xy:nat) (x00:(((eq nat) x) (suc Xx_0))) (x1:(((eq nat) x) (suc Xy)))=> (((ax4 Xx_0) Xy) ((x00 (fun (x2:nat)=> (((eq nat) x2) (suc Xy)))) x1)))) ((satz3 x) n))) % 1.31/1.57 % SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p %------------------------------------------------------------------------------