%------------------------------------------------------------------------------
% File : nanoCoP-M---2.0
% Problem : SYO886_3.111 : TPTP v9.0.0. Released v9.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_nanocopm %s %d
% Computer : n013.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:14:03 EDT 2024
% Result : Theorem 0.49s 1.57s
% Output : Proof 0.49s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYO886_3.111 : TPTP v9.0.0. Released v9.0.0.
% 0.04/0.13 % Command : run_nanocopm %s %d
% 0.13/0.35 % Computer : n013.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 13 15:15:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.49 % Logic is t
% 0.20/0.49 % Designation is rigid
% 0.20/0.50 % Terms are local
% 0.20/0.50 % Domains are const
% 0.20/0.51 ------------ Start QMF file ---------------
% 0.20/0.51 %------------------------------------------------------------------------------
% 0.20/0.51 % File : SYO886_3.111 : TPTP v9.0.0. Released v9.0.0.
% 0.20/0.51 % Domain : Syntactic
% 0.20/0.51 % Problem : Barcan scheme instance
% 0.20/0.51 % Version : Especial.
% 0.20/0.51 % English : If for all x necessarily f(x), then it is necessary that for
% 0.20/0.51 % all x f(x)
% 0.20/0.51 % Refs : [Bar46] Barcan (1946), A Functional Calculus of First Order Ba
% 0.20/0.51 % : [Sid10] Sider (2010), Logic for Philosophy
% 0.20/0.51 % : [RO12] Raths & Otten (2012), The QMLTP Problem Library for Fi
% 0.20/0.51 % Source : [TPTP]
% 0.20/0.51 % Names : SYM001+1 [QMLTP]
% 0.20/0.51 % Status : Theorem
% 0.20/0.51 % Rating : ? v9.0.0
% 0.20/0.51 % Syntax : Number of formulae : 2 ( 0 unt; 1 typ; 0 def)
% 0.20/0.51 % Number of atoms : 6 ( 0 equ)
% 0.20/0.51 % Maximal formula atoms : 4 ( 6 avg)
% 0.20/0.51 % Number of connectives : 3 ( 0 ~; 0 |; 0 &)
% 0.20/0.51 % ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% 0.20/0.51 % ( 2 {}@; 0 {#}; 0 {.})
% 0.20/0.51 % Maximal formula depth : 4 ( 4 avg)
% 0.20/0.51 % Maximal term depth : 1 ( 1 avg)
% 0.20/0.51 % Number of FOOLs : 2 ( 2 fml; 0 var)
% 0.20/0.51 % Number of types : 2 ( 0 usr)
% 0.20/0.51 % Number of type conns : 1 ( 1 >; 0 *; 0 +; 0 <<)
% 0.20/0.51 % Number of predicates : 2 ( 1 usr; 0 prp; 1-1 aty)
% 0.20/0.51 % Number of functors : 0 ( 0 usr; 0 con; --- aty)
% 0.20/0.51 % Number of variables : 2 (; 2 !; 0 ?; 2 :)
% 0.20/0.51 % SPC : NX0_THM_NEQ_NAR
% 0.20/0.51 % Comments :
% 0.20/0.51 %------------------------------------------------------------------------------
% 0.20/0.51 qmf(con,conjecture,(! [X] : ( #box : f(X) ) => ( #box : ! [X] : f(X) ) )).
% 0.20/0.51 %------------------------------------------------------------------------------
% 0.20/0.51 ------------ End QMF file ---------------
% 0.49/1.57
% 0.49/1.57 % SZS status Theorem for $/export/starexec/sandbox2/tmp/tmp.rTWK64yVVe/theBenchmark.p.qmf : (modal (t/const))
% 0.49/1.57 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.rTWK64yVVe/theBenchmark.p.qmf
% 0.49/1.57 ------------------------------------------------------
% 0.49/1.57 Explanations for the proof presented below:
% 0.49/1.57 - equality axioms are added if required
% 0.49/1.57 - terms and variables are represented by Prolog terms
% 0.49/1.57 and Prolog variables, negation is represented by -
% 0.49/1.57 - a prefix Pre is a list of variables and constants
% 0.49/1.57 and assigned to each literal Lit, i.e. Pre:Lit
% 0.49/1.57 - clauses and (sub-)matrices have a unique label I^K:
% 0.49/1.57 or I^K^[..]:, where I is a unique number/identifier
% 0.49/1.57 and K identifies the instance of clause/matrix I
% 0.49/1.57 - I:Lit refers to literal Lit in clause number I
% 0.49/1.57 - in the matrix, I^[t1,..,tn] may represent the atom
% 0.49/1.57 P_I(t1,..,tn) or the Skolem term f_I(t1,t2,..,tn)
% 0.49/1.57 - the substitution [[X1,..,Xn],[t1,..,tn]] represents
% 0.49/1.57 the assignments X1:=t1, .., Xn:=tn (for both term
% 0.49/1.57 and prefix variables)
% 0.49/1.57
% 0.49/1.57 Proof:
% 0.49/1.57 ------
% 0.49/1.57 Translation into a non-clausal matrix:
% 0.49/1.57 [(3 ^ _3667) ^ [_3782, _3784] ^ [_3784 : []] : [-(f(_3784)) : -([_3782])], (7 ^ _3667) ^ [] ^ [] : [f(5 ^ [] ^ [4 ^ []]) : [4 ^ []]]]
% 0.49/1.57
% 0.49/1.57 We prove that the given matrix is valid, i.e. for
% 0.49/1.57 a given substitution it evaluates to true for all
% 0.49/1.57 interpretations. A matrix is true iff at least one
% 0.49/1.57 of its clauses is true; a clause is true iff all of
% 0.49/1.57 its elements (literals and submatrices) are true.
% 0.49/1.57
% 0.49/1.57 The proof is by contradiction:
% 0.49/1.57 Assume there is an interpretation so that the given
% 0.49/1.57 matrix evaluates to false. Then in each clause there
% 0.49/1.57 has to be at least one element that is false.
% 0.49/1.57
% 0.49/1.57 Then clause (7 ^ 0) is false if at least one of the following is false:
% 0.49/1.57 [f(5 ^ [] ^ [4 ^ []]) : [4 ^ []]]
% 0.49/1.57 1 Assume f(5 ^ [] ^ [4 ^ []]) : [4 ^ []] is false.
% 0.49/1.57 Then clause (3 ^ 1) under the substitution [[_3782, _3784], [4 ^ [], 5 ^ [] ^ [4 ^ []]]]
% 0.49/1.57 is true.
% 0.49/1.57
% 0.49/1.57 Therefore there is no interpretation that makes the
% 0.49/1.57 given matrix false. Hence the given matrix is valid.
% 0.49/1.57 q.e.d.
% 0.49/1.57 ------------------------------------------------------
% 0.49/1.57 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.rTWK64yVVe/theBenchmark.p.qmf
% 0.49/1.57 % nanoCoP-M exiting
%------------------------------------------------------------------------------