TSTP Solution File: PUZ035-7 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ035-7 : TPTP v8.1.2. 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 : n022.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 Aug 22 10:54:05 EDT 2023
% Result : Unsatisfiable 3.07s 1.76s
% Output : CNFRefutation 3.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 14
% Syntax : Number of formulae : 30 ( 12 unt; 11 typ; 0 def)
% Number of atoms : 28 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 23 ( 14 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 9 ( 5 >; 4 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 20 (; 20 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ reply > truth > or > isa > #nlpp > not > yes > other > no > knight > knave > asked
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(truth,type,
truth: $i > $o ).
tff(reply,type,
reply: ( $i * $i * $i ) > $o ).
tff(knight,type,
knight: $i ).
tff(yes,type,
yes: $i ).
tff(no,type,
no: $i ).
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_126,axiom,
! [R,X,Y] :
( ~ reply(asked,or(isa(asked,knight),isa(other,knight)),R)
| ~ truth(isa(asked,X))
| ~ truth(isa(other,Y)) ),
file(unknown,unknown) ).
tff(f_80,axiom,
! [P,Q] :
( reply(P,Q,yes)
| reply(P,Q,no) ),
file(unknown,unknown) ).
tff(f_37,axiom,
! [P] :
( truth(isa(P,knight))
| truth(isa(P,knave)) ),
file(unknown,unknown) ).
tff(c_28,plain,
! [Y_25,X_24,R_23] :
( ~ truth(isa(other,Y_25))
| ~ truth(isa(asked,X_24))
| ~ reply(asked,or(isa(asked,knight),isa(other,knight)),R_23) ),
inference(cnfTransformation,[status(thm)],[f_126]) ).
tff(c_104,plain,
! [R_23] : ~ reply(asked,or(isa(asked,knight),isa(other,knight)),R_23),
inference(splitLeft,[status(thm)],[c_28]) ).
tff(c_14,plain,
! [P_11,Q_12] :
( reply(P_11,Q_12,no)
| reply(P_11,Q_12,yes) ),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_105,plain,
! [R_52] : ~ reply(asked,or(isa(asked,knight),isa(other,knight)),R_52),
inference(splitLeft,[status(thm)],[c_28]) ).
tff(c_117,plain,
reply(asked,or(isa(asked,knight),isa(other,knight)),no),
inference(resolution,[status(thm)],[c_14,c_105]) ).
tff(c_123,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_104,c_117]) ).
tff(c_124,plain,
! [Y_25,X_24] :
( ~ truth(isa(other,Y_25))
| ~ truth(isa(asked,X_24)) ),
inference(splitRight,[status(thm)],[c_28]) ).
tff(c_125,plain,
! [X_24] : ~ truth(isa(asked,X_24)),
inference(splitLeft,[status(thm)],[c_124]) ).
tff(c_2,plain,
! [P_1] :
( truth(isa(P_1,knave))
| truth(isa(P_1,knight)) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_126,plain,
! [X_53] : ~ truth(isa(asked,X_53)),
inference(splitLeft,[status(thm)],[c_124]) ).
tff(c_138,plain,
truth(isa(asked,knave)),
inference(resolution,[status(thm)],[c_2,c_126]) ).
tff(c_144,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_125,c_138]) ).
tff(c_145,plain,
! [Y_25] : ~ truth(isa(other,Y_25)),
inference(splitRight,[status(thm)],[c_124]) ).
tff(c_153,plain,
! [Y_56] : ~ truth(isa(other,Y_56)),
inference(splitRight,[status(thm)],[c_124]) ).
tff(c_165,plain,
truth(isa(other,knave)),
inference(resolution,[status(thm)],[c_2,c_153]) ).
tff(c_171,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_145,c_165]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : PUZ035-7 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.15 % 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.36 % Computer : n022.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 17:33:33 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.07/1.76 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.07/1.77
% 3.07/1.77 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.07/1.80
% 3.07/1.80 Inference rules
% 3.07/1.80 ----------------------
% 3.07/1.80 #Ref : 0
% 3.07/1.80 #Sup : 28
% 3.07/1.80 #Fact : 0
% 3.07/1.80 #Define : 0
% 3.07/1.80 #Split : 2
% 3.07/1.80 #Chain : 0
% 3.07/1.80 #Close : 0
% 3.07/1.80
% 3.07/1.80 Ordering : KBO
% 3.07/1.80
% 3.07/1.80 Simplification rules
% 3.07/1.80 ----------------------
% 3.07/1.80 #Subsume : 1
% 3.07/1.80 #Demod : 0
% 3.07/1.80 #Tautology : 8
% 3.07/1.80 #SimpNegUnit : 3
% 3.07/1.80 #BackRed : 0
% 3.07/1.80
% 3.07/1.80 #Partial instantiations: 0
% 3.07/1.80 #Strategies tried : 1
% 3.07/1.80
% 3.07/1.80 Timing (in seconds)
% 3.07/1.80 ----------------------
% 3.35/1.80 Preprocessing : 0.46
% 3.35/1.80 Parsing : 0.26
% 3.35/1.80 CNF conversion : 0.03
% 3.35/1.80 Main loop : 0.26
% 3.35/1.80 Inferencing : 0.14
% 3.35/1.80 Reduction : 0.03
% 3.35/1.80 Demodulation : 0.01
% 3.35/1.80 BG Simplification : 0.01
% 3.35/1.80 Subsumption : 0.05
% 3.35/1.80 Abstraction : 0.01
% 3.35/1.80 MUC search : 0.00
% 3.35/1.80 Cooper : 0.00
% 3.35/1.80 Total : 0.77
% 3.35/1.80 Index Insertion : 0.00
% 3.35/1.80 Index Deletion : 0.00
% 3.35/1.80 Index Matching : 0.00
% 3.35/1.80 BG Taut test : 0.00
%------------------------------------------------------------------------------