TSTP Solution File: PUZ009-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : PUZ009-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 : n007.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:53:51 EDT 2023
% Result : Unsatisfiable 2.32s 1.48s
% Output : CNFRefutation 2.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 25 ( 8 unt; 5 typ; 0 def)
% Number of atoms : 36 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 33 ( 17 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 0 ( 0 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 6 prp; 0-0 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 0 (; 0 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ #nlpp > e_is_a_knight > d_is_a_knight > c_is_a_knight > b_is_a_knight > a_is_a_knight
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a_is_a_knight,type,
a_is_a_knight: $o ).
tff(c_is_a_knight,type,
c_is_a_knight: $o ).
tff(b_is_a_knight,type,
b_is_a_knight: $o ).
tff(e_is_a_knight,type,
e_is_a_knight: $o ).
tff(d_is_a_knight,type,
d_is_a_knight: $o ).
tff(f_113,axiom,
b_is_a_knight,
file(unknown,unknown) ).
tff(f_45,axiom,
( ~ b_is_a_knight
| ~ a_is_a_knight ),
file(unknown,unknown) ).
tff(f_108,axiom,
( a_is_a_knight
| e_is_a_knight ),
file(unknown,unknown) ).
tff(f_112,axiom,
( a_is_a_knight
| ~ c_is_a_knight ),
file(unknown,unknown) ).
tff(f_80,axiom,
( ~ e_is_a_knight
| ~ d_is_a_knight
| c_is_a_knight ),
file(unknown,unknown) ).
tff(f_98,axiom,
( d_is_a_knight
| ~ b_is_a_knight
| c_is_a_knight ),
file(unknown,unknown) ).
tff(c_36,plain,
b_is_a_knight,
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_6,plain,
( ~ a_is_a_knight
| ~ b_is_a_knight ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_44,plain,
~ a_is_a_knight,
inference(demodulation,[status(thm),theory(equality)],[c_36,c_6]) ).
tff(c_32,plain,
( e_is_a_knight
| a_is_a_knight ),
inference(cnfTransformation,[status(thm)],[f_108]) ).
tff(c_46,plain,
e_is_a_knight,
inference(negUnitSimplification,[status(thm)],[c_44,c_32]) ).
tff(c_34,plain,
( ~ c_is_a_knight
| a_is_a_knight ),
inference(cnfTransformation,[status(thm)],[f_112]) ).
tff(c_45,plain,
~ c_is_a_knight,
inference(negUnitSimplification,[status(thm)],[c_44,c_34]) ).
tff(c_20,plain,
( c_is_a_knight
| ~ d_is_a_knight
| ~ e_is_a_knight ),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_47,plain,
( ~ d_is_a_knight
| ~ e_is_a_knight ),
inference(negUnitSimplification,[status(thm)],[c_45,c_20]) ).
tff(c_51,plain,
~ d_is_a_knight,
inference(demodulation,[status(thm),theory(equality)],[c_46,c_47]) ).
tff(c_28,plain,
( c_is_a_knight
| ~ b_is_a_knight
| d_is_a_knight ),
inference(cnfTransformation,[status(thm)],[f_98]) ).
tff(c_38,plain,
( c_is_a_knight
| d_is_a_knight ),
inference(demodulation,[status(thm),theory(equality)],[c_36,c_28]) ).
tff(c_48,plain,
d_is_a_knight,
inference(negUnitSimplification,[status(thm)],[c_45,c_38]) ).
tff(c_52,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_51,c_48]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : PUZ009-1 : TPTP v8.1.2. Released v1.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.14/0.35 % Computer : n007.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:27:09 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.32/1.48 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.32/1.49
% 2.32/1.49 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.32/1.52
% 2.32/1.52 Inference rules
% 2.32/1.52 ----------------------
% 2.32/1.52 #Ref : 0
% 2.32/1.52 #Sup : 0
% 2.32/1.52 #Fact : 0
% 2.32/1.52 #Define : 0
% 2.32/1.52 #Split : 0
% 2.32/1.52 #Chain : 0
% 2.32/1.52 #Close : 0
% 2.32/1.52
% 2.32/1.52 Ordering : KBO
% 2.32/1.52
% 2.32/1.52 Simplification rules
% 2.32/1.52 ----------------------
% 2.32/1.52 #Subsume : 14
% 2.32/1.52 #Demod : 7
% 2.32/1.52 #Tautology : 3
% 2.32/1.52 #SimpNegUnit : 5
% 2.32/1.52 #BackRed : 0
% 2.32/1.52
% 2.32/1.52 #Partial instantiations: 0
% 2.32/1.52 #Strategies tried : 1
% 2.32/1.52
% 2.32/1.52 Timing (in seconds)
% 2.32/1.52 ----------------------
% 2.32/1.52 Preprocessing : 0.38
% 2.32/1.52 Parsing : 0.20
% 2.32/1.52 CNF conversion : 0.02
% 2.32/1.52 Main loop : 0.08
% 2.32/1.52 Inferencing : 0.00
% 2.32/1.52 Reduction : 0.03
% 2.32/1.52 Demodulation : 0.02
% 2.32/1.52 BG Simplification : 0.01
% 2.32/1.52 Subsumption : 0.03
% 2.32/1.52 Abstraction : 0.01
% 2.32/1.52 MUC search : 0.00
% 2.32/1.52 Cooper : 0.00
% 2.32/1.52 Total : 0.50
% 2.32/1.52 Index Insertion : 0.00
% 2.32/1.52 Index Deletion : 0.00
% 2.32/1.52 Index Matching : 0.00
% 2.32/1.52 BG Taut test : 0.00
%------------------------------------------------------------------------------