%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : NUM660^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:20 EST 2018 % Result : Theorem 1.09s % Output : Proof 1.09s % 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 : NUM660^1 : TPTP v7.0.0. Released v3.7.0. % 0.00/0.03 % Command : python CASC.py /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.03/0.23 % Computer : n129.star.cs.uiowa.edu % 0.03/0.23 % Model : x86_64 x86_64 % 0.03/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz % 0.03/0.23 % Memory : 32218.625MB % 0.03/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 % 0.03/0.23 % CPULimit : 300 % 0.03/0.23 % DateTime : Fri Jan 5 11:45:29 CST 2018 % 0.03/0.23 % CPUTime : % 0.07/0.26 Python 2.7.13 % 1.09/1.48 Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox2/benchmark/', '/export/starexec/sandbox2/benchmark/'] % 1.09/1.48 FOF formula (<kernel.Constant object at 0x2ac4b33b1a70>, <kernel.Type object at 0x2ac4b33b1368>) of role type named nat_type % 1.09/1.48 Using role type % 1.09/1.48 Declaring nat:Type % 1.09/1.48 FOF formula (<kernel.Constant object at 0x2ac4b30c7680>, <kernel.Constant object at 0x2ac4b33b14d0>) of role type named x % 1.09/1.48 Using role type % 1.09/1.48 Declaring x:nat % 1.09/1.48 FOF formula (<kernel.Constant object at 0x2ac4b33b1c20>, <kernel.Constant object at 0x2ac4b33b14d0>) of role type named y % 1.09/1.48 Using role type % 1.09/1.48 Declaring y:nat % 1.09/1.48 FOF formula (<kernel.Constant object at 0x2ac4b33b1a70>, <kernel.DependentProduct object at 0x2ac4b33b15a8>) of role type named more % 1.09/1.48 Using role type % 1.09/1.48 Declaring more:(nat->(nat->Prop)) % 1.09/1.48 FOF formula ((((more x) y)->False)->(((eq nat) x) y)) of role axiom named m % 1.09/1.48 A new axiom: ((((more x) y)->False)->(((eq nat) x) y)) % 1.09/1.48 FOF formula (<kernel.Constant object at 0x2ac4b30caef0>, <kernel.DependentProduct object at 0x2ac4b33b1560>) of role type named less % 1.09/1.48 Using role type % 1.09/1.48 Declaring less:(nat->(nat->Prop)) % 1.09/1.48 FOF formula (forall (Xx:nat) (Xy:nat), (((more Xx) Xy)->((less Xy) Xx))) of role axiom named satz11 % 1.09/1.48 A new axiom: (forall (Xx:nat) (Xy:nat), (((more Xx) Xy)->((less Xy) Xx))) % 1.09/1.48 FOF formula ((((less y) x)->False)->(((eq nat) y) x)) of role conjecture named satz13 % 1.09/1.48 Conjecture to prove = ((((less y) x)->False)->(((eq nat) y) x)):Prop % 1.09/1.48 We need to prove ['((((less y) x)->False)->(((eq nat) y) x))'] % 1.09/1.48 Parameter nat:Type. % 1.09/1.48 Parameter x:nat. % 1.09/1.48 Parameter y:nat. % 1.09/1.48 Parameter more:(nat->(nat->Prop)). % 1.09/1.48 Axiom m:((((more x) y)->False)->(((eq nat) x) y)). % 1.09/1.48 Parameter less:(nat->(nat->Prop)). % 1.09/1.48 Axiom satz11:(forall (Xx:nat) (Xy:nat), (((more Xx) Xy)->((less Xy) Xx))). % 1.09/1.48 Trying to prove ((((less y) x)->False)->(((eq nat) y) x)) % 1.09/1.48 Found eq_ref00:=(eq_ref0 x):(((eq nat) x) x) % 1.09/1.48 Found (eq_ref0 x) as proof of (P x) % 1.09/1.48 Found ((eq_ref nat) x) as proof of (P x) % 1.09/1.48 Found ((eq_ref nat) x) as proof of (P x) % 1.09/1.48 Found satz11000:=(satz1100 x1):((less y) x) % 1.09/1.48 Found (satz1100 x1) as proof of ((less y) x) % 1.09/1.48 Found ((satz110 y) x1) as proof of ((less y) x) % 1.09/1.49 Found (((satz11 x) y) x1) as proof of ((less y) x) % 1.09/1.49 Found (((satz11 x) y) x1) as proof of ((less y) x) % 1.09/1.49 Found (x0 (((satz11 x) y) x1)) as proof of False % 1.09/1.49 Found (fun (x1:((more x) y))=> (x0 (((satz11 x) y) x1))) as proof of False % 1.09/1.49 Found (fun (x1:((more x) y))=> (x0 (((satz11 x) y) x1))) as proof of (((more x) y)->False) % 1.09/1.49 Found ((m0 (fun (x1:((more x) y))=> (x0 (((satz11 x) y) x1)))) ((eq_ref nat) x)) as proof of (((eq nat) y) x) % 1.09/1.49 Found ((m0 (fun (x1:((more x) y))=> (x0 (((satz11 x) y) x1)))) ((eq_ref nat) x)) as proof of (((eq nat) y) x) % 1.09/1.49 Found (((fun (x00:(((more x) y)->False))=> ((m x00) (fun (x1:nat)=> (((eq nat) x1) x)))) (fun (x1:((more x) y))=> (x0 (((satz11 x) y) x1)))) ((eq_ref nat) x)) as proof of (((eq nat) y) x) % 1.09/1.49 Found (fun (x0:(((less y) x)->False))=> (((fun (x00:(((more x) y)->False))=> ((m x00) (fun (x1:nat)=> (((eq nat) x1) x)))) (fun (x1:((more x) y))=> (x0 (((satz11 x) y) x1)))) ((eq_ref nat) x))) as proof of (((eq nat) y) x) % 1.09/1.49 Found (fun (x0:(((less y) x)->False))=> (((fun (x00:(((more x) y)->False))=> ((m x00) (fun (x1:nat)=> (((eq nat) x1) x)))) (fun (x1:((more x) y))=> (x0 (((satz11 x) y) x1)))) ((eq_ref nat) x))) as proof of ((((less y) x)->False)->(((eq nat) y) x)) % 1.09/1.49 Got proof (fun (x0:(((less y) x)->False))=> (((fun (x00:(((more x) y)->False))=> ((m x00) (fun (x1:nat)=> (((eq nat) x1) x)))) (fun (x1:((more x) y))=> (x0 (((satz11 x) y) x1)))) ((eq_ref nat) x))) % 1.09/1.49 Time elapsed = 0.765775s % 1.09/1.49 node=160 cost=237.000000 depth=11 % 1.09/1.49:::::::::::::::::::::: % 1.09/1.49 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.09/1.49 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.09/1.49 (fun (x0:(((less y) x)->False))=> (((fun (x00:(((more x) y)->False))=> ((m x00) (fun (x1:nat)=> (((eq nat) x1) x)))) (fun (x1:((more x) y))=> (x0 (((satz11 x) y) x1)))) ((eq_ref nat) x))) % 1.09/1.49 % SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p %------------------------------------------------------------------------------