%------------------------------------------------------------------------------ % File : cocATP---0.2.0 % Problem : SYO034^1 : TPTP v7.5.0. Released v3.7.0. % Transfm : none % Format : tptp:raw % Command : python CASC.py /export/starexec/sandbox2/benchmark/theBenchmark.p % Computer : n014.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:26 EDT 2022 % Result : Theorem 0.50s 0.68s % Output : Proof 0.50s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : SYO034^1 : TPTP v7.5.0. Released v3.7.0. % 0.03/0.11 % Command : python CASC.py /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.12/0.32 % Computer : n014.cluster.edu % 0.12/0.32 % Model : x86_64 x86_64 % 0.12/0.32 % CPUModel : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.12/0.32 % RAMPerCPU : 8042.1875MB % 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.12/0.32 % CPULimit : 300 % 0.12/0.32 % DateTime : Fri Mar 11 04:18:34 EST 2022 % 0.12/0.32 % CPUTime : % 0.12/0.33 ModuleCmd_Load.c(213):ERROR:105: Unable to locate a modulefile for 'python/python27' % 0.12/0.33 Python 2.7.5 % 0.50/0.68 Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox2/benchmark/', '/export/starexec/sandbox2/benchmark/'] % 0.50/0.68 FOF formula ((ex (Prop->Prop)) (fun (N:(Prop->Prop))=> (forall (P:Prop), ((iff (N P)) P)))) of role conjecture named conj % 0.50/0.68 Conjecture to prove = ((ex (Prop->Prop)) (fun (N:(Prop->Prop))=> (forall (P:Prop), ((iff (N P)) P)))):Prop % 0.50/0.68 We need to prove ['((ex (Prop->Prop)) (fun (N:(Prop->Prop))=> (forall (P:Prop), ((iff (N P)) P))))'] % 0.50/0.68 Trying to prove ((ex (Prop->Prop)) (fun (N:(Prop->Prop))=> (forall (P:Prop), ((iff (N P)) P)))) % 0.50/0.68 Found iff_refl:=(fun (A:Prop)=> ((((conj (A->A)) (A->A)) (fun (H:A)=> H)) (fun (H:A)=> H))):(forall (P:Prop), ((iff P) P)) % 0.50/0.68 Found iff_refl as proof of (forall (P:Prop), ((iff P) P)) % 0.50/0.68 Found (ex_intro000 iff_refl) as proof of ((ex (Prop->Prop)) (fun (N:(Prop->Prop))=> (forall (P:Prop), ((iff (N P)) P)))) % 0.50/0.68 Found ((ex_intro00 (fun (x1:Prop)=> x1)) iff_refl) as proof of ((ex (Prop->Prop)) (fun (N:(Prop->Prop))=> (forall (P:Prop), ((iff (N P)) P)))) % 0.50/0.68 Found (((ex_intro0 (fun (N:(Prop->Prop))=> (forall (P:Prop), ((iff (N P)) P)))) (fun (x1:Prop)=> x1)) iff_refl) as proof of ((ex (Prop->Prop)) (fun (N:(Prop->Prop))=> (forall (P:Prop), ((iff (N P)) P)))) % 0.50/0.68 Found ((((ex_intro (Prop->Prop)) (fun (N:(Prop->Prop))=> (forall (P:Prop), ((iff (N P)) P)))) (fun (x1:Prop)=> x1)) iff_refl) as proof of ((ex (Prop->Prop)) (fun (N:(Prop->Prop))=> (forall (P:Prop), ((iff (N P)) P)))) % 0.50/0.68 Found ((((ex_intro (Prop->Prop)) (fun (N:(Prop->Prop))=> (forall (P:Prop), ((iff (N P)) P)))) (fun (x1:Prop)=> x1)) iff_refl) as proof of ((ex (Prop->Prop)) (fun (N:(Prop->Prop))=> (forall (P:Prop), ((iff (N P)) P)))) % 0.50/0.68 Got proof ((((ex_intro (Prop->Prop)) (fun (N:(Prop->Prop))=> (forall (P:Prop), ((iff (N P)) P)))) (fun (x1:Prop)=> x1)) iff_refl) % 0.50/0.68 Time elapsed = 0.072004s % 0.50/0.68 node=17 cost=310.000000 depth=5 % 0.50/0.68 :::::::::::::::::::::: % 0.50/0.68 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.50/0.68 % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p % 0.50/0.68 ((((ex_intro (Prop->Prop)) (fun (N:(Prop->Prop))=> (forall (P:Prop), ((iff (N P)) P)))) (fun (x1:Prop)=> x1)) iff_refl) % 0.50/0.68 % SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p %------------------------------------------------------------------------------