%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SYO002^1 : TPTP v7.5.0. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % Computer : n015.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:50:22 EDT 2022 % Result : Theorem 0.47s 0.67s % Output : Proof 0.47s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.11/0.11 % Problem : SYO002^1 : TPTP v7.5.0. Released v3.7.0. % 0.11/0.12 % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % 0.12/0.33 % Computer : n015.cluster.edu % 0.12/0.33 % Model : x86_64 x86_64 % 0.12/0.33 % CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.33 % RAMPerCPU : 8042.1875MB % 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.33 % CPULimit : 300 % 0.12/0.33 % DateTime : Thu Mar 10 23:06:47 EST 2022 % 0.12/0.33 % CPUTime : % 0.12/0.34 ModuleCmd_Load.c(213):ERROR:105: Unable to locate a modulefile for 'python/python27' % 0.12/0.34 Python 2.7.5 % 0.47/0.67 Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/'] % 0.47/0.67 FOF formula (<kernel.Constant object at 0x2b12069597a0>, <kernel.DependentProduct object at 0x2b120693c0e0>) of role type named leibeq_decl % 0.47/0.67 Using role type % 0.47/0.67 Declaring leibeq:(fofType->(fofType->Prop)) % 0.47/0.67 FOF formula (((eq (fofType->(fofType->Prop))) leibeq) (fun (X:fofType) (Y:fofType)=> (forall (P:(fofType->Prop)), ((P X)->(P Y))))) of role definition named leibeq % 0.47/0.67 A new definition: (((eq (fofType->(fofType->Prop))) leibeq) (fun (X:fofType) (Y:fofType)=> (forall (P:(fofType->Prop)), ((P X)->(P Y))))) % 0.47/0.67 Defined: leibeq:=(fun (X:fofType) (Y:fofType)=> (forall (P:(fofType->Prop)), ((P X)->(P Y)))) % 0.47/0.67 FOF formula (forall (X:fofType) (Y:fofType) (F:(fofType->fofType)), (((leibeq X) Y)->((leibeq (F X)) (F Y)))) of role conjecture named conj % 0.47/0.67 Conjecture to prove = (forall (X:fofType) (Y:fofType) (F:(fofType->fofType)), (((leibeq X) Y)->((leibeq (F X)) (F Y)))):Prop % 0.47/0.67 Parameter fofType_DUMMY:fofType. % 0.47/0.67 We need to prove ['(forall (X:fofType) (Y:fofType) (F:(fofType->fofType)), (((leibeq X) Y)->((leibeq (F X)) (F Y))))'] % 0.47/0.67 Parameter fofType:Type. % 0.47/0.67 Definition leibeq:=(fun (X:fofType) (Y:fofType)=> (forall (P:(fofType->Prop)), ((P X)->(P Y)))):(fofType->(fofType->Prop)). % 0.47/0.67 Trying to prove (forall (X:fofType) (Y:fofType) (F:(fofType->fofType)), (((leibeq X) Y)->((leibeq (F X)) (F Y)))) % 0.47/0.67 Found x0:=(x (fun (x0:fofType)=> (P (F x0)))):((P (F X))->(P (F Y))) % 0.47/0.67 Found (x (fun (x0:fofType)=> (P (F x0)))) as proof of ((P (F X))->(P (F Y))) % 0.47/0.67 Found (fun (P:(fofType->Prop))=> (x (fun (x0:fofType)=> (P (F x0))))) as proof of ((P (F X))->(P (F Y))) % 0.47/0.67 Found (fun (x:((leibeq X) Y)) (P:(fofType->Prop))=> (x (fun (x0:fofType)=> (P (F x0))))) as proof of ((leibeq (F X)) (F Y)) % 0.47/0.67 Found (fun (F:(fofType->fofType)) (x:((leibeq X) Y)) (P:(fofType->Prop))=> (x (fun (x0:fofType)=> (P (F x0))))) as proof of (((leibeq X) Y)->((leibeq (F X)) (F Y))) % 0.47/0.67 Found (fun (Y:fofType) (F:(fofType->fofType)) (x:((leibeq X) Y)) (P:(fofType->Prop))=> (x (fun (x0:fofType)=> (P (F x0))))) as proof of (forall (F:(fofType->fofType)), (((leibeq X) Y)->((leibeq (F X)) (F Y)))) % 0.47/0.67 Found (fun (X:fofType) (Y:fofType) (F:(fofType->fofType)) (x:((leibeq X) Y)) (P:(fofType->Prop))=> (x (fun (x0:fofType)=> (P (F x0))))) as proof of (forall (Y:fofType) (F:(fofType->fofType)), (((leibeq X) Y)->((leibeq (F X)) (F Y)))) % 0.47/0.67 Found (fun (X:fofType) (Y:fofType) (F:(fofType->fofType)) (x:((leibeq X) Y)) (P:(fofType->Prop))=> (x (fun (x0:fofType)=> (P (F x0))))) as proof of (forall (X:fofType) (Y:fofType) (F:(fofType->fofType)), (((leibeq X) Y)->((leibeq (F X)) (F Y)))) % 0.47/0.67 Got proof (fun (X:fofType) (Y:fofType) (F:(fofType->fofType)) (x:((leibeq X) Y)) (P:(fofType->Prop))=> (x (fun (x0:fofType)=> (P (F x0))))) % 0.47/0.67 Time elapsed = 0.059333s % 0.47/0.67 node=10 cost=-68.000000 depth=6 % 0.47/0.67 :::::::::::::::::::::: % 0.47/0.67 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.47/0.67 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.47/0.67 (fun (X:fofType) (Y:fofType) (F:(fofType->fofType)) (x:((leibeq X) Y)) (P:(fofType->Prop))=> (x (fun (x0:fofType)=> (P (F x0))))) % 0.47/0.67 % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p %------------------------------------------------------------------------------