%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : PUZ035-6 : TPTP v9.0.0. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 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 : Wed Apr 9 08:25:08 PM UTC 2025
% Result : Unsatisfiable 2.63s 1.58s
% Output : CNFRefutation 2.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 2
% Syntax : Number of formulae : 12 ( 7 unt; 0 typ; 0 def)
% Number of atoms : 17 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 10 ( 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ says > truth > or > isa > #nlpp > not > other > knight > knave > asked
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(truth,type,
truth: $i > $o ).
tff(knight,type,
knight: $i ).
tff(says,type,
says: ( $i * $i ) > $o ).
tff(or,type,
or: ( $i * $i ) > $i ).
tff(not,type,
not: $i > $i ).
tff(other,type,
other: $i ).
tff(knave,type,
knave: $i ).
tff(isa,type,
isa: ( $i * $i ) > $i ).
tff(asked,type,
asked: $i ).
tff(f_93,axiom,
! [X,Y] :
( ~ truth(isa(asked,X))
| ~ truth(isa(other,Y)) ),
file(unknown,unknown) ).
tff(f_35,axiom,
! [P] :
( truth(isa(P,knight))
| truth(isa(P,knave)) ),
file(unknown,unknown) ).
tff(c_22,plain,
! [Y_16,X_15] :
( ~ truth(isa(other,Y_16))
| ~ truth(isa(asked,X_15)) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_41,plain,
! [X_15] : ~ truth(isa(asked,X_15)),
inference(splitLeft,[status(thm)],[c_22]) ).
tff(c_43,plain,
! [P_27] :
( truth(isa(P_27,knave))
| truth(isa(P_27,knight)) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_47,plain,
truth(isa(asked,knave)),
inference(resolution,[status(thm)],[c_43,c_41]) ).
tff(c_54,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_41,c_47]) ).
tff(c_55,plain,
! [Y_16] : ~ truth(isa(other,Y_16)),
inference(splitRight,[status(thm)],[c_22]) ).
tff(c_2,plain,
! [P_1] :
( truth(isa(P_1,knave))
| truth(isa(P_1,knight)) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_61,plain,
! [Y_29] : ~ truth(isa(other,Y_29)),
inference(splitRight,[status(thm)],[c_22]) ).
tff(c_65,plain,
truth(isa(other,knave)),
inference(resolution,[status(thm)],[c_2,c_61]) ).
tff(c_69,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_55,c_65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.10 % Problem : PUZ035-6 : TPTP v9.0.0. Released v2.0.0.
% 0.05/0.11 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.11/0.31 % Computer : n013.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 300
% 0.11/0.31 % DateTime : Tue Apr 8 17:12:47 EDT 2025
% 0.11/0.31 % CPUTime :
% 2.63/1.58 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.63/1.58
% 2.63/1.58 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------