%------------------------------------------------------------------------------
% File : nanoCoP-M---2.0
% Problem : DAT433_1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_nanocopm %s %d
% Computer : n002.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 5 06:23:47 PM UTC 2026
% Result : Theorem 0.48s 1.57s
% Output : Proof 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : DAT433_1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12 % Command : run_nanocopm %s %d
% 0.14/0.33 % Computer : n002.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon May 4 20:53:46 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.19/0.46 % Logic is s5
% 0.32/0.47 % Designation is rigid
% 0.32/0.47 % Terms are local
% 0.32/0.48 % Domains are const
% 0.32/0.49 ------------ Start QMF file ---------------
% 0.32/0.49 %------------------------------------------------------------------------------
% 0.32/0.49 % File : DAT433_1 : TPTP v9.3.0. Released v9.3.0.
% 0.32/0.49 % Domain : Data Structures
% 0.32/0.49 % Problem : Database querying
% 0.32/0.49 % Version : Especial.
% 0.32/0.49 % English :
% 0.32/0.49 % Refs : [Rei92] Reiter (1992), What Should a Database Know?
% 0.32/0.49 % Source : [Rei92]
% 0.32/0.49 % Names :
% 0.32/0.49 % Status : CounterSatisfiable
% 0.32/0.49 % Rating : ? v9.3.0
% 0.32/0.49 % Syntax : Number of formulae : 10 ( 0 unt; 7 typ; 0 def)
% 0.32/0.49 % Number of atoms : 14 ( 0 equ)
% 0.32/0.49 % Maximal formula atoms : 6 ( 4 avg)
% 0.32/0.49 % Number of connectives : 20 ( 4 ~; 0 |; 6 &)
% 0.32/0.49 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.32/0.49 % ( 5 {.}; 0 {#})
% 0.32/0.49 % Maximal formula depth : 5 ( 5 avg)
% 0.32/0.49 % Maximal term depth : 1 ( 1 avg)
% 0.32/0.49 % Number of FOOLs : 5 ( 5 fml; 0 var)
% 0.32/0.49 % Number of X terms : 5 ( 5 []; 0 ite; 0 let)
% 0.32/0.49 % Number of types : 2 ( 0 usr)
% 0.32/0.49 % Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% 0.32/0.49 % Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% 0.32/0.49 % Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% 0.32/0.49 % Number of variables : 2 ( 0 !; 2 ?; 2 :)
% 0.32/0.49 % SPC : NX0_CSA_NEQ_NAR
% 0.32/0.49 % Comments :
% 0.32/0.49 %------------------------------------------------------------------------------
% 0.32/0.49 qmf(db,axiom,(#box : ( teach(john,math) & ? [X] : teach(X,cs) & teach(mary,psych) & teach(sue,psych) ) )).
% 0.32/0.49 qmf(not_db,axiom,(~ ( #box : teach(john,cs) ) & ~ ( #box : teach(mary,cs) ) & ~ ( #box : teach(sue,cs) ) )).
% 0.32/0.49 qmf(query,conjecture,(? [X] : ( teach(X,psych) & ~ ( #box : teach(X,cs) ) ) )).
% 0.32/0.49 %------------------------------------------------------------------------------
% 0.32/0.49 ------------ End QMF file ---------------
% 0.48/1.57
% 0.48/1.57 % SZS status Theorem for $/export/starexec/sandbox/tmp/tmp.yVlGbP02Mu/theBenchmark.p.qmf : (modal (s5/const))
% 0.48/1.57 % SZS output start Proof for /export/starexec/sandbox/tmp/tmp.yVlGbP02Mu/theBenchmark.p.qmf
% 0.48/1.57 ------------------------------------------------------
% 0.48/1.57 Explanations for the proof presented below:
% 0.48/1.57 - equality axioms are added if required
% 0.48/1.57 - terms and variables are represented by Prolog terms
% 0.48/1.57 and Prolog variables, negation is represented by -
% 0.48/1.57 - a prefix Pre is a list of variables and constants
% 0.48/1.57 and assigned to each literal Lit, i.e. Pre:Lit
% 0.48/1.57 - clauses and (sub-)matrices have a unique label I^K:
% 0.48/1.57 or I^K^[..]:, where I is a unique number/identifier
% 0.48/1.57 and K identifies the instance of clause/matrix I
% 0.48/1.57 - I:Lit refers to literal Lit in clause number I
% 0.48/1.57 - in the matrix, I^[t1,..,tn] may represent the atom
% 0.48/1.57 P_I(t1,..,tn) or the Skolem term f_I(t1,t2,..,tn)
% 0.48/1.57 - the substitution [[X1,..,Xn],[t1,..,tn]] represents
% 0.48/1.57 the assignments X1:=t1, .., Xn:=tn (for both term
% 0.48/1.57 and prefix variables)
% 0.48/1.57
% 0.48/1.57 Proof:
% 0.48/1.57 ------
% 0.48/1.57 Translation into a non-clausal matrix:
% 0.48/1.57 [(3 ^ _6581) ^ [_6720] ^ [] : [-(teach(john, math)) : -([_6720])], (6 ^ _6581) ^ [_6860] ^ [] : [-(teach(4 ^ [_6860] ^ [_6860], cs)) : -([_6860])], (8 ^ _6581) ^ [_6968] ^ [] : [-(teach(mary, psych)) : -([_6968])], (10 ^ _6581) ^ [_7040] ^ [] : [-(teach(sue, psych)) : -([_7040])], (13 ^ _6581) ^ [] ^ [] : [teach(john, cs) : [11 ^ []]], (16 ^ _6581) ^ [] ^ [] : [teach(mary, cs) : [14 ^ []]], (19 ^ _6581) ^ [] ^ [] : [teach(sue, cs) : [17 ^ []]], (21 ^ _6581) ^ [_7448] ^ [_7448 : []] : [teach(_7448, psych) : [], 25 ^ _6581 : [(26 ^ _6581) ^ [_7629] ^ [] : [-(teach(_7448, cs)) : -([_7629])]]]]
% 0.48/1.57
% 0.48/1.57 We prove that the given matrix is valid, i.e. for
% 0.48/1.57 a given substitution it evaluates to true for all
% 0.48/1.57 interpretations. A matrix is true iff at least one
% 0.48/1.57 of its clauses is true; a clause is true iff all of
% 0.48/1.57 its elements (literals and submatrices) are true.
% 0.48/1.57
% 0.48/1.57 The proof is by contradiction:
% 0.48/1.57 Assume there is an interpretation so that the given
% 0.48/1.57 matrix evaluates to false. Then in each clause there
% 0.48/1.57 has to be at least one element that is false.
% 0.48/1.57
% 0.48/1.57 Then clause (16 ^ 0) is false if at least one of the following is false:
% 0.48/1.57 [teach(mary, cs) : [14 ^ []]]
% 0.48/1.57 1 Assume teach(mary, cs) : [14 ^ []] is false.
% 0.48/1.57 Then clause (21 ^ 1) under the substitution [[_7448, _7629], [mary, 14 ^ []]]
% 0.48/1.57 is false if at least one of the following is false:
% 0.48/1.57 [teach(mary, psych) : []]
% 0.48/1.57 1.1 Assume teach(mary, psych) : [[]] is false.
% 0.48/1.57 Then clause (8 ^ 2) under the substitution [[_6968], [[]]]
% 0.48/1.57 is true.
% 0.48/1.57
% 0.48/1.57 Therefore there is no interpretation that makes the
% 0.48/1.57 given matrix false. Hence the given matrix is valid.
% 0.48/1.57 q.e.d.
% 0.48/1.57 ------------------------------------------------------
% 0.48/1.57 % SZS output end Proof for /export/starexec/sandbox/tmp/tmp.yVlGbP02Mu/theBenchmark.p.qmf
% 0.48/1.57 % nanoCoP-M exiting
%------------------------------------------------------------------------------