TSTP Solution File: PUZ035-4 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ035-4 : 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/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n012.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.05s 1.70s
% Output : CNFRefutation 3.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 15
% Syntax : Number of formulae : 33 ( 14 unt; 10 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 : 9 ( 6 >; 3 *; 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_119,axiom,
! [P1,P2,S] :
( ~ truth(isa(asked,P1))
| ~ truth(isa(other,P2))
| ~ says(asked,S) ),
file(unknown,unknown) ).
tff(f_109,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_110,axiom,
person(other),
file(unknown,unknown) ).
tff(f_65,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_28,plain,
! [S_20,P2_19,P1_18] :
( ~ says(asked,S_20)
| ~ truth(isa(other,P2_19))
| ~ truth(isa(asked,P1_18)) ),
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_46,plain,
! [P1_18] : ~ truth(isa(asked,P1_18)),
inference(splitLeft,[status(thm)],[c_28]) ).
tff(c_24,plain,
person(asked),
inference(cnfTransformation,[status(thm)],[f_109]) ).
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_47,plain,
! [P1_38] : ~ truth(isa(asked,P1_38)),
inference(splitLeft,[status(thm)],[c_28]) ).
tff(c_51,plain,
( truth(isa(asked,knave))
| ~ person(asked) ),
inference(resolution,[status(thm)],[c_2,c_47]) ).
tff(c_54,plain,
truth(isa(asked,knave)),
inference(demodulation,[status(thm),theory(equality)],[c_24,c_51]) ).
tff(c_56,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_46,c_54]) ).
tff(c_57,plain,
! [S_20,P2_19] :
( ~ says(asked,S_20)
| ~ truth(isa(other,P2_19)) ),
inference(splitRight,[status(thm)],[c_28]) ).
tff(c_58,plain,
! [P2_19] : ~ truth(isa(other,P2_19)),
inference(splitLeft,[status(thm)],[c_57]) ).
tff(c_26,plain,
person(other),
inference(cnfTransformation,[status(thm)],[f_110]) ).
tff(c_59,plain,
! [P2_39] : ~ truth(isa(other,P2_39)),
inference(splitLeft,[status(thm)],[c_57]) ).
tff(c_63,plain,
( truth(isa(other,knave))
| ~ person(other) ),
inference(resolution,[status(thm)],[c_2,c_59]) ).
tff(c_66,plain,
truth(isa(other,knave)),
inference(demodulation,[status(thm),theory(equality)],[c_26,c_63]) ).
tff(c_68,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_58,c_66]) ).
tff(c_69,plain,
! [S_20] : ~ says(asked,S_20),
inference(splitRight,[status(thm)],[c_57]) ).
tff(c_10,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_65]) ).
tff(c_72,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_69,c_69,c_10]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PUZ035-4 : TPTP v8.1.2. Released v2.0.0.
% 0.00/0.14 % Command : java -Dfile.encoding=UTF-8 -Xms512M -Xmx4G -Xss10M -jar /export/starexec/sandbox2/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox2/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.15/0.36 % Computer : n012.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 17:31:37 EDT 2023
% 0.22/0.36 % CPUTime :
% 3.05/1.70 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.05/1.70
% 3.05/1.70 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.19/1.73
% 3.19/1.73 Inference rules
% 3.19/1.73 ----------------------
% 3.19/1.73 #Ref : 0
% 3.19/1.73 #Sup : 4
% 3.19/1.73 #Fact : 0
% 3.19/1.73 #Define : 0
% 3.19/1.73 #Split : 2
% 3.19/1.73 #Chain : 0
% 3.19/1.73 #Close : 0
% 3.19/1.73
% 3.19/1.73 Ordering : KBO
% 3.19/1.73
% 3.19/1.73 Simplification rules
% 3.19/1.73 ----------------------
% 3.19/1.73 #Subsume : 0
% 3.19/1.73 #Demod : 2
% 3.19/1.73 #Tautology : 1
% 3.19/1.73 #SimpNegUnit : 3
% 3.19/1.73 #BackRed : 0
% 3.19/1.73
% 3.19/1.73 #Partial instantiations: 0
% 3.19/1.73 #Strategies tried : 1
% 3.19/1.73
% 3.19/1.73 Timing (in seconds)
% 3.19/1.73 ----------------------
% 3.19/1.73 Preprocessing : 0.45
% 3.19/1.73 Parsing : 0.24
% 3.19/1.73 CNF conversion : 0.03
% 3.19/1.73 Main loop : 0.22
% 3.19/1.73 Inferencing : 0.09
% 3.19/1.73 Reduction : 0.05
% 3.19/1.73 Demodulation : 0.04
% 3.19/1.73 BG Simplification : 0.01
% 3.19/1.73 Subsumption : 0.04
% 3.19/1.73 Abstraction : 0.01
% 3.19/1.73 MUC search : 0.00
% 3.19/1.74 Cooper : 0.00
% 3.19/1.74 Total : 0.72
% 3.19/1.74 Index Insertion : 0.00
% 3.19/1.74 Index Deletion : 0.00
% 3.22/1.74 Index Matching : 0.00
% 3.22/1.74 BG Taut test : 0.00
%------------------------------------------------------------------------------