%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : PUZ020-1 : TPTP v9.0.0. Released v1.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 : n011.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:03 PM UTC 2025
% Result : Unsatisfiable 3.61s 1.83s
% Output : CNFRefutation 3.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 26 ( 16 unt; 0 typ; 0 def)
% Number of atoms : 40 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 31 ( 17 ~; 14 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 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 : 6 ( 5 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 6 ( 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ says > person > knight > knave > a_truth > #nlpp > statement_by > wife > husband
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(wife,type,
wife: $i ).
tff(says,type,
says: ( $i * $i ) > $o ).
tff(knave,type,
knave: $i > $o ).
tff(knight,type,
knight: $i > $o ).
tff(husband,type,
husband: $i ).
tff(a_truth,type,
a_truth: $i > $o ).
tff(statement_by,type,
statement_by: $i > $i ).
tff(person,type,
person: $i > $o ).
tff(f_127,axiom,
~ knight(husband),
file(unknown,unknown) ).
tff(f_103,axiom,
person(husband),
file(unknown,unknown) ).
tff(f_32,axiom,
! [X] :
( ~ person(X)
| knight(X)
| knave(X) ),
file(unknown,unknown) ).
tff(f_121,axiom,
( a_truth(statement_by(husband))
| knight(wife) ),
file(unknown,unknown) ).
tff(f_107,axiom,
says(husband,statement_by(husband)),
file(unknown,unknown) ).
tff(f_100,axiom,
! [X,Y] :
( ~ knave(X)
| ~ says(X,Y)
| ~ a_truth(Y) ),
file(unknown,unknown) ).
tff(f_125,axiom,
( ~ knight(wife)
| a_truth(statement_by(husband)) ),
file(unknown,unknown) ).
tff(c_38,plain,
~ knight(husband),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_22,plain,
person(husband),
inference(cnfTransformation,[status(thm)],[f_103]) ).
tff(c_59,plain,
! [X_22] :
( knave(X_22)
| knight(X_22)
| ~ person(X_22) ),
inference(cnfTransformation,[status(thm)],[f_32]) ).
tff(c_62,plain,
( knave(husband)
| knight(husband) ),
inference(resolution,[status(thm)],[c_22,c_59]) ).
tff(c_68,plain,
knave(husband),
inference(negUnitSimplification,[status(thm)],[c_38,c_62]) ).
tff(c_34,plain,
( knight(wife)
| a_truth(statement_by(husband)) ),
inference(cnfTransformation,[status(thm)],[f_121]) ).
tff(c_41,plain,
a_truth(statement_by(husband)),
inference(splitLeft,[status(thm)],[c_34]) ).
tff(c_28,plain,
says(husband,statement_by(husband)),
inference(cnfTransformation,[status(thm)],[f_107]) ).
tff(c_72,plain,
! [Y_23,X_24] :
( ~ a_truth(Y_23)
| ~ says(X_24,Y_23)
| ~ knave(X_24) ),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_75,plain,
( ~ a_truth(statement_by(husband))
| ~ knave(husband) ),
inference(resolution,[status(thm)],[c_28,c_72]) ).
tff(c_78,plain,
~ knave(husband),
inference(demodulation,[status(thm),theory(equality)],[c_41,c_75]) ).
tff(c_80,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_68,c_78]) ).
tff(c_81,plain,
knight(wife),
inference(splitRight,[status(thm)],[c_34]) ).
tff(c_36,plain,
( a_truth(statement_by(husband))
| ~ knight(wife) ),
inference(cnfTransformation,[status(thm)],[f_125]) ).
tff(c_83,plain,
~ knight(wife),
inference(splitLeft,[status(thm)],[c_36]) ).
tff(c_85,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_81,c_83]) ).
tff(c_86,plain,
a_truth(statement_by(husband)),
inference(splitRight,[status(thm)],[c_36]) ).
tff(c_82,plain,
~ a_truth(statement_by(husband)),
inference(splitRight,[status(thm)],[c_34]) ).
tff(c_90,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_86,c_82]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.13 % Problem : PUZ020-1 : TPTP v9.0.0. Released v1.0.0.
% 0.14/0.14 % 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.14/0.35 % Computer : n011.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 : Tue Apr 8 17:19:03 EDT 2025
% 0.14/0.35 % CPUTime :
% 3.61/1.83 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.64/1.83
% 3.64/1.83 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------