TSTP Solution File: PUZ023-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ023-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 : n015.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:01 EDT 2023
% Result : Unsatisfiable 3.04s 1.76s
% Output : CNFRefutation 3.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 21
% Syntax : Number of formulae : 47 ( 16 unt; 15 typ; 0 def)
% Number of atoms : 56 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 56 ( 32 ~; 24 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 2 ( 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-3 aty)
% Number of functors : 12 ( 12 usr; 9 con; 0-2 aty)
% Number of variables : 6 (; 6 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ people > an_answer > a_truth > says > #nlpp > truthteller > liar > one_truthteller > garbage > c > b_truthteller_and_c_liar > b_liar_and_c_truthteller > b_and_c_truthtellers > b_and_c_liars > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(liar,type,
liar: $i > $i ).
tff(an_answer,type,
an_answer: $i > $o ).
tff(people,type,
people: ( $i * $i * $i ) > $o ).
tff(b,type,
b: $i ).
tff(b_and_c_truthtellers,type,
b_and_c_truthtellers: $i ).
tff(b_liar_and_c_truthteller,type,
b_liar_and_c_truthteller: $i ).
tff(garbage,type,
garbage: $i ).
tff(b_and_c_liars,type,
b_and_c_liars: $i ).
tff(b_truthteller_and_c_liar,type,
b_truthteller_and_c_liar: $i ).
tff(a_truth,type,
a_truth: $i > $o ).
tff(truthteller,type,
truthteller: $i > $i ).
tff(says,type,
says: ( $i * $i ) > $i ).
tff(one_truthteller,type,
one_truthteller: $i ).
tff(c,type,
c: $i ).
tff(f_217,axiom,
! [X] : ~ an_answer(X),
file(unknown,unknown) ).
tff(f_200,axiom,
( ~ a_truth(liar(b))
| ~ a_truth(truthteller(c))
| an_answer(b_liar_and_c_truthteller) ),
file(unknown,unknown) ).
tff(f_56,axiom,
! [X] :
( a_truth(truthteller(X))
| a_truth(liar(X)) ),
file(unknown,unknown) ).
tff(f_214,axiom,
( ~ a_truth(truthteller(b))
| ~ a_truth(truthteller(c))
| an_answer(b_and_c_truthtellers) ),
file(unknown,unknown) ).
tff(f_207,axiom,
( ~ a_truth(truthteller(b))
| ~ a_truth(liar(c))
| an_answer(b_truthteller_and_c_liar) ),
file(unknown,unknown) ).
tff(f_193,axiom,
( ~ a_truth(liar(b))
| ~ a_truth(liar(c))
| an_answer(b_and_c_liars) ),
file(unknown,unknown) ).
tff(c_44,plain,
! [X_32] : ~ an_answer(X_32),
inference(cnfTransformation,[status(thm)],[f_217]) ).
tff(c_38,plain,
( an_answer(b_liar_and_c_truthteller)
| ~ a_truth(truthteller(c))
| ~ a_truth(liar(b)) ),
inference(cnfTransformation,[status(thm)],[f_200]) ).
tff(c_47,plain,
( ~ a_truth(truthteller(c))
| ~ a_truth(liar(b)) ),
inference(negUnitSimplification,[status(thm)],[c_44,c_38]) ).
tff(c_50,plain,
~ a_truth(liar(b)),
inference(splitLeft,[status(thm)],[c_47]) ).
tff(c_52,plain,
! [X_34] :
( a_truth(liar(X_34))
| a_truth(truthteller(X_34)) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_42,plain,
( an_answer(b_and_c_truthtellers)
| ~ a_truth(truthteller(c))
| ~ a_truth(truthteller(b)) ),
inference(cnfTransformation,[status(thm)],[f_214]) ).
tff(c_45,plain,
( ~ a_truth(truthteller(c))
| ~ a_truth(truthteller(b)) ),
inference(negUnitSimplification,[status(thm)],[c_44,c_42]) ).
tff(c_51,plain,
~ a_truth(truthteller(b)),
inference(splitLeft,[status(thm)],[c_45]) ).
tff(c_55,plain,
a_truth(liar(b)),
inference(resolution,[status(thm)],[c_52,c_51]) ).
tff(c_59,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_50,c_55]) ).
tff(c_61,plain,
a_truth(truthteller(b)),
inference(splitRight,[status(thm)],[c_45]) ).
tff(c_40,plain,
( an_answer(b_truthteller_and_c_liar)
| ~ a_truth(liar(c))
| ~ a_truth(truthteller(b)) ),
inference(cnfTransformation,[status(thm)],[f_207]) ).
tff(c_46,plain,
( ~ a_truth(liar(c))
| ~ a_truth(truthteller(b)) ),
inference(negUnitSimplification,[status(thm)],[c_44,c_40]) ).
tff(c_68,plain,
~ a_truth(liar(c)),
inference(demodulation,[status(thm),theory(equality)],[c_61,c_46]) ).
tff(c_69,plain,
! [X_36] :
( a_truth(liar(X_36))
| a_truth(truthteller(X_36)) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_60,plain,
~ a_truth(truthteller(c)),
inference(splitRight,[status(thm)],[c_45]) ).
tff(c_75,plain,
a_truth(liar(c)),
inference(resolution,[status(thm)],[c_69,c_60]) ).
tff(c_80,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_68,c_75]) ).
tff(c_82,plain,
a_truth(liar(b)),
inference(splitRight,[status(thm)],[c_47]) ).
tff(c_36,plain,
( an_answer(b_and_c_liars)
| ~ a_truth(liar(c))
| ~ a_truth(liar(b)) ),
inference(cnfTransformation,[status(thm)],[f_193]) ).
tff(c_48,plain,
( ~ a_truth(liar(c))
| ~ a_truth(liar(b)) ),
inference(negUnitSimplification,[status(thm)],[c_44,c_36]) ).
tff(c_85,plain,
~ a_truth(liar(c)),
inference(demodulation,[status(thm),theory(equality)],[c_82,c_48]) ).
tff(c_86,plain,
! [X_38] :
( a_truth(liar(X_38))
| a_truth(truthteller(X_38)) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_81,plain,
~ a_truth(truthteller(c)),
inference(splitRight,[status(thm)],[c_47]) ).
tff(c_92,plain,
a_truth(liar(c)),
inference(resolution,[status(thm)],[c_86,c_81]) ).
tff(c_97,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_85,c_92]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : PUZ023-1 : TPTP v8.1.2. Released v1.0.0.
% 0.14/0.15 % 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.37 % Computer : n015.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 17:51:29 EDT 2023
% 0.15/0.37 % CPUTime :
% 3.04/1.76 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.04/1.76
% 3.04/1.76 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.32/1.79
% 3.32/1.79 Inference rules
% 3.32/1.79 ----------------------
% 3.32/1.79 #Ref : 0
% 3.32/1.79 #Sup : 6
% 3.32/1.79 #Fact : 0
% 3.32/1.79 #Define : 0
% 3.32/1.79 #Split : 2
% 3.32/1.79 #Chain : 0
% 3.32/1.79 #Close : 0
% 3.32/1.79
% 3.32/1.79 Ordering : KBO
% 3.32/1.79
% 3.32/1.79 Simplification rules
% 3.32/1.79 ----------------------
% 3.32/1.79 #Subsume : 4
% 3.32/1.79 #Demod : 2
% 3.32/1.79 #Tautology : 2
% 3.32/1.79 #SimpNegUnit : 7
% 3.32/1.79 #BackRed : 0
% 3.32/1.79
% 3.32/1.79 #Partial instantiations: 0
% 3.32/1.79 #Strategies tried : 1
% 3.32/1.79
% 3.32/1.79 Timing (in seconds)
% 3.32/1.79 ----------------------
% 3.32/1.80 Preprocessing : 0.48
% 3.32/1.80 Parsing : 0.22
% 3.32/1.80 CNF conversion : 0.03
% 3.32/1.80 Main loop : 0.24
% 3.32/1.80 Inferencing : 0.09
% 3.32/1.80 Reduction : 0.06
% 3.32/1.80 Demodulation : 0.04
% 3.32/1.80 BG Simplification : 0.02
% 3.32/1.80 Subsumption : 0.05
% 3.32/1.80 Abstraction : 0.01
% 3.32/1.80 MUC search : 0.00
% 3.32/1.80 Cooper : 0.00
% 3.32/1.80 Total : 0.77
% 3.32/1.80 Index Insertion : 0.00
% 3.32/1.80 Index Deletion : 0.00
% 3.32/1.80 Index Matching : 0.00
% 3.32/1.80 BG Taut test : 0.00
%------------------------------------------------------------------------------