%------------------------------------------------------------------------------
% File : MleanCoP---1.3
% Problem : SYO886_2.111 : TPTP v9.0.0. Released v9.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_mleancop %s %d
% Computer : n020.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 : 300s
% DateTime : Tue May 14 09:13:40 EDT 2024
% Result : Theorem 0.52s 1.56s
% Output : Proof 0.52s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYO886_2.111 : TPTP v9.0.0. Released v9.0.0.
% 0.04/0.13 % Command : run_mleancop %s %d
% 0.14/0.35 % Computer : n020.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Mon May 13 15:10:08 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.49 % Logic is d
% 0.21/0.49 % Designation is rigid
% 0.21/0.50 % Terms are local
% 0.21/0.50 % Domains are const
% 0.21/0.51 ------------ Start QMF file ---------------
% 0.21/0.51 %------------------------------------------------------------------------------
% 0.21/0.51 % File : SYO886_2.111 : TPTP v9.0.0. Released v9.0.0.
% 0.21/0.51 % Domain : Syntactic
% 0.21/0.51 % Problem : Barcan scheme instance
% 0.21/0.51 % Version : Especial.
% 0.21/0.51 % English : If for all x necessarily f(x), then it is necessary that for
% 0.21/0.51 % all x f(x)
% 0.21/0.51 % Refs : [Bar46] Barcan (1946), A Functional Calculus of First Order Ba
% 0.21/0.51 % : [Sid10] Sider (2010), Logic for Philosophy
% 0.21/0.51 % : [RO12] Raths & Otten (2012), The QMLTP Problem Library for Fi
% 0.21/0.51 % Source : [TPTP]
% 0.21/0.51 % Names : SYM001+1 [QMLTP]
% 0.21/0.51 % Status : Theorem
% 0.21/0.51 % Rating : ? v9.0.0
% 0.21/0.51 % Syntax : Number of formulae : 2 ( 0 unt; 1 typ; 0 def)
% 0.21/0.51 % Number of atoms : 6 ( 0 equ)
% 0.21/0.51 % Maximal formula atoms : 4 ( 6 avg)
% 0.21/0.51 % Number of connectives : 3 ( 0 ~; 0 |; 0 &)
% 0.21/0.51 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.21/0.51 % ( 2 {}@; 0 {#}; 0 {.})
% 0.21/0.51 % Maximal formula depth : 4 ( 4 avg)
% 0.21/0.51 % Maximal term depth : 1 ( 1 avg)
% 0.21/0.51 % Number of FOOLs : 2 ( 2 fml; 0 var)
% 0.21/0.51 % Number of types : 2 ( 0 usr)
% 0.21/0.51 % Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% 0.21/0.51 % Number of predicates : 2 ( 1 usr; 0 prp; 1-1 aty)
% 0.21/0.51 % Number of functors : 0 ( 0 usr; 0 con; --- aty)
% 0.21/0.51 % Number of variables : 2 (; 2 !; 0 ?; 2 :)
% 0.21/0.51 % SPC : NX0_THM_NEQ_NAR
% 0.21/0.51 % Comments :
% 0.21/0.51 %------------------------------------------------------------------------------
% 0.21/0.51 qmf(con,conjecture,(! [X] : ( #box : f(X) ) => ( #box : ! [X] : f(X) ) )).
% 0.21/0.51 %------------------------------------------------------------------------------
% 0.21/0.51 ------------ End QMF file ---------------
% 0.52/1.56
% 0.52/1.56 % SZS status Theorem for $/export/starexec/sandbox2/tmp/tmp.C3BkRxYXiZ/theBenchmark.p.qmf : (modal (d/const))
% 0.52/1.56 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.C3BkRxYXiZ/theBenchmark.p.qmf
% 0.52/1.56 [[f(4 ^ [] ^ [3 ^ []]) : [3 ^ []]], [[-(f(4 ^ [] ^ [3 ^ []])) : -([3 ^ []])]]]
% 0.52/1.56 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.C3BkRxYXiZ/theBenchmark.p.qmf
% 0.52/1.56 % MleanCoP exiting
%------------------------------------------------------------------------------