TSTP Solution File: PUZ035-5 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ035-5 : 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 : n016.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 2.62s 1.70s
% Output : CNFRefutation 2.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of formulae : 20 ( 8 unt; 8 typ; 0 def)
% Number of atoms : 16 ( 0 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 12 ( 8 ~; 4 |; 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 : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ says > truth > or > isa > #nlpp > 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(other,type,
other: $i ).
tff(knave,type,
knave: $i ).
tff(isa,type,
isa: ( $i * $i ) > $i ).
tff(asked,type,
asked: $i ).
tff(f_83,axiom,
! [X,Y] :
( ~ truth(isa(asked,X))
| ~ truth(isa(other,Y)) ),
file(unknown,unknown) ).
tff(f_36,axiom,
! [P] :
( truth(isa(P,knight))
| truth(isa(P,knave)) ),
file(unknown,unknown) ).
tff(c_18,plain,
! [Y_14,X_13] :
( ~ truth(isa(other,Y_14))
| ~ truth(isa(asked,X_13)) ),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_36,plain,
! [X_13] : ~ truth(isa(asked,X_13)),
inference(splitLeft,[status(thm)],[c_18]) ).
tff(c_2,plain,
! [P_1] :
( truth(isa(P_1,knave))
| truth(isa(P_1,knight)) ),
inference(cnfTransformation,[status(thm)],[f_36]) ).
tff(c_37,plain,
! [X_23] : ~ truth(isa(asked,X_23)),
inference(splitLeft,[status(thm)],[c_18]) ).
tff(c_41,plain,
truth(isa(asked,knave)),
inference(resolution,[status(thm)],[c_2,c_37]) ).
tff(c_45,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_36,c_41]) ).
tff(c_46,plain,
! [Y_14] : ~ truth(isa(other,Y_14)),
inference(splitRight,[status(thm)],[c_18]) ).
tff(c_47,plain,
! [Y_24] : ~ truth(isa(other,Y_24)),
inference(splitRight,[status(thm)],[c_18]) ).
tff(c_51,plain,
truth(isa(other,knave)),
inference(resolution,[status(thm)],[c_2,c_47]) ).
tff(c_55,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_46,c_51]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : PUZ035-5 : TPTP v8.1.2. Released v2.0.0.
% 0.00/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 : n016.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 : Thu Aug 3 18:05:07 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.62/1.70 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.83/1.70
% 2.83/1.70 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.83/1.73
% 2.83/1.73 Inference rules
% 2.83/1.73 ----------------------
% 2.83/1.73 #Ref : 0
% 2.83/1.73 #Sup : 5
% 2.83/1.73 #Fact : 0
% 2.83/1.73 #Define : 0
% 2.83/1.73 #Split : 1
% 2.83/1.73 #Chain : 0
% 2.83/1.73 #Close : 0
% 2.83/1.73
% 2.83/1.73 Ordering : KBO
% 2.83/1.73
% 2.83/1.73 Simplification rules
% 2.83/1.73 ----------------------
% 2.83/1.73 #Subsume : 0
% 2.83/1.73 #Demod : 0
% 2.83/1.73 #Tautology : 3
% 2.83/1.73 #SimpNegUnit : 2
% 2.83/1.73 #BackRed : 0
% 2.83/1.73
% 2.83/1.73 #Partial instantiations: 0
% 2.83/1.73 #Strategies tried : 1
% 2.83/1.73
% 2.83/1.73 Timing (in seconds)
% 2.83/1.73 ----------------------
% 2.83/1.73 Preprocessing : 0.44
% 2.83/1.73 Parsing : 0.25
% 2.83/1.73 CNF conversion : 0.02
% 2.83/1.73 Main loop : 0.19
% 2.83/1.73 Inferencing : 0.09
% 2.83/1.73 Reduction : 0.03
% 2.83/1.73 Demodulation : 0.02
% 2.83/1.73 BG Simplification : 0.01
% 2.83/1.73 Subsumption : 0.04
% 2.83/1.73 Abstraction : 0.01
% 2.83/1.73 MUC search : 0.00
% 2.83/1.73 Cooper : 0.00
% 2.83/1.73 Total : 0.68
% 2.83/1.73 Index Insertion : 0.00
% 2.83/1.73 Index Deletion : 0.00
% 2.83/1.73 Index Matching : 0.00
% 2.83/1.73 BG Taut test : 0.00
%------------------------------------------------------------------------------