%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SYO135^5 : TPTP v7.5.0. Released v4.0.0. % Transfm : none % Format : tptp:raw % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % Computer : n026.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:43 EDT 2022 % Result : Theorem 0.75s 0.96s % Output : Proof 0.75s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.08/0.13 % Problem : SYO135^5 : TPTP v7.5.0. Released v4.0.0. % 0.08/0.14 % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.36 % Computer : n026.cluster.edu % 0.13/0.36 % Model : x86_64 x86_64 % 0.13/0.36 % CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.36 % RAMPerCPU : 8042.1875MB % 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.36 % CPULimit : 300 % 0.13/0.36 % DateTime : Fri Mar 11 16:19:05 EST 2022 % 0.13/0.36 % CPUTime : % 0.13/0.37 ModuleCmd_Load.c(213):ERROR:105: Unable to locate a modulefile for 'python/python27' % 0.13/0.37 Python 2.7.5 % 0.75/0.95 Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/'] % 0.75/0.95 FOF formula (<kernel.Constant object at 0x2add6fda5a28>, <kernel.Constant object at 0x2add6fda59e0>) of role type named x % 0.75/0.95 Using role type % 0.75/0.95 Declaring x:fofType % 0.75/0.95 FOF formula (<kernel.Constant object at 0x2add682a8b48>, <kernel.DependentProduct object at 0x2add6fda5fc8>) of role type named cQ % 0.75/0.95 Using role type % 0.75/0.95 Declaring cQ:(fofType->Prop) % 0.75/0.95 FOF formula (<kernel.Constant object at 0x2add682a8b48>, <kernel.Single object at 0x2add6fda5098>) of role type named b % 0.75/0.95 Using role type % 0.75/0.95 Declaring b:fofType % 0.75/0.95 FOF formula (<kernel.Constant object at 0x2add6fda5908>, <kernel.DependentProduct object at 0x2add6fda5d40>) of role type named cP % 0.75/0.95 Using role type % 0.75/0.95 Declaring cP:(fofType->Prop) % 0.75/0.95 FOF formula (<kernel.Constant object at 0x2add6fda5098>, <kernel.Single object at 0x2add6fda5c20>) of role type named a % 0.75/0.95 Using role type % 0.75/0.95 Declaring a:fofType % 0.75/0.95 FOF formula (((or (forall (Xx0:fofType), (cP Xx0))) (cQ x))->((or ((and (cP a)) (cP b))) (cQ x))) of role conjecture named cDUP_BUG % 0.75/0.95 Conjecture to prove = (((or (forall (Xx0:fofType), (cP Xx0))) (cQ x))->((or ((and (cP a)) (cP b))) (cQ x))):Prop % 0.75/0.95 We need to prove ['(((or (forall (Xx0:fofType), (cP Xx0))) (cQ x))->((or ((and (cP a)) (cP b))) (cQ x)))'] % 0.75/0.95 Parameter fofType:Type. % 0.75/0.95 Parameter x:fofType. % 0.75/0.95 Parameter cQ:(fofType->Prop). % 0.75/0.95 Parameter b:fofType. % 0.75/0.95 Parameter cP:(fofType->Prop). % 0.75/0.95 Parameter a:fofType. % 0.75/0.95 Trying to prove (((or (forall (Xx0:fofType), (cP Xx0))) (cQ x))->((or ((and (cP a)) (cP b))) (cQ x))) % 0.75/0.95 Found or_intror00:=(or_intror0 (cQ x)):((cQ x)->((or ((and (cP a)) (cP b))) (cQ x))) % 0.75/0.95 Found (or_intror0 (cQ x)) as proof of ((cQ x)->((or ((and (cP a)) (cP b))) (cQ x))) % 0.75/0.95 Found ((or_intror ((and (cP a)) (cP b))) (cQ x)) as proof of ((cQ x)->((or ((and (cP a)) (cP b))) (cQ x))) % 0.75/0.95 Found ((or_intror ((and (cP a)) (cP b))) (cQ x)) as proof of ((cQ x)->((or ((and (cP a)) (cP b))) (cQ x))) % 0.75/0.95 Found or_introl00:=(or_introl0 ((and (cP a)) (cP b))):((cQ x)->((or (cQ x)) ((and (cP a)) (cP b)))) % 0.75/0.95 Found (or_introl0 ((and (cP a)) (cP b))) as proof of ((cQ x)->((or (cQ x)) ((and (cP a)) (cP b)))) % 0.75/0.95 Found ((or_introl (cQ x)) ((and (cP a)) (cP b))) as proof of ((cQ x)->((or (cQ x)) ((and (cP a)) (cP b)))) % 0.75/0.95 Found ((or_introl (cQ x)) ((and (cP a)) (cP b))) as proof of ((cQ x)->((or (cQ x)) ((and (cP a)) (cP b)))) % 0.75/0.95 Found x00:(cQ x) % 0.75/0.95 Found (fun (x00:(cQ x))=> x00) as proof of (cQ x) % 0.75/0.95 Found (fun (x00:(cQ x))=> x00) as proof of ((cQ x)->(cQ x)) % 0.75/0.95 Found x000:=(x00 a):(cP a) % 0.75/0.95 Found (x00 a) as proof of (cP a) % 0.75/0.95 Found (x00 a) as proof of (cP a) % 0.75/0.95 Found x000:=(x00 b):(cP b) % 0.75/0.95 Found (x00 b) as proof of (cP b) % 0.75/0.95 Found (x00 b) as proof of (cP b) % 0.75/0.95 Found ((conj00 (x00 a)) (x00 b)) as proof of ((and (cP a)) (cP b)) % 0.75/0.95 Found (((conj0 (cP b)) (x00 a)) (x00 b)) as proof of ((and (cP a)) (cP b)) % 0.75/0.95 Found ((((conj (cP a)) (cP b)) (x00 a)) (x00 b)) as proof of ((and (cP a)) (cP b)) % 0.75/0.95 Found ((((conj (cP a)) (cP b)) (x00 a)) (x00 b)) as proof of ((and (cP a)) (cP b)) % 0.75/0.95 Found (or_introl00 ((((conj (cP a)) (cP b)) (x00 a)) (x00 b))) as proof of ((or ((and (cP a)) (cP b))) (cQ x)) % 0.75/0.95 Found ((or_introl0 (cQ x)) ((((conj (cP a)) (cP b)) (x00 a)) (x00 b))) as proof of ((or ((and (cP a)) (cP b))) (cQ x)) % 0.75/0.95 Found (((or_introl ((and (cP a)) (cP b))) (cQ x)) ((((conj (cP a)) (cP b)) (x00 a)) (x00 b))) as proof of ((or ((and (cP a)) (cP b))) (cQ x)) % 0.75/0.95 Found (fun (x00:(forall (Xx0:fofType), (cP Xx0)))=> (((or_introl ((and (cP a)) (cP b))) (cQ x)) ((((conj (cP a)) (cP b)) (x00 a)) (x00 b)))) as proof of ((or ((and (cP a)) (cP b))) (cQ x)) % 0.75/0.95 Found (fun (x00:(forall (Xx0:fofType), (cP Xx0)))=> (((or_introl ((and (cP a)) (cP b))) (cQ x)) ((((conj (cP a)) (cP b)) (x00 a)) (x00 b)))) as proof of ((forall (Xx0:fofType), (cP Xx0))->((or ((and (cP a)) (cP b))) (cQ x))) % 0.75/0.95 Found ((or_ind00 (fun (x00:(forall (Xx0:fofType), (cP Xx0)))=> (((or_introl ((and (cP a)) (cP b))) (cQ x)) ((((conj (cP a)) (cP b)) (x00 a)) (x00 b))))) ((or_intror ((and (cP a)) (cP b))) (cQ x))) as proof of ((or ((and (cP a)) (cP b))) (cQ x)) % 0.75/0.95 Found (((or_ind0 ((or ((and (cP a)) (cP b))) (cQ x))) (fun (x00:(forall (Xx0:fofType), (cP Xx0)))=> (((or_introl ((and (cP a)) (cP b))) (cQ x)) ((((conj (cP a)) (cP b)) (x00 a)) (x00 b))))) ((or_intror ((and (cP a)) (cP b))) (cQ x))) as proof of ((or ((and (cP a)) (cP b))) (cQ x)) % 0.75/0.96 Found ((((fun (P:Prop) (x1:((forall (Xx0:fofType), (cP Xx0))->P)) (x2:((cQ x)->P))=> ((((((or_ind (forall (Xx0:fofType), (cP Xx0))) (cQ x)) P) x1) x2) x0)) ((or ((and (cP a)) (cP b))) (cQ x))) (fun (x00:(forall (Xx0:fofType), (cP Xx0)))=> (((or_introl ((and (cP a)) (cP b))) (cQ x)) ((((conj (cP a)) (cP b)) (x00 a)) (x00 b))))) ((or_intror ((and (cP a)) (cP b))) (cQ x))) as proof of ((or ((and (cP a)) (cP b))) (cQ x)) % 0.75/0.96 Found (fun (x0:((or (forall (Xx0:fofType), (cP Xx0))) (cQ x)))=> ((((fun (P:Prop) (x1:((forall (Xx0:fofType), (cP Xx0))->P)) (x2:((cQ x)->P))=> ((((((or_ind (forall (Xx0:fofType), (cP Xx0))) (cQ x)) P) x1) x2) x0)) ((or ((and (cP a)) (cP b))) (cQ x))) (fun (x00:(forall (Xx0:fofType), (cP Xx0)))=> (((or_introl ((and (cP a)) (cP b))) (cQ x)) ((((conj (cP a)) (cP b)) (x00 a)) (x00 b))))) ((or_intror ((and (cP a)) (cP b))) (cQ x)))) as proof of ((or ((and (cP a)) (cP b))) (cQ x)) % 0.75/0.96 Found (fun (x0:((or (forall (Xx0:fofType), (cP Xx0))) (cQ x)))=> ((((fun (P:Prop) (x1:((forall (Xx0:fofType), (cP Xx0))->P)) (x2:((cQ x)->P))=> ((((((or_ind (forall (Xx0:fofType), (cP Xx0))) (cQ x)) P) x1) x2) x0)) ((or ((and (cP a)) (cP b))) (cQ x))) (fun (x00:(forall (Xx0:fofType), (cP Xx0)))=> (((or_introl ((and (cP a)) (cP b))) (cQ x)) ((((conj (cP a)) (cP b)) (x00 a)) (x00 b))))) ((or_intror ((and (cP a)) (cP b))) (cQ x)))) as proof of (((or (forall (Xx0:fofType), (cP Xx0))) (cQ x))->((or ((and (cP a)) (cP b))) (cQ x))) % 0.75/0.96 Got proof (fun (x0:((or (forall (Xx0:fofType), (cP Xx0))) (cQ x)))=> ((((fun (P:Prop) (x1:((forall (Xx0:fofType), (cP Xx0))->P)) (x2:((cQ x)->P))=> ((((((or_ind (forall (Xx0:fofType), (cP Xx0))) (cQ x)) P) x1) x2) x0)) ((or ((and (cP a)) (cP b))) (cQ x))) (fun (x00:(forall (Xx0:fofType), (cP Xx0)))=> (((or_introl ((and (cP a)) (cP b))) (cQ x)) ((((conj (cP a)) (cP b)) (x00 a)) (x00 b))))) ((or_intror ((and (cP a)) (cP b))) (cQ x)))) % 0.75/0.96 Time elapsed = 0.299982s % 0.75/0.96 node=116 cost=235.000000 depth=15 % 0.75/0.96 :::::::::::::::::::::: % 0.75/0.96 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.75/0.96 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % 0.75/0.96 (fun (x0:((or (forall (Xx0:fofType), (cP Xx0))) (cQ x)))=> ((((fun (P:Prop) (x1:((forall (Xx0:fofType), (cP Xx0))->P)) (x2:((cQ x)->P))=> ((((((or_ind (forall (Xx0:fofType), (cP Xx0))) (cQ x)) P) x1) x2) x0)) ((or ((and (cP a)) (cP b))) (cQ x))) (fun (x00:(forall (Xx0:fofType), (cP Xx0)))=> (((or_introl ((and (cP a)) (cP b))) (cQ x)) ((((conj (cP a)) (cP b)) (x00 a)) (x00 b))))) ((or_intror ((and (cP a)) (cP b))) (cQ x)))) % 0.75/0.96 % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p %------------------------------------------------------------------------------