%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SYO124^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 : n024.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:41 EDT 2022 % Result : Theorem 1.07s 1.24s % Output : Proof 1.07s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SYO124^5 : TPTP v7.5.0. Released v4.0.0. % 0.07/0.12 % Command : python CASC.py /export/starexec/sandbox/benchmark/theBenchmark.p % 0.13/0.33 % Computer : n024.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 : Fri Mar 11 15:48:34 EST 2022 % 0.13/0.34 % CPUTime : % 0.13/0.34 ModuleCmd_Load.c(213):ERROR:105: Unable to locate a modulefile for 'python/python27' % 0.13/0.35 Python 2.7.5 % 1.06/1.23 Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox/benchmark/', '/export/starexec/sandbox/benchmark/'] % 1.06/1.23 FOF formula (<kernel.Constant object at 0x2239cf8>, <kernel.Sort object at 0x2b834be0c638>) of role type named cQ % 1.06/1.23 Using role type % 1.06/1.23 Declaring cQ:Prop % 1.06/1.23 FOF formula (<kernel.Constant object at 0x2239248>, <kernel.Sort object at 0x2b834be0c638>) of role type named cR % 1.06/1.23 Using role type % 1.06/1.23 Declaring cR:Prop % 1.06/1.23 FOF formula (<kernel.Constant object at 0x2239518>, <kernel.Sort object at 0x2b834be0c638>) of role type named cP % 1.06/1.23 Using role type % 1.06/1.23 Declaring cP:Prop % 1.06/1.23 FOF formula (((and cP) ((or cR) cQ))->((or ((and cP) cR)) cQ)) of role conjecture named cDISJ_BUG % 1.06/1.23 Conjecture to prove = (((and cP) ((or cR) cQ))->((or ((and cP) cR)) cQ)):Prop % 1.06/1.23 We need to prove ['(((and cP) ((or cR) cQ))->((or ((and cP) cR)) cQ))'] % 1.06/1.23 Parameter cQ:Prop. % 1.06/1.23 Parameter cR:Prop. % 1.06/1.23 Parameter cP:Prop. % 1.06/1.23 Trying to prove (((and cP) ((or cR) cQ))->((or ((and cP) cR)) cQ)) % 1.06/1.23 Found or_intror00:=(or_intror0 cQ):(cQ->((or ((and cP) cR)) cQ)) % 1.06/1.23 Found (or_intror0 cQ) as proof of (cQ->((or ((and cP) cR)) cQ)) % 1.06/1.23 Found ((or_intror ((and cP) cR)) cQ) as proof of (cQ->((or ((and cP) cR)) cQ)) % 1.06/1.23 Found ((or_intror ((and cP) cR)) cQ) as proof of (cQ->((or ((and cP) cR)) cQ)) % 1.06/1.23 Found or_introl00:=(or_introl0 ((and cP) cR)):(cQ->((or cQ) ((and cP) cR))) % 1.06/1.23 Found (or_introl0 ((and cP) cR)) as proof of (cQ->((or cQ) ((and cP) cR))) % 1.06/1.23 Found ((or_introl cQ) ((and cP) cR)) as proof of (cQ->((or cQ) ((and cP) cR))) % 1.06/1.23 Found ((or_introl cQ) ((and cP) cR)) as proof of (cQ->((or cQ) ((and cP) cR))) % 1.06/1.23 Found or_introl00:=(or_introl0 ((and cP) cR)):(cQ->((or cQ) ((and cP) cR))) % 1.06/1.23 Found (or_introl0 ((and cP) cR)) as proof of (cQ->((or cQ) ((and cP) cR))) % 1.06/1.23 Found ((or_introl cQ) ((and cP) cR)) as proof of (cQ->((or cQ) ((and cP) cR))) % 1.06/1.23 Found ((or_introl cQ) ((and cP) cR)) as proof of (cQ->((or cQ) ((and cP) cR))) % 1.06/1.23 Found x0:cP % 1.06/1.23 Found x0 as proof of cP % 1.06/1.23 Found x2:cQ % 1.06/1.23 Found (fun (x2:cQ)=> x2) as proof of cQ % 1.06/1.23 Found (fun (x2:cQ)=> x2) as proof of (cQ->cQ) % 1.06/1.23 Found x2:cQ % 1.06/1.23 Found (fun (x2:cQ)=> x2) as proof of cQ % 1.06/1.23 Found (fun (x2:cQ)=> x2) as proof of (cQ->cQ) % 1.06/1.23 Found x0:cP % 1.06/1.23 Found x0 as proof of cP % 1.06/1.23 Found conj0000:=(conj000 x2):((and cP) cR) % 1.06/1.23 Found (conj000 x2) as proof of ((and cP) cR) % 1.06/1.23 Found ((conj00 cR) x2) as proof of ((and cP) cR) % 1.06/1.23 Found (((fun (B:Prop)=> ((conj0 B) x0)) cR) x2) as proof of ((and cP) cR) % 1.06/1.23 Found (((fun (B:Prop)=> (((conj cP) B) x0)) cR) x2) as proof of ((and cP) cR) % 1.06/1.23 Found (((fun (B:Prop)=> (((conj cP) B) x0)) cR) x2) as proof of ((and cP) cR) % 1.06/1.23 Found (or_introl00 (((fun (B:Prop)=> (((conj cP) B) x0)) cR) x2)) as proof of ((or ((and cP) cR)) cQ) % 1.06/1.23 Found ((or_introl0 cQ) (((fun (B:Prop)=> (((conj cP) B) x0)) cR) x2)) as proof of ((or ((and cP) cR)) cQ) % 1.06/1.23 Found (((or_introl ((and cP) cR)) cQ) (((fun (B:Prop)=> (((conj cP) B) x0)) cR) x2)) as proof of ((or ((and cP) cR)) cQ) % 1.06/1.23 Found (fun (x2:cR)=> (((or_introl ((and cP) cR)) cQ) (((fun (B:Prop)=> (((conj cP) B) x0)) cR) x2))) as proof of ((or ((and cP) cR)) cQ) % 1.06/1.23 Found (fun (x2:cR)=> (((or_introl ((and cP) cR)) cQ) (((fun (B:Prop)=> (((conj cP) B) x0)) cR) x2))) as proof of (cR->((or ((and cP) cR)) cQ)) % 1.06/1.23 Found ((or_ind00 (fun (x2:cR)=> (((or_introl ((and cP) cR)) cQ) (((fun (B:Prop)=> (((conj cP) B) x0)) cR) x2)))) ((or_intror ((and cP) cR)) cQ)) as proof of ((or ((and cP) cR)) cQ) % 1.06/1.23 Found (((or_ind0 ((or ((and cP) cR)) cQ)) (fun (x2:cR)=> (((or_introl ((and cP) cR)) cQ) (((fun (B:Prop)=> (((conj cP) B) x0)) cR) x2)))) ((or_intror ((and cP) cR)) cQ)) as proof of ((or ((and cP) cR)) cQ) % 1.06/1.23 Found ((((fun (P:Prop) (x2:(cR->P)) (x3:(cQ->P))=> ((((((or_ind cR) cQ) P) x2) x3) x1)) ((or ((and cP) cR)) cQ)) (fun (x2:cR)=> (((or_introl ((and cP) cR)) cQ) (((fun (B:Prop)=> (((conj cP) B) x0)) cR) x2)))) ((or_intror ((and cP) cR)) cQ)) as proof of ((or ((and cP) cR)) cQ) % 1.06/1.23 Found (fun (x1:((or cR) cQ))=> ((((fun (P:Prop) (x2:(cR->P)) (x3:(cQ->P))=> ((((((or_ind cR) cQ) P) x2) x3) x1)) ((or ((and cP) cR)) cQ)) (fun (x2:cR)=> (((or_introl ((and cP) cR)) cQ) (((fun (B:Prop)=> (((conj cP) B) x0)) cR) x2)))) ((or_intror ((and cP) cR)) cQ))) as proof of ((or ((and cP) cR)) cQ) % 1.06/1.23 Found (fun (x0:cP) (x1:((or cR) cQ))=> ((((fun (P:Prop) (x2:(cR->P)) (x3:(cQ->P))=> ((((((or_ind cR) cQ) P) x2) x3) x1)) ((or ((and cP) cR)) cQ)) (fun (x2:cR)=> (((or_introl ((and cP) cR)) cQ) (((fun (B:Prop)=> (((conj cP) B) x0)) cR) x2)))) ((or_intror ((and cP) cR)) cQ))) as proof of (((or cR) cQ)->((or ((and cP) cR)) cQ)) % 1.07/1.24 Found (fun (x0:cP) (x1:((or cR) cQ))=> ((((fun (P:Prop) (x2:(cR->P)) (x3:(cQ->P))=> ((((((or_ind cR) cQ) P) x2) x3) x1)) ((or ((and cP) cR)) cQ)) (fun (x2:cR)=> (((or_introl ((and cP) cR)) cQ) (((fun (B:Prop)=> (((conj cP) B) x0)) cR) x2)))) ((or_intror ((and cP) cR)) cQ))) as proof of (cP->(((or cR) cQ)->((or ((and cP) cR)) cQ))) % 1.07/1.24 Found (and_rect00 (fun (x0:cP) (x1:((or cR) cQ))=> ((((fun (P:Prop) (x2:(cR->P)) (x3:(cQ->P))=> ((((((or_ind cR) cQ) P) x2) x3) x1)) ((or ((and cP) cR)) cQ)) (fun (x2:cR)=> (((or_introl ((and cP) cR)) cQ) (((fun (B:Prop)=> (((conj cP) B) x0)) cR) x2)))) ((or_intror ((and cP) cR)) cQ)))) as proof of ((or ((and cP) cR)) cQ) % 1.07/1.24 Found ((and_rect0 ((or ((and cP) cR)) cQ)) (fun (x0:cP) (x1:((or cR) cQ))=> ((((fun (P:Prop) (x2:(cR->P)) (x3:(cQ->P))=> ((((((or_ind cR) cQ) P) x2) x3) x1)) ((or ((and cP) cR)) cQ)) (fun (x2:cR)=> (((or_introl ((and cP) cR)) cQ) (((fun (B:Prop)=> (((conj cP) B) x0)) cR) x2)))) ((or_intror ((and cP) cR)) cQ)))) as proof of ((or ((and cP) cR)) cQ) % 1.07/1.24 Found (((fun (P:Type) (x0:(cP->(((or cR) cQ)->P)))=> (((((and_rect cP) ((or cR) cQ)) P) x0) x)) ((or ((and cP) cR)) cQ)) (fun (x0:cP) (x1:((or cR) cQ))=> ((((fun (P:Prop) (x2:(cR->P)) (x3:(cQ->P))=> ((((((or_ind cR) cQ) P) x2) x3) x1)) ((or ((and cP) cR)) cQ)) (fun (x2:cR)=> (((or_introl ((and cP) cR)) cQ) (((fun (B:Prop)=> (((conj cP) B) x0)) cR) x2)))) ((or_intror ((and cP) cR)) cQ)))) as proof of ((or ((and cP) cR)) cQ) % 1.07/1.24 Found (fun (x:((and cP) ((or cR) cQ)))=> (((fun (P:Type) (x0:(cP->(((or cR) cQ)->P)))=> (((((and_rect cP) ((or cR) cQ)) P) x0) x)) ((or ((and cP) cR)) cQ)) (fun (x0:cP) (x1:((or cR) cQ))=> ((((fun (P:Prop) (x2:(cR->P)) (x3:(cQ->P))=> ((((((or_ind cR) cQ) P) x2) x3) x1)) ((or ((and cP) cR)) cQ)) (fun (x2:cR)=> (((or_introl ((and cP) cR)) cQ) (((fun (B:Prop)=> (((conj cP) B) x0)) cR) x2)))) ((or_intror ((and cP) cR)) cQ))))) as proof of ((or ((and cP) cR)) cQ) % 1.07/1.24 Found (fun (x:((and cP) ((or cR) cQ)))=> (((fun (P:Type) (x0:(cP->(((or cR) cQ)->P)))=> (((((and_rect cP) ((or cR) cQ)) P) x0) x)) ((or ((and cP) cR)) cQ)) (fun (x0:cP) (x1:((or cR) cQ))=> ((((fun (P:Prop) (x2:(cR->P)) (x3:(cQ->P))=> ((((((or_ind cR) cQ) P) x2) x3) x1)) ((or ((and cP) cR)) cQ)) (fun (x2:cR)=> (((or_introl ((and cP) cR)) cQ) (((fun (B:Prop)=> (((conj cP) B) x0)) cR) x2)))) ((or_intror ((and cP) cR)) cQ))))) as proof of (((and cP) ((or cR) cQ))->((or ((and cP) cR)) cQ)) % 1.07/1.24 Got proof (fun (x:((and cP) ((or cR) cQ)))=> (((fun (P:Type) (x0:(cP->(((or cR) cQ)->P)))=> (((((and_rect cP) ((or cR) cQ)) P) x0) x)) ((or ((and cP) cR)) cQ)) (fun (x0:cP) (x1:((or cR) cQ))=> ((((fun (P:Prop) (x2:(cR->P)) (x3:(cQ->P))=> ((((((or_ind cR) cQ) P) x2) x3) x1)) ((or ((and cP) cR)) cQ)) (fun (x2:cR)=> (((or_introl ((and cP) cR)) cQ) (((fun (B:Prop)=> (((conj cP) B) x0)) cR) x2)))) ((or_intror ((and cP) cR)) cQ))))) % 1.07/1.24 Time elapsed = 0.614054s % 1.07/1.24 node=265 cost=484.000000 depth=20 % 1.07/1.24 :::::::::::::::::::::: % 1.07/1.24 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.07/1.24 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p % 1.07/1.24 (fun (x:((and cP) ((or cR) cQ)))=> (((fun (P:Type) (x0:(cP->(((or cR) cQ)->P)))=> (((((and_rect cP) ((or cR) cQ)) P) x0) x)) ((or ((and cP) cR)) cQ)) (fun (x0:cP) (x1:((or cR) cQ))=> ((((fun (P:Prop) (x2:(cR->P)) (x3:(cQ->P))=> ((((((or_ind cR) cQ) P) x2) x3) x1)) ((or ((and cP) cR)) cQ)) (fun (x2:cR)=> (((or_introl ((and cP) cR)) cQ) (((fun (B:Prop)=> (((conj cP) B) x0)) cR) x2)))) ((or_intror ((and cP) cR)) cQ))))) % 1.07/1.24 % SZS output end Proof for /export/starexec/sandbox/benchmark/theBenchmark.p %------------------------------------------------------------------------------