%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SYO308^5 : TPTP v7.5.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : python CASC.py /export/starexec/sandbox2/benchmark/theBenchmark.p % Computer : n021.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:51:08 EDT 2022 % Result : Theorem 0.70s 0.93s % Output : Proof 0.70s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SYO308^5 : TPTP v7.5.0. Released v4.0.0. % 0.03/0.11 % Command : python CASC.py /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.11/0.32 % Computer : n021.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % RAMPerCPU : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.32 % DateTime : Sat Mar 12 02:26:09 EST 2022 % 0.11/0.33 % CPUTime : % 0.11/0.33 ModuleCmd_Load.c(213):ERROR:105: Unable to locate a modulefile for 'python/python27' % 0.11/0.34 Python 2.7.5 % 0.70/0.92 Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox2/benchmark/', '/export/starexec/sandbox2/benchmark/'] % 0.70/0.92 FOF formula (<kernel.Constant object at 0x1ed12d8>, <kernel.DependentProduct object at 0x1ed14d0>) of role type named cB % 0.70/0.92 Using role type % 0.70/0.92 Declaring cB:(fofType->Prop) % 0.70/0.92 FOF formula (<kernel.Constant object at 0x1ed5f80>, <kernel.DependentProduct object at 0x1ed1638>) of role type named cA % 0.70/0.92 Using role type % 0.70/0.92 Declaring cA:(fofType->Prop) % 0.70/0.92 FOF formula (forall (Z1:(fofType->Prop)), (((or (forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))) (forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))->(forall (Z5:fofType), ((Z1 Z5)->((or (cA Z5)) (cB Z5)))))) of role conjecture named cSET81_pme % 0.70/0.92 Conjecture to prove = (forall (Z1:(fofType->Prop)), (((or (forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))) (forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))->(forall (Z5:fofType), ((Z1 Z5)->((or (cA Z5)) (cB Z5)))))):Prop % 0.70/0.92 Parameter fofType_DUMMY:fofType. % 0.70/0.92 We need to prove ['(forall (Z1:(fofType->Prop)), (((or (forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))) (forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))->(forall (Z5:fofType), ((Z1 Z5)->((or (cA Z5)) (cB Z5))))))'] % 0.70/0.92 Parameter fofType:Type. % 0.70/0.92 Parameter cB:(fofType->Prop). % 0.70/0.92 Parameter cA:(fofType->Prop). % 0.70/0.92 Trying to prove (forall (Z1:(fofType->Prop)), (((or (forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))) (forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))->(forall (Z5:fofType), ((Z1 Z5)->((or (cA Z5)) (cB Z5)))))) % 0.70/0.92 Found x100:=(x10 x0):(cA Z5) % 0.70/0.92 Found (x10 x0) as proof of (cA Z5) % 0.70/0.92 Found ((x1 Z5) x0) as proof of (cA Z5) % 0.70/0.92 Found (fun (x1:(forall (Z3:fofType), ((Z1 Z3)->(cA Z3))))=> ((x1 Z5) x0)) as proof of (cA Z5) % 0.70/0.92 Found (fun (x1:(forall (Z3:fofType), ((Z1 Z3)->(cA Z3))))=> ((x1 Z5) x0)) as proof of ((forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))->(cA Z5)) % 0.70/0.92 Found x100:=(x10 x0):(cB Z5) % 0.70/0.92 Found (x10 x0) as proof of (cB Z5) % 0.70/0.92 Found ((x1 Z5) x0) as proof of (cB Z5) % 0.70/0.92 Found (fun (x1:(forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))=> ((x1 Z5) x0)) as proof of (cB Z5) % 0.70/0.92 Found (fun (x1:(forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))=> ((x1 Z5) x0)) as proof of ((forall (Z4:fofType), ((Z1 Z4)->(cB Z4)))->(cB Z5)) % 0.70/0.92 Found x100:=(x10 x0):(cB Z5) % 0.70/0.92 Found (x10 x0) as proof of (cB Z5) % 0.70/0.92 Found ((x1 Z5) x0) as proof of (cB Z5) % 0.70/0.92 Found ((x1 Z5) x0) as proof of (cB Z5) % 0.70/0.92 Found (or_intror00 ((x1 Z5) x0)) as proof of ((or (cA Z5)) (cB Z5)) % 0.70/0.92 Found ((or_intror0 (cB Z5)) ((x1 Z5) x0)) as proof of ((or (cA Z5)) (cB Z5)) % 0.70/0.92 Found (((or_intror (cA Z5)) (cB Z5)) ((x1 Z5) x0)) as proof of ((or (cA Z5)) (cB Z5)) % 0.70/0.92 Found (fun (x1:(forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))=> (((or_intror (cA Z5)) (cB Z5)) ((x1 Z5) x0))) as proof of ((or (cA Z5)) (cB Z5)) % 0.70/0.92 Found (fun (x1:(forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))=> (((or_intror (cA Z5)) (cB Z5)) ((x1 Z5) x0))) as proof of ((forall (Z4:fofType), ((Z1 Z4)->(cB Z4)))->((or (cA Z5)) (cB Z5))) % 0.70/0.92 Found x100:=(x10 x0):(cA Z5) % 0.70/0.92 Found (x10 x0) as proof of (cA Z5) % 0.70/0.92 Found ((x1 Z5) x0) as proof of (cA Z5) % 0.70/0.92 Found ((x1 Z5) x0) as proof of (cA Z5) % 0.70/0.92 Found (or_introl00 ((x1 Z5) x0)) as proof of ((or (cA Z5)) (cB Z5)) % 0.70/0.92 Found ((or_introl0 (cB Z5)) ((x1 Z5) x0)) as proof of ((or (cA Z5)) (cB Z5)) % 0.70/0.92 Found (((or_introl (cA Z5)) (cB Z5)) ((x1 Z5) x0)) as proof of ((or (cA Z5)) (cB Z5)) % 0.70/0.92 Found (fun (x1:(forall (Z3:fofType), ((Z1 Z3)->(cA Z3))))=> (((or_introl (cA Z5)) (cB Z5)) ((x1 Z5) x0))) as proof of ((or (cA Z5)) (cB Z5)) % 0.70/0.92 Found (fun (x1:(forall (Z3:fofType), ((Z1 Z3)->(cA Z3))))=> (((or_introl (cA Z5)) (cB Z5)) ((x1 Z5) x0))) as proof of ((forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))->((or (cA Z5)) (cB Z5))) % 0.70/0.92 Found ((or_ind00 (fun (x1:(forall (Z3:fofType), ((Z1 Z3)->(cA Z3))))=> (((or_introl (cA Z5)) (cB Z5)) ((x1 Z5) x0)))) (fun (x1:(forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))=> (((or_intror (cA Z5)) (cB Z5)) ((x1 Z5) x0)))) as proof of ((or (cA Z5)) (cB Z5)) % 0.70/0.92 Found (((or_ind0 ((or (cA Z5)) (cB Z5))) (fun (x1:(forall (Z3:fofType), ((Z1 Z3)->(cA Z3))))=> (((or_introl (cA Z5)) (cB Z5)) ((x1 Z5) x0)))) (fun (x1:(forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))=> (((or_intror (cA Z5)) (cB Z5)) ((x1 Z5) x0)))) as proof of ((or (cA Z5)) (cB Z5)) % 0.70/0.92 Found ((((fun (P:Prop) (x1:((forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))->P)) (x2:((forall (Z4:fofType), ((Z1 Z4)->(cB Z4)))->P))=> ((((((or_ind (forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))) (forall (Z4:fofType), ((Z1 Z4)->(cB Z4)))) P) x1) x2) x)) ((or (cA Z5)) (cB Z5))) (fun (x1:(forall (Z3:fofType), ((Z1 Z3)->(cA Z3))))=> (((or_introl (cA Z5)) (cB Z5)) ((x1 Z5) x0)))) (fun (x1:(forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))=> (((or_intror (cA Z5)) (cB Z5)) ((x1 Z5) x0)))) as proof of ((or (cA Z5)) (cB Z5)) % 0.70/0.92 Found (fun (x0:(Z1 Z5))=> ((((fun (P:Prop) (x1:((forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))->P)) (x2:((forall (Z4:fofType), ((Z1 Z4)->(cB Z4)))->P))=> ((((((or_ind (forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))) (forall (Z4:fofType), ((Z1 Z4)->(cB Z4)))) P) x1) x2) x)) ((or (cA Z5)) (cB Z5))) (fun (x1:(forall (Z3:fofType), ((Z1 Z3)->(cA Z3))))=> (((or_introl (cA Z5)) (cB Z5)) ((x1 Z5) x0)))) (fun (x1:(forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))=> (((or_intror (cA Z5)) (cB Z5)) ((x1 Z5) x0))))) as proof of ((or (cA Z5)) (cB Z5)) % 0.70/0.92 Found (fun (Z5:fofType) (x0:(Z1 Z5))=> ((((fun (P:Prop) (x1:((forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))->P)) (x2:((forall (Z4:fofType), ((Z1 Z4)->(cB Z4)))->P))=> ((((((or_ind (forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))) (forall (Z4:fofType), ((Z1 Z4)->(cB Z4)))) P) x1) x2) x)) ((or (cA Z5)) (cB Z5))) (fun (x1:(forall (Z3:fofType), ((Z1 Z3)->(cA Z3))))=> (((or_introl (cA Z5)) (cB Z5)) ((x1 Z5) x0)))) (fun (x1:(forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))=> (((or_intror (cA Z5)) (cB Z5)) ((x1 Z5) x0))))) as proof of ((Z1 Z5)->((or (cA Z5)) (cB Z5))) % 0.70/0.92 Found (fun (x:((or (forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))) (forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))) (Z5:fofType) (x0:(Z1 Z5))=> ((((fun (P:Prop) (x1:((forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))->P)) (x2:((forall (Z4:fofType), ((Z1 Z4)->(cB Z4)))->P))=> ((((((or_ind (forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))) (forall (Z4:fofType), ((Z1 Z4)->(cB Z4)))) P) x1) x2) x)) ((or (cA Z5)) (cB Z5))) (fun (x1:(forall (Z3:fofType), ((Z1 Z3)->(cA Z3))))=> (((or_introl (cA Z5)) (cB Z5)) ((x1 Z5) x0)))) (fun (x1:(forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))=> (((or_intror (cA Z5)) (cB Z5)) ((x1 Z5) x0))))) as proof of (forall (Z5:fofType), ((Z1 Z5)->((or (cA Z5)) (cB Z5)))) % 0.70/0.92 Found (fun (Z1:(fofType->Prop)) (x:((or (forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))) (forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))) (Z5:fofType) (x0:(Z1 Z5))=> ((((fun (P:Prop) (x1:((forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))->P)) (x2:((forall (Z4:fofType), ((Z1 Z4)->(cB Z4)))->P))=> ((((((or_ind (forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))) (forall (Z4:fofType), ((Z1 Z4)->(cB Z4)))) P) x1) x2) x)) ((or (cA Z5)) (cB Z5))) (fun (x1:(forall (Z3:fofType), ((Z1 Z3)->(cA Z3))))=> (((or_introl (cA Z5)) (cB Z5)) ((x1 Z5) x0)))) (fun (x1:(forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))=> (((or_intror (cA Z5)) (cB Z5)) ((x1 Z5) x0))))) as proof of (((or (forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))) (forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))->(forall (Z5:fofType), ((Z1 Z5)->((or (cA Z5)) (cB Z5))))) % 0.70/0.92 Found (fun (Z1:(fofType->Prop)) (x:((or (forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))) (forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))) (Z5:fofType) (x0:(Z1 Z5))=> ((((fun (P:Prop) (x1:((forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))->P)) (x2:((forall (Z4:fofType), ((Z1 Z4)->(cB Z4)))->P))=> ((((((or_ind (forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))) (forall (Z4:fofType), ((Z1 Z4)->(cB Z4)))) P) x1) x2) x)) ((or (cA Z5)) (cB Z5))) (fun (x1:(forall (Z3:fofType), ((Z1 Z3)->(cA Z3))))=> (((or_introl (cA Z5)) (cB Z5)) ((x1 Z5) x0)))) (fun (x1:(forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))=> (((or_intror (cA Z5)) (cB Z5)) ((x1 Z5) x0))))) as proof of (forall (Z1:(fofType->Prop)), (((or (forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))) (forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))->(forall (Z5:fofType), ((Z1 Z5)->((or (cA Z5)) (cB Z5)))))) % 0.70/0.92 Got proof (fun (Z1:(fofType->Prop)) (x:((or (forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))) (forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))) (Z5:fofType) (x0:(Z1 Z5))=> ((((fun (P:Prop) (x1:((forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))->P)) (x2:((forall (Z4:fofType), ((Z1 Z4)->(cB Z4)))->P))=> ((((((or_ind (forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))) (forall (Z4:fofType), ((Z1 Z4)->(cB Z4)))) P) x1) x2) x)) ((or (cA Z5)) (cB Z5))) (fun (x1:(forall (Z3:fofType), ((Z1 Z3)->(cA Z3))))=> (((or_introl (cA Z5)) (cB Z5)) ((x1 Z5) x0)))) (fun (x1:(forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))=> (((or_intror (cA Z5)) (cB Z5)) ((x1 Z5) x0))))) % 0.70/0.93 Time elapsed = 0.342700s % 0.70/0.93 node=117 cost=294.000000 depth=15 % 0.70/0.93 :::::::::::::::::::::: % 0.70/0.93 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.70/0.93 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.70/0.93 (fun (Z1:(fofType->Prop)) (x:((or (forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))) (forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))) (Z5:fofType) (x0:(Z1 Z5))=> ((((fun (P:Prop) (x1:((forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))->P)) (x2:((forall (Z4:fofType), ((Z1 Z4)->(cB Z4)))->P))=> ((((((or_ind (forall (Z3:fofType), ((Z1 Z3)->(cA Z3)))) (forall (Z4:fofType), ((Z1 Z4)->(cB Z4)))) P) x1) x2) x)) ((or (cA Z5)) (cB Z5))) (fun (x1:(forall (Z3:fofType), ((Z1 Z3)->(cA Z3))))=> (((or_introl (cA Z5)) (cB Z5)) ((x1 Z5) x0)))) (fun (x1:(forall (Z4:fofType), ((Z1 Z4)->(cB Z4))))=> (((or_intror (cA Z5)) (cB Z5)) ((x1 Z5) x0))))) % 0.70/0.93 % SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p %------------------------------------------------------------------------------