TSTP Solution File: SYO554^1 by cocATP---0.2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cocATP---0.2.0
% Problem : SYO554^1 : TPTP v7.5.0. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : python CASC.py /export/starexec/sandbox2/benchmark/theBenchmark.p
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 0s
% DateTime : Tue Mar 29 00:52:05 EDT 2022
% Result : Unknown 0.99s 1.21s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SYO554^1 : TPTP v7.5.0. Released v5.2.0.
% 0.06/0.12 % Command : python CASC.py /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.33 % Computer : n002.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % RAMPerCPU : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % DateTime : Sun Mar 13 20:21:56 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.13/0.34 ModuleCmd_Load.c(213):ERROR:105: Unable to locate a modulefile for 'python/python27'
% 0.13/0.34 Python 2.7.5
% 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 0xe7add0>, <kernel.DependentProduct object at 0xe79128>) of role type named p
% 0.99/1.20 Using role type
% 0.99/1.20 Declaring p:(fofType->Prop)
% 0.99/1.20 FOF formula (<kernel.Constant object at 0xe7a128>, <kernel.Single object at 0xe7a2d8>) of role type named s
% 0.99/1.20 Using role type
% 0.99/1.20 Declaring s:fofType
% 0.99/1.20 FOF formula (<kernel.Constant object at 0xe7add0>, <kernel.Single object at 0xe79a28>) of role type named t
% 0.99/1.20 Using role type
% 0.99/1.20 Declaring t:fofType
% 0.99/1.20 FOF formula (<kernel.Constant object at 0xe7a2d8>, <kernel.Single object at 0xe79d88>) of role type named u
% 0.99/1.20 Using role type
% 0.99/1.20 Declaring u:fofType
% 0.99/1.20 FOF formula ((or (p s)) (p t)) of role axiom named pst
% 0.99/1.20 A new axiom: ((or (p s)) (p t))
% 0.99/1.20 FOF formula ((or ((p u)->False)) ((p t)->False)) of role axiom named puv
% 0.99/1.20 A new axiom: ((or ((p u)->False)) ((p t)->False))
% 0.99/1.20 FOF formula (((eq fofType) s) t) of role axiom named st
% 0.99/1.20 A new axiom: (((eq fofType) s) t)
% 0.99/1.20 FOF formula (((eq fofType) t) u) of role axiom named tu
% 0.99/1.20 A new axiom: (((eq fofType) t) u)
% 0.99/1.20 We need to prove []
% 0.99/1.20 Parameter fofType:Type.
% 0.99/1.20 Parameter p:(fofType->Prop).
% 0.99/1.20 Parameter s:fofType.
% 0.99/1.20 Parameter t:fofType.
% 0.99/1.20 Parameter u:fofType.
% 0.99/1.20 Axiom pst:((or (p s)) (p t)).
% 0.99/1.20 Axiom puv:((or ((p u)->False)) ((p t)->False)).
% 0.99/1.20 Axiom st:(((eq fofType) s) t).
% 0.99/1.20 Axiom tu:(((eq fofType) t) u).
% 0.99/1.20 There are no conjectures!
% 0.99/1.20 Adding conjecture False, to look for Unsatisfiability
% 0.99/1.20 Trying to prove False
% 0.99/1.20 Found x:((p t)->False)
% 0.99/1.20 Found x as proof of ((p t)->False)
% 0.99/1.20 Found st0:=(st (fun (x0:fofType)=> (p t))):((p t)->(p t))
% 0.99/1.20 Found (st (fun (x0:fofType)=> (p t))) as proof of ((p t)->(p t))
% 0.99/1.20 Found (st (fun (x0:fofType)=> (p t))) as proof of ((p t)->(p t))
% 0.99/1.20 Found st0:=(st p):((p s)->(p t))
% 0.99/1.20 Found (st p) as proof of ((p s)->(p t))
% 0.99/1.20 Found (st p) as proof of ((p s)->(p t))
% 0.99/1.20 Found ((or_ind10 (st p)) (st (fun (x0:fofType)=> (p t)))) as proof of (p t)
% 0.99/1.20 Found (((or_ind1 (p t)) (st p)) (st (fun (x0:fofType)=> (p t)))) as proof of (p t)
% 0.99/1.20 Found ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p t)) (st p)) (st (fun (x0:fofType)=> (p t)))) as proof of (p t)
% 0.99/1.20 Found ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p t)) (st p)) (st (fun (x0:fofType)=> (p t)))) as proof of (p t)
% 0.99/1.20 Found (x ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p t)) (st p)) (st (fun (x0:fofType)=> (p t))))) as proof of False
% 0.99/1.20 Found (fun (x:((p t)->False))=> (x ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p t)) (st p)) (st (fun (x0:fofType)=> (p t)))))) as proof of False
% 0.99/1.20 Found (fun (x:((p t)->False))=> (x ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p t)) (st p)) (st (fun (x0:fofType)=> (p t)))))) as proof of (((p t)->False)->False)
% 0.99/1.20 Found tu0:=(tu p):((p t)->(p u))
% 0.99/1.20 Found (tu p) as proof of ((p t)->(p u))
% 0.99/1.20 Found (tu p) as proof of ((p t)->(p u))
% 0.99/1.20 Found st0:=(st p):((p s)->(p t))
% 0.99/1.20 Found (st p) as proof of ((p s)->(p t))
% 0.99/1.20 Found (st p) as proof of ((p s)->(p t))
% 0.99/1.20 Found (tu0 (st p)) as proof of ((p s)->(p u))
% 0.99/1.20 Found ((tu (fun (x1:fofType)=> ((p s)->(p x1)))) (st p)) as proof of ((p s)->(p u))
% 0.99/1.20 Found ((tu (fun (x1:fofType)=> ((p s)->(p x1)))) (st p)) as proof of ((p s)->(p u))
% 0.99/1.20 Found ((or_ind10 ((tu (fun (x1:fofType)=> ((p s)->(p x1)))) (st p))) (tu p)) as proof of (p u)
% 0.99/1.20 Found (((or_ind1 (p u)) ((tu (fun (x1:fofType)=> ((p s)->(p x1)))) (st p))) (tu p)) as proof of (p u)
% 0.99/1.20 Found ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p u)) ((tu (fun (x1:fofType)=> ((p s)->(p x1)))) (st p))) (tu p)) as proof of (p u)
% 0.99/1.20 Found ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p u)) ((tu (fun (x1:fofType)=> ((p s)->(p x1)))) (st p))) (tu p)) as proof of (p u)
% 0.99/1.20 Found (x ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p u)) ((tu (fun (x1:fofType)=> ((p s)->(p x1)))) (st p))) (tu p))) as proof of False
% 0.99/1.21 Found (fun (x:((p u)->False))=> (x ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p u)) ((tu (fun (x1:fofType)=> ((p s)->(p x1)))) (st p))) (tu p)))) as proof of False
% 0.99/1.21 Found (fun (x:((p u)->False))=> (x ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p u)) ((tu (fun (x1:fofType)=> ((p s)->(p x1)))) (st p))) (tu p)))) as proof of (((p u)->False)->False)
% 0.99/1.21 Found ((or_ind00 (fun (x:((p u)->False))=> (x ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p u)) ((tu (fun (x1:fofType)=> ((p s)->(p x1)))) (st p))) (tu p))))) (fun (x:((p t)->False))=> (x ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p t)) (st p)) (st (fun (x0:fofType)=> (p t))))))) as proof of False
% 0.99/1.21 Found (((or_ind0 False) (fun (x:((p u)->False))=> (x ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p u)) ((tu (fun (x1:fofType)=> ((p s)->(p x1)))) (st p))) (tu p))))) (fun (x:((p t)->False))=> (x ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p t)) (st p)) (st (fun (x0:fofType)=> (p t))))))) as proof of False
% 0.99/1.21 Found ((((fun (P:Prop) (x:(((p u)->False)->P)) (x0:(((p t)->False)->P))=> ((((((or_ind ((p u)->False)) ((p t)->False)) P) x) x0) puv)) False) (fun (x:((p u)->False))=> (x ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p u)) ((tu (fun (x1:fofType)=> ((p s)->(p x1)))) (st p))) (tu p))))) (fun (x:((p t)->False))=> (x ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p t)) (st p)) (st (fun (x0:fofType)=> (p t))))))) as proof of False
% 0.99/1.21 Found ((((fun (P:Prop) (x:(((p u)->False)->P)) (x0:(((p t)->False)->P))=> ((((((or_ind ((p u)->False)) ((p t)->False)) P) x) x0) puv)) False) (fun (x:((p u)->False))=> (x ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p u)) ((tu (fun (x1:fofType)=> ((p s)->(p x1)))) (st p))) (tu p))))) (fun (x:((p t)->False))=> (x ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p t)) (st p)) (st (fun (x0:fofType)=> (p t))))))) as proof of False
% 0.99/1.21 Got proof ((((fun (P:Prop) (x:(((p u)->False)->P)) (x0:(((p t)->False)->P))=> ((((((or_ind ((p u)->False)) ((p t)->False)) P) x) x0) puv)) False) (fun (x:((p u)->False))=> (x ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p u)) ((tu (fun (x1:fofType)=> ((p s)->(p x1)))) (st p))) (tu p))))) (fun (x:((p t)->False))=> (x ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p t)) (st p)) (st (fun (x0:fofType)=> (p t)))))))
% 0.99/1.21 Time elapsed = 0.626375s
% 0.99/1.21 node=255 cost=165.000000 depth=15
% 0.99/1.21 ::::::::::::::::::::::
% 0.99/1.21 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.99/1.21 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.99/1.21 ((((fun (P:Prop) (x:(((p u)->False)->P)) (x0:(((p t)->False)->P))=> ((((((or_ind ((p u)->False)) ((p t)->False)) P) x) x0) puv)) False) (fun (x:((p u)->False))=> (x ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p u)) ((tu (fun (x1:fofType)=> ((p s)->(p x1)))) (st p))) (tu p))))) (fun (x:((p t)->False))=> (x ((((fun (P:Prop) (x0:((p s)->P)) (x1:((p t)->P))=> ((((((or_ind (p s)) (p t)) P) x0) x1) pst)) (p t)) (st p)) (st (fun (x0:fofType)=> (p t)))))))
% 0.99/1.21 % SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
%------------------------------------------------------------------------------