TSTP Solution File: SYO032^1 by cocATP---0.2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : cocATP---0.2.0
% Problem  : SYO032^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 : n016.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.55s 0.74s
% Output   : Proof 0.55s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem    : SYO032^1 : TPTP v7.5.0. Released v3.7.0.
% 0.03/0.11  % Command    : python CASC.py /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/0.32  % Computer   : n016.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   : Fri Mar 11 04:11:59 EST 2022
% 0.11/0.32  % CPUTime    : 
% 0.11/0.33  ModuleCmd_Load.c(213):ERROR:105: Unable to locate a modulefile for 'python/python27'
% 0.11/0.33  Python 2.7.5
% 0.55/0.74  Using paths ['/home/cristobal/cocATP/CASC/TPTP/', '/export/starexec/sandbox2/benchmark/', '/export/starexec/sandbox2/benchmark/']
% 0.55/0.74  FOF formula ((ex (Prop->(Prop->Prop))) (fun (D:(Prop->(Prop->Prop)))=> (forall (P:Prop) (Q:Prop), ((iff ((D P) Q)) ((or P) Q))))) of role conjecture named conj
% 0.55/0.74  Conjecture to prove = ((ex (Prop->(Prop->Prop))) (fun (D:(Prop->(Prop->Prop)))=> (forall (P:Prop) (Q:Prop), ((iff ((D P) Q)) ((or P) Q))))):Prop
% 0.55/0.74  We need to prove ['((ex (Prop->(Prop->Prop))) (fun (D:(Prop->(Prop->Prop)))=> (forall (P:Prop) (Q:Prop), ((iff ((D P) Q)) ((or P) Q)))))']
% 0.55/0.74  Trying to prove ((ex (Prop->(Prop->Prop))) (fun (D:(Prop->(Prop->Prop)))=> (forall (P:Prop) (Q:Prop), ((iff ((D P) Q)) ((or P) Q)))))
% 0.55/0.74  Found iff_refl0:=(iff_refl ((x P) Q)):((iff ((x P) Q)) ((x P) Q))
% 0.55/0.74  Found (iff_refl ((x P) Q)) as proof of ((iff ((x P) Q)) ((or P) Q))
% 0.55/0.74  Found (iff_refl ((x P) Q)) as proof of ((iff ((x P) Q)) ((or P) Q))
% 0.55/0.74  Found (fun (Q:Prop)=> (iff_refl ((x P) Q))) as proof of ((iff ((x P) Q)) ((or P) Q))
% 0.55/0.74  Found (fun (P:Prop) (Q:Prop)=> (iff_refl ((x P) Q))) as proof of (forall (Q:Prop), ((iff ((x P) Q)) ((or P) Q)))
% 0.55/0.74  Found (fun (P:Prop) (Q:Prop)=> (iff_refl ((x P) Q))) as proof of (forall (P:Prop) (Q:Prop), ((iff ((x P) Q)) ((or P) Q)))
% 0.55/0.74  Found (ex_intro000 (fun (P:Prop) (Q:Prop)=> (iff_refl ((x P) Q)))) as proof of ((ex (Prop->(Prop->Prop))) (fun (D:(Prop->(Prop->Prop)))=> (forall (P:Prop) (Q:Prop), ((iff ((D P) Q)) ((or P) Q)))))
% 0.55/0.74  Found ((ex_intro00 or) (fun (P:Prop) (Q:Prop)=> (iff_refl ((or P) Q)))) as proof of ((ex (Prop->(Prop->Prop))) (fun (D:(Prop->(Prop->Prop)))=> (forall (P:Prop) (Q:Prop), ((iff ((D P) Q)) ((or P) Q)))))
% 0.55/0.74  Found (((ex_intro0 (fun (D:(Prop->(Prop->Prop)))=> (forall (P:Prop) (Q:Prop), ((iff ((D P) Q)) ((or P) Q))))) or) (fun (P:Prop) (Q:Prop)=> (iff_refl ((or P) Q)))) as proof of ((ex (Prop->(Prop->Prop))) (fun (D:(Prop->(Prop->Prop)))=> (forall (P:Prop) (Q:Prop), ((iff ((D P) Q)) ((or P) Q)))))
% 0.55/0.74  Found ((((ex_intro (Prop->(Prop->Prop))) (fun (D:(Prop->(Prop->Prop)))=> (forall (P:Prop) (Q:Prop), ((iff ((D P) Q)) ((or P) Q))))) or) (fun (P:Prop) (Q:Prop)=> (iff_refl ((or P) Q)))) as proof of ((ex (Prop->(Prop->Prop))) (fun (D:(Prop->(Prop->Prop)))=> (forall (P:Prop) (Q:Prop), ((iff ((D P) Q)) ((or P) Q)))))
% 0.55/0.74  Found ((((ex_intro (Prop->(Prop->Prop))) (fun (D:(Prop->(Prop->Prop)))=> (forall (P:Prop) (Q:Prop), ((iff ((D P) Q)) ((or P) Q))))) or) (fun (P:Prop) (Q:Prop)=> (iff_refl ((or P) Q)))) as proof of ((ex (Prop->(Prop->Prop))) (fun (D:(Prop->(Prop->Prop)))=> (forall (P:Prop) (Q:Prop), ((iff ((D P) Q)) ((or P) Q)))))
% 0.55/0.74  Got proof ((((ex_intro (Prop->(Prop->Prop))) (fun (D:(Prop->(Prop->Prop)))=> (forall (P:Prop) (Q:Prop), ((iff ((D P) Q)) ((or P) Q))))) or) (fun (P:Prop) (Q:Prop)=> (iff_refl ((or P) Q))))
% 0.55/0.74  Time elapsed = 0.139439s
% 0.55/0.74  node=27 cost=145.000000 depth=9
% 0.55/0.74  ::::::::::::::::::::::
% 0.55/0.74  % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.74  % SZS output start Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.55/0.74  ((((ex_intro (Prop->(Prop->Prop))) (fun (D:(Prop->(Prop->Prop)))=> (forall (P:Prop) (Q:Prop), ((iff ((D P) Q)) ((or P) Q))))) or) (fun (P:Prop) (Q:Prop)=> (iff_refl ((or P) Q))))
% 0.55/0.74  % SZS output end Proof for /export/starexec/sandbox2/benchmark/theBenchmark.p
%------------------------------------------------------------------------------