%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : PUZ035-3 : 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 : n021.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:07 PM UTC 2025
% Result : Unsatisfiable 3.00s 1.66s
% Output : CNFRefutation 3.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 5
% Syntax : Number of formulae : 23 ( 14 unt; 0 typ; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 30 ( 17 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 15 ( 15 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ says > truth > person > 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(person,type,
person: $i > $o ).
tff(isa,type,
isa: ( $i * $i ) > $i ).
tff(asked,type,
asked: $i ).
tff(f_136,axiom,
! [P1,P2,S] :
( ~ truth(isa(asked,P1))
| ~ truth(isa(other,P2))
| ~ says(asked,S) ),
file(unknown,unknown) ).
tff(f_126,axiom,
person(asked),
file(unknown,unknown) ).
tff(f_39,axiom,
! [P] :
( ~ person(P)
| truth(isa(P,knight))
| truth(isa(P,knave)) ),
file(unknown,unknown) ).
tff(f_127,axiom,
person(other),
file(unknown,unknown) ).
tff(f_82,axiom,
( says(asked,or(isa(asked,knight),isa(other,knight)))
| says(asked,not(or(isa(asked,knight),isa(other,knight)))) ),
file(unknown,unknown) ).
tff(c_32,plain,
! [S_24,P2_23,P1_22] :
( ~ says(asked,S_24)
| ~ truth(isa(other,P2_23))
| ~ truth(isa(asked,P1_22)) ),
inference(cnfTransformation,[status(thm)],[f_136]) ).
tff(c_52,plain,
! [P1_22] : ~ truth(isa(asked,P1_22)),
inference(splitLeft,[status(thm)],[c_32]) ).
tff(c_28,plain,
person(asked),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_2,plain,
! [P_1] :
( truth(isa(P_1,knave))
| truth(isa(P_1,knight))
| ~ person(P_1) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_53,plain,
! [P1_46] : ~ truth(isa(asked,P1_46)),
inference(splitLeft,[status(thm)],[c_32]) ).
tff(c_57,plain,
( truth(isa(asked,knave))
| ~ person(asked) ),
inference(resolution,[status(thm)],[c_2,c_53]) ).
tff(c_60,plain,
truth(isa(asked,knave)),
inference(demodulation,[status(thm),theory(equality)],[c_28,c_57]) ).
tff(c_62,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_52,c_60]) ).
tff(c_63,plain,
! [S_24,P2_23] :
( ~ says(asked,S_24)
| ~ truth(isa(other,P2_23)) ),
inference(splitRight,[status(thm)],[c_32]) ).
tff(c_64,plain,
! [P2_23] : ~ truth(isa(other,P2_23)),
inference(splitLeft,[status(thm)],[c_63]) ).
tff(c_30,plain,
person(other),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_65,plain,
! [P2_47] : ~ truth(isa(other,P2_47)),
inference(splitLeft,[status(thm)],[c_63]) ).
tff(c_69,plain,
( truth(isa(other,knave))
| ~ person(other) ),
inference(resolution,[status(thm)],[c_2,c_65]) ).
tff(c_72,plain,
truth(isa(other,knave)),
inference(demodulation,[status(thm),theory(equality)],[c_30,c_69]) ).
tff(c_74,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_64,c_72]) ).
tff(c_75,plain,
! [S_24] : ~ says(asked,S_24),
inference(splitRight,[status(thm)],[c_63]) ).
tff(c_14,plain,
( says(asked,not(or(isa(asked,knight),isa(other,knight))))
| says(asked,or(isa(asked,knight),isa(other,knight))) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_77,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_75,c_75,c_14]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : PUZ035-3 : TPTP v9.0.0. Released v2.0.0.
% 0.03/0.13 % 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.34 % Computer : n021.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Tue Apr 8 17:13:29 EDT 2025
% 0.14/0.34 % CPUTime :
% 3.00/1.66 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.00/1.66
% 3.00/1.66 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------