%------------------------------------------------------------------------------
% File : MleanCoP---1.3
% Problem : DAT433_1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_mleancop %s %d
% Computer : n007.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:45 PM UTC 2026
% Result : Theorem 0.48s 1.54s
% Output : Proof 0.48s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : DAT433_1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12 % Command : run_mleancop %s %d
% 0.16/0.33 % Computer : n007.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.34 % DateTime : Mon May 4 20:52:53 EDT 2026
% 0.16/0.34 % CPUTime :
% 0.29/0.47 % Logic is s5
% 0.29/0.48 % Designation is rigid
% 0.29/0.48 % Terms are local
% 0.29/0.49 % Domains are const
% 0.29/0.49 ------------ Start QMF file ---------------
% 0.29/0.50 %------------------------------------------------------------------------------
% 0.29/0.50 % File : DAT433_1 : TPTP v9.3.0. Released v9.3.0.
% 0.29/0.50 % Domain : Data Structures
% 0.29/0.50 % Problem : Database querying
% 0.29/0.50 % Version : Especial.
% 0.29/0.50 % English :
% 0.29/0.50 % Refs : [Rei92] Reiter (1992), What Should a Database Know?
% 0.29/0.50 % Source : [Rei92]
% 0.29/0.50 % Names :
% 0.29/0.50 % Status : CounterSatisfiable
% 0.29/0.50 % Rating : ? v9.3.0
% 0.29/0.50 % Syntax : Number of formulae : 10 ( 0 unt; 7 typ; 0 def)
% 0.29/0.50 % Number of atoms : 14 ( 0 equ)
% 0.29/0.50 % Maximal formula atoms : 6 ( 4 avg)
% 0.29/0.50 % Number of connectives : 20 ( 4 ~; 0 |; 6 &)
% 0.29/0.50 % ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% 0.29/0.50 % ( 5 {.}; 0 {#})
% 0.29/0.50 % Maximal formula depth : 5 ( 5 avg)
% 0.29/0.50 % Maximal term depth : 1 ( 1 avg)
% 0.29/0.50 % Number of FOOLs : 5 ( 5 fml; 0 var)
% 0.29/0.50 % Number of X terms : 5 ( 5 []; 0 ite; 0 let)
% 0.29/0.50 % Number of types : 2 ( 0 usr)
% 0.29/0.50 % Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% 0.29/0.50 % Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% 0.29/0.50 % Number of functors : 6 ( 6 usr; 6 con; 0-0 aty)
% 0.29/0.50 % Number of variables : 2 ( 0 !; 2 ?; 2 :)
% 0.29/0.50 % SPC : NX0_CSA_NEQ_NAR
% 0.29/0.50 % Comments :
% 0.29/0.50 %------------------------------------------------------------------------------
% 0.29/0.50 qmf(db,axiom,(#box : ( teach(john,math) & ? [X] : teach(X,cs) & teach(mary,psych) & teach(sue,psych) ) )).
% 0.29/0.50 qmf(not_db,axiom,(~ ( #box : teach(john,cs) ) & ~ ( #box : teach(mary,cs) ) & ~ ( #box : teach(sue,cs) ) )).
% 0.29/0.50 qmf(query,conjecture,(? [X] : ( teach(X,psych) & ~ ( #box : teach(X,cs) ) ) )).
% 0.29/0.50 %------------------------------------------------------------------------------
% 0.29/0.50 ------------ End QMF file ---------------
% 0.48/1.54
% 0.48/1.54 % SZS status Theorem for $/export/starexec/sandbox2/tmp/tmp.AJVpP31gOJ/theBenchmark.p.qmf : (modal (s5/const))
% 0.48/1.54 % SZS output start Proof for /export/starexec/sandbox2/tmp/tmp.AJVpP31gOJ/theBenchmark.p.qmf
% 0.48/1.54 [[# : [], teach(mary, cs) : [13 ^ []]], [[-(teach(mary, cs)) : -([13 ^ []]), teach(mary, psych) : []], [[-(teach(mary, psych)) : -([[]])]]]]
% 0.48/1.54 % SZS output end Proof for /export/starexec/sandbox2/tmp/tmp.AJVpP31gOJ/theBenchmark.p.qmf
% 0.48/1.54 % MleanCoP exiting
%------------------------------------------------------------------------------