TSTP Solution File: PUZ025-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ025-1 : TPTP v8.1.2. Released v1.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 : n018.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:02 EDT 2023
% Result : Unsatisfiable 3.25s 1.94s
% Output : CNFRefutation 3.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 20
% Syntax : Number of formulae : 45 ( 12 unt; 13 typ; 0 def)
% Number of atoms : 74 ( 0 equ)
% Maximal formula atoms : 4 ( 2 avg)
% Number of connectives : 83 ( 41 ~; 42 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 13 ( 8 >; 5 *; 0 +; 0 <<)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 34 (; 34 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ people > ask_1_if_2 > answer > a_truth > says > equal_type > #nlpp > truthteller > liar > yes > no > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(yes,type,
yes: $i ).
tff(no,type,
no: $i ).
tff(liar,type,
liar: $i > $i ).
tff(people,type,
people: ( $i * $i * $i ) > $o ).
tff(b,type,
b: $i ).
tff(answer,type,
answer: $i > $o ).
tff(a_truth,type,
a_truth: $i > $o ).
tff(ask_1_if_2,type,
ask_1_if_2: ( $i * $i ) > $o ).
tff(truthteller,type,
truthteller: $i > $i ).
tff(says,type,
says: ( $i * $i ) > $i ).
tff(equal_type,type,
equal_type: ( $i * $i ) > $i ).
tff(c,type,
c: $i ).
tff(f_200,axiom,
ask_1_if_2(c,equal_type(a,b)),
file(unknown,unknown) ).
tff(f_53,axiom,
! [X] :
( a_truth(truthteller(X))
| a_truth(liar(X)) ),
file(unknown,unknown) ).
tff(f_203,axiom,
! [Answer] : ~ answer(Answer),
file(unknown,unknown) ).
tff(f_172,axiom,
! [X,Y] :
( ~ ask_1_if_2(X,Y)
| ~ a_truth(truthteller(X))
| a_truth(Y)
| answer(no) ),
file(unknown,unknown) ).
tff(f_183,axiom,
! [X,Y] :
( ~ ask_1_if_2(X,Y)
| ~ a_truth(liar(X))
| ~ a_truth(Y)
| answer(no) ),
file(unknown,unknown) ).
tff(f_193,axiom,
! [X,Y] :
( ~ ask_1_if_2(X,Y)
| ~ a_truth(liar(X))
| a_truth(Y)
| answer(yes) ),
file(unknown,unknown) ).
tff(f_162,axiom,
! [X,Y] :
( ~ ask_1_if_2(X,Y)
| ~ a_truth(truthteller(X))
| ~ a_truth(Y)
| answer(yes) ),
file(unknown,unknown) ).
tff(c_46,plain,
ask_1_if_2(c,equal_type(a,b)),
inference(cnfTransformation,[status(thm)],[f_200]) ).
tff(c_2,plain,
! [X_1] :
( a_truth(liar(X_1))
| a_truth(truthteller(X_1)) ),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_48,plain,
! [Answer_35] : ~ answer(Answer_35),
inference(cnfTransformation,[status(thm)],[f_203]) ).
tff(c_30,plain,
! [Y_30,X_29] :
( answer(no)
| a_truth(Y_30)
| ~ a_truth(truthteller(X_29))
| ~ ask_1_if_2(X_29,Y_30) ),
inference(cnfTransformation,[status(thm)],[f_172]) ).
tff(c_63,plain,
! [Y_45,X_46] :
( a_truth(Y_45)
| ~ a_truth(truthteller(X_46))
| ~ ask_1_if_2(X_46,Y_45) ),
inference(negUnitSimplification,[status(thm)],[c_48,c_30]) ).
tff(c_71,plain,
! [Y_49,X_50] :
( a_truth(Y_49)
| ~ ask_1_if_2(X_50,Y_49)
| a_truth(liar(X_50)) ),
inference(resolution,[status(thm)],[c_2,c_63]) ).
tff(c_74,plain,
( a_truth(equal_type(a,b))
| a_truth(liar(c)) ),
inference(resolution,[status(thm)],[c_46,c_71]) ).
tff(c_95,plain,
a_truth(liar(c)),
inference(splitLeft,[status(thm)],[c_74]) ).
tff(c_32,plain,
! [Y_32,X_31] :
( answer(no)
| ~ a_truth(Y_32)
| ~ a_truth(liar(X_31))
| ~ ask_1_if_2(X_31,Y_32) ),
inference(cnfTransformation,[status(thm)],[f_183]) ).
tff(c_50,plain,
! [Y_32,X_31] :
( ~ a_truth(Y_32)
| ~ a_truth(liar(X_31))
| ~ ask_1_if_2(X_31,Y_32) ),
inference(negUnitSimplification,[status(thm)],[c_48,c_32]) ).
tff(c_102,plain,
! [Y_55] :
( ~ a_truth(Y_55)
| ~ ask_1_if_2(c,Y_55) ),
inference(resolution,[status(thm)],[c_95,c_50]) ).
tff(c_106,plain,
~ a_truth(equal_type(a,b)),
inference(resolution,[status(thm)],[c_46,c_102]) ).
tff(c_34,plain,
! [Y_34,X_33] :
( answer(yes)
| a_truth(Y_34)
| ~ a_truth(liar(X_33))
| ~ ask_1_if_2(X_33,Y_34) ),
inference(cnfTransformation,[status(thm)],[f_193]) ).
tff(c_49,plain,
! [Y_34,X_33] :
( a_truth(Y_34)
| ~ a_truth(liar(X_33))
| ~ ask_1_if_2(X_33,Y_34) ),
inference(negUnitSimplification,[status(thm)],[c_48,c_34]) ).
tff(c_133,plain,
! [Y_62] :
( a_truth(Y_62)
| ~ ask_1_if_2(c,Y_62) ),
inference(resolution,[status(thm)],[c_95,c_49]) ).
tff(c_136,plain,
a_truth(equal_type(a,b)),
inference(resolution,[status(thm)],[c_46,c_133]) ).
tff(c_140,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_106,c_136]) ).
tff(c_142,plain,
~ a_truth(liar(c)),
inference(splitRight,[status(thm)],[c_74]) ).
tff(c_141,plain,
a_truth(equal_type(a,b)),
inference(splitRight,[status(thm)],[c_74]) ).
tff(c_28,plain,
! [Y_28,X_27] :
( answer(yes)
| ~ a_truth(Y_28)
| ~ a_truth(truthteller(X_27))
| ~ ask_1_if_2(X_27,Y_28) ),
inference(cnfTransformation,[status(thm)],[f_162]) ).
tff(c_67,plain,
! [Y_47,X_48] :
( ~ a_truth(Y_47)
| ~ a_truth(truthteller(X_48))
| ~ ask_1_if_2(X_48,Y_47) ),
inference(negUnitSimplification,[status(thm)],[c_48,c_28]) ).
tff(c_150,plain,
! [Y_63,X_64] :
( ~ a_truth(Y_63)
| ~ ask_1_if_2(X_64,Y_63)
| a_truth(liar(X_64)) ),
inference(resolution,[status(thm)],[c_2,c_67]) ).
tff(c_152,plain,
( ~ a_truth(equal_type(a,b))
| a_truth(liar(c)) ),
inference(resolution,[status(thm)],[c_46,c_150]) ).
tff(c_155,plain,
a_truth(liar(c)),
inference(demodulation,[status(thm),theory(equality)],[c_141,c_152]) ).
tff(c_157,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_142,c_155]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : PUZ025-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.11 % 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.10/0.32 % Computer : n018.cluster.edu
% 0.10/0.32 % Model : x86_64 x86_64
% 0.10/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.32 % Memory : 8042.1875MB
% 0.10/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.32 % CPULimit : 300
% 0.10/0.32 % WCLimit : 300
% 0.10/0.32 % DateTime : Thu Aug 3 17:45:05 EDT 2023
% 0.10/0.32 % CPUTime :
% 3.25/1.94 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.25/1.95
% 3.25/1.95 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.35/1.99
% 3.35/1.99 Inference rules
% 3.35/1.99 ----------------------
% 3.35/1.99 #Ref : 0
% 3.35/1.99 #Sup : 20
% 3.35/1.99 #Fact : 0
% 3.35/1.99 #Define : 0
% 3.35/1.99 #Split : 2
% 3.35/1.99 #Chain : 0
% 3.35/1.99 #Close : 0
% 3.35/1.99
% 3.35/1.99 Ordering : KBO
% 3.35/1.99
% 3.35/1.99 Simplification rules
% 3.35/1.99 ----------------------
% 3.35/1.99 #Subsume : 1
% 3.35/1.99 #Demod : 7
% 3.35/1.99 #Tautology : 4
% 3.35/1.99 #SimpNegUnit : 6
% 3.35/1.99 #BackRed : 0
% 3.35/1.99
% 3.35/1.99 #Partial instantiations: 0
% 3.35/1.99 #Strategies tried : 1
% 3.35/1.99
% 3.35/1.99 Timing (in seconds)
% 3.35/1.99 ----------------------
% 3.35/1.99 Preprocessing : 0.50
% 3.35/1.99 Parsing : 0.23
% 3.35/1.99 CNF conversion : 0.03
% 3.35/1.99 Main loop : 0.35
% 3.35/1.99 Inferencing : 0.15
% 3.35/2.00 Reduction : 0.08
% 3.35/2.00 Demodulation : 0.06
% 3.35/2.00 BG Simplification : 0.02
% 3.35/2.00 Subsumption : 0.06
% 3.35/2.00 Abstraction : 0.01
% 3.35/2.00 MUC search : 0.00
% 3.35/2.00 Cooper : 0.00
% 3.35/2.00 Total : 0.92
% 3.35/2.00 Index Insertion : 0.00
% 3.35/2.00 Index Deletion : 0.00
% 3.35/2.00 Index Matching : 0.00
% 3.35/2.00 BG Taut test : 0.00
%------------------------------------------------------------------------------