TSTP Solution File: BOO075-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : BOO075-1 : TPTP v8.1.2. Released v2.6.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 : n020.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:34:32 EDT 2023
% Result : Unsatisfiable 4.49s 2.30s
% Output : CNFRefutation 4.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 5
% Syntax : Number of formulae : 28 ( 25 unt; 3 typ; 0 def)
% Number of atoms : 25 ( 24 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 10 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 49 (; 49 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ nand > #nlpp > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(nand,type,
nand: ( $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(f_24,axiom,
! [A,B,C] : ( nand(nand(A,nand(nand(B,A),A)),nand(B,nand(C,A))) = B ),
file(unknown,unknown) ).
tff(f_26,axiom,
nand(nand(a,a),nand(b,a)) != a,
file(unknown,unknown) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( nand(nand(A_1,nand(nand(B_2,A_1),A_1)),nand(B_2,nand(C_3,A_1))) = B_2 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_5,plain,
! [A_4,B_5,C_6] : ( nand(nand(A_4,nand(nand(B_5,A_4),A_4)),nand(B_5,nand(C_6,A_4))) = B_5 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_32,plain,
! [B_7,C_8,A_9,B_10] : ( nand(nand(nand(B_7,nand(C_8,A_9)),nand(nand(B_10,nand(B_7,nand(C_8,A_9))),nand(B_7,nand(C_8,A_9)))),nand(B_10,B_7)) = B_10 ),
inference(superposition,[status(thm),theory(equality)],[c_5,c_2]) ).
tff(c_118,plain,
! [A_1,B_2,C_3,B_10] : ( nand(nand(nand(nand(A_1,nand(nand(B_2,A_1),A_1)),nand(B_2,nand(C_3,A_1))),nand(nand(B_10,nand(nand(A_1,nand(nand(B_2,A_1),A_1)),nand(B_2,nand(C_3,A_1)))),B_2)),nand(B_10,nand(A_1,nand(nand(B_2,A_1),A_1)))) = B_10 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_32]) ).
tff(c_141,plain,
! [B_2,B_10,A_1] : ( nand(nand(B_2,nand(nand(B_10,B_2),B_2)),nand(B_10,nand(A_1,nand(nand(B_2,A_1),A_1)))) = B_10 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_118]) ).
tff(c_219,plain,
! [B_14,B_15,A_16] : ( nand(nand(B_14,nand(nand(B_15,B_14),B_14)),nand(B_15,nand(A_16,nand(nand(B_14,A_16),A_16)))) = B_15 ),
inference(demodulation,[status(thm),theory(equality)],[c_2,c_2,c_118]) ).
tff(c_435,plain,
! [B_20,A_21] : ( nand(nand(B_20,nand(nand(nand(A_21,nand(nand(A_21,A_21),A_21)),B_20),B_20)),A_21) = nand(A_21,nand(nand(A_21,A_21),A_21)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_219]) ).
tff(c_521,plain,
! [B_20,B_2] : ( nand(nand(B_20,nand(nand(nand(nand(B_2,nand(nand(B_2,B_2),B_2)),nand(B_2,nand(B_2,nand(nand(B_2,B_2),B_2)))),B_20),B_20)),nand(B_2,nand(nand(B_2,B_2),B_2))) = nand(nand(B_2,nand(nand(B_2,B_2),B_2)),nand(nand(nand(B_2,nand(nand(B_2,B_2),B_2)),nand(B_2,nand(nand(B_2,B_2),B_2))),nand(B_2,nand(nand(B_2,B_2),B_2)))) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_435]) ).
tff(c_541,plain,
! [B_22,B_23] : ( nand(nand(B_22,nand(nand(B_23,B_22),B_22)),nand(B_23,nand(nand(B_23,B_23),B_23))) = B_23 ),
inference(demodulation,[status(thm),theory(equality)],[c_141,c_141,c_2,c_521]) ).
tff(c_281,plain,
! [B_14,A_1] : ( nand(nand(B_14,nand(nand(nand(A_1,nand(nand(A_1,A_1),A_1)),B_14),B_14)),A_1) = nand(A_1,nand(nand(A_1,A_1),A_1)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_219]) ).
tff(c_559,plain,
! [B_23] : ( nand(nand(nand(B_23,nand(nand(B_23,B_23),B_23)),nand(B_23,nand(B_23,nand(nand(B_23,B_23),B_23)))),B_23) = nand(B_23,nand(nand(B_23,B_23),B_23)) ),
inference(superposition,[status(thm),theory(equality)],[c_541,c_281]) ).
tff(c_658,plain,
! [B_23] : ( nand(B_23,nand(nand(B_23,B_23),B_23)) = nand(B_23,B_23) ),
inference(demodulation,[status(thm),theory(equality)],[c_141,c_559]) ).
tff(c_682,plain,
! [B_24] : ( nand(B_24,nand(nand(B_24,B_24),B_24)) = nand(B_24,B_24) ),
inference(demodulation,[status(thm),theory(equality)],[c_141,c_559]) ).
tff(c_743,plain,
! [B_24] : ( nand(nand(B_24,nand(nand(B_24,B_24),B_24)),nand(B_24,B_24)) = B_24 ),
inference(superposition,[status(thm),theory(equality)],[c_682,c_2]) ).
tff(c_762,plain,
! [B_24] : ( nand(nand(B_24,B_24),nand(B_24,B_24)) = B_24 ),
inference(demodulation,[status(thm),theory(equality)],[c_658,c_743]) ).
tff(c_1116,plain,
! [B_30,A_31] : ( nand(nand(B_30,nand(nand(nand(A_31,A_31),B_30),B_30)),A_31) = nand(A_31,A_31) ),
inference(demodulation,[status(thm),theory(equality)],[c_658,c_658,c_281]) ).
tff(c_26,plain,
! [C_3,A_1,B_2] : ( nand(nand(nand(C_3,A_1),nand(nand(nand(A_1,nand(nand(B_2,A_1),A_1)),nand(C_3,A_1)),nand(C_3,A_1))),B_2) = nand(A_1,nand(nand(B_2,A_1),A_1)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_5]) ).
tff(c_1138,plain,
! [C_3,B_30] : ( nand(nand(nand(C_3,B_30),nand(nand(nand(C_3,B_30),nand(C_3,B_30)),nand(C_3,B_30))),nand(nand(C_3,B_30),nand(C_3,B_30))) = nand(B_30,nand(nand(nand(nand(C_3,B_30),nand(C_3,B_30)),B_30),B_30)) ),
inference(superposition,[status(thm),theory(equality)],[c_1116,c_26]) ).
tff(c_2075,plain,
! [B_40,C_41] : ( nand(B_40,nand(nand(nand(nand(C_41,B_40),nand(C_41,B_40)),B_40),B_40)) = nand(C_41,B_40) ),
inference(demodulation,[status(thm),theory(equality)],[c_762,c_658,c_1138]) ).
tff(c_737,plain,
! [B_24,C_3] : ( nand(nand(B_24,B_24),nand(B_24,nand(C_3,B_24))) = B_24 ),
inference(superposition,[status(thm),theory(equality)],[c_682,c_2]) ).
tff(c_2145,plain,
! [B_40,C_41] : ( nand(nand(B_40,B_40),nand(C_41,B_40)) = B_40 ),
inference(superposition,[status(thm),theory(equality)],[c_2075,c_737]) ).
tff(c_4,plain,
nand(nand(a,a),nand(b,a)) != a,
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_2354,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2145,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : BOO075-1 : TPTP v8.1.2. Released v2.6.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 : n020.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 18:32:22 EDT 2023
% 0.15/0.36 % CPUTime :
% 4.49/2.30 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.49/2.30
% 4.49/2.30 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.98/2.34
% 4.98/2.34 Inference rules
% 4.98/2.34 ----------------------
% 4.98/2.34 #Ref : 0
% 4.98/2.34 #Sup : 590
% 4.98/2.34 #Fact : 0
% 4.98/2.34 #Define : 0
% 4.98/2.34 #Split : 0
% 4.98/2.34 #Chain : 0
% 4.98/2.34 #Close : 0
% 4.98/2.34
% 4.98/2.34 Ordering : KBO
% 4.98/2.34
% 4.98/2.34 Simplification rules
% 4.98/2.34 ----------------------
% 4.98/2.34 #Subsume : 0
% 4.98/2.34 #Demod : 848
% 4.98/2.34 #Tautology : 197
% 4.98/2.34 #SimpNegUnit : 0
% 4.98/2.34 #BackRed : 3
% 4.98/2.34
% 4.98/2.34 #Partial instantiations: 0
% 4.98/2.34 #Strategies tried : 1
% 4.98/2.34
% 4.98/2.34 Timing (in seconds)
% 4.98/2.34 ----------------------
% 5.56/2.35 Preprocessing : 0.37
% 5.56/2.35 Parsing : 0.20
% 5.56/2.35 CNF conversion : 0.02
% 5.56/2.35 Main loop : 0.89
% 5.56/2.35 Inferencing : 0.32
% 5.56/2.35 Reduction : 0.39
% 5.56/2.35 Demodulation : 0.33
% 5.56/2.35 BG Simplification : 0.04
% 5.56/2.35 Subsumption : 0.09
% 5.56/2.35 Abstraction : 0.11
% 5.56/2.35 MUC search : 0.00
% 5.56/2.35 Cooper : 0.00
% 5.56/2.35 Total : 1.32
% 5.56/2.35 Index Insertion : 0.00
% 5.56/2.35 Index Deletion : 0.00
% 5.56/2.35 Index Matching : 0.00
% 5.56/2.35 BG Taut test : 0.00
%------------------------------------------------------------------------------