TSTP Solution File: NUM001-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM001-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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n031.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:50:49 EDT 2023
% Result : Unsatisfiable 13.66s 4.89s
% Output : CNFRefutation 13.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 14
% Syntax : Number of formulae : 29 ( 13 unt; 6 typ; 0 def)
% Number of atoms : 39 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 34 ( 18 ~; 16 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 56 (; 56 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equalish > subtract > add > #nlpp > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(b,type,
b: $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(subtract,type,
subtract: ( $i * $i ) > $i ).
tff(c,type,
c: $i ).
tff(f_61,axiom,
! [A,B,C] : equalish(add(A,add(B,C)),add(add(A,B),C)),
file(unknown,unknown) ).
tff(f_59,axiom,
! [A,B] : equalish(add(A,B),add(B,A)),
file(unknown,unknown) ).
tff(f_65,axiom,
! [A,B] : equalish(A,subtract(add(A,B),B)),
file(unknown,unknown) ).
tff(f_93,axiom,
! [A,B,C,D] :
( ~ equalish(A,B)
| ~ equalish(C,subtract(A,D))
| equalish(C,subtract(B,D)) ),
file(unknown,unknown) ).
tff(f_101,axiom,
! [A,B,C,D] :
( ~ equalish(A,B)
| ~ equalish(C,subtract(D,A))
| equalish(C,subtract(D,B)) ),
file(unknown,unknown) ).
tff(f_63,axiom,
! [A,B] : equalish(subtract(add(A,B),B),A),
file(unknown,unknown) ).
tff(f_57,axiom,
! [A,B,C] :
( ~ equalish(A,B)
| ~ equalish(B,C)
| equalish(A,C) ),
file(unknown,unknown) ).
tff(f_105,axiom,
~ equalish(add(add(a,b),c),add(a,add(b,c))),
file(unknown,unknown) ).
tff(c_8,plain,
! [A_7,B_8,C_9] : equalish(add(A_7,add(B_8,C_9)),add(add(A_7,B_8),C_9)),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_6,plain,
! [A_5,B_6] : equalish(add(A_5,B_6),add(B_6,A_5)),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_12,plain,
! [A_12,B_13] : equalish(A_12,subtract(add(A_12,B_13),B_13)),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_359,plain,
! [C_103,B_104,D_105,A_106] :
( equalish(C_103,subtract(B_104,D_105))
| ~ equalish(C_103,subtract(A_106,D_105))
| ~ equalish(A_106,B_104) ),
inference(cnfTransformation,[status(thm)],[f_93]) ).
tff(c_399,plain,
! [A_107,B_108,B_109] :
( equalish(A_107,subtract(B_108,B_109))
| ~ equalish(add(A_107,B_109),B_108) ),
inference(resolution,[status(thm)],[c_12,c_359]) ).
tff(c_462,plain,
! [A_110,B_111] : equalish(A_110,subtract(add(B_111,A_110),B_111)),
inference(resolution,[status(thm)],[c_6,c_399]) ).
tff(c_24,plain,
! [C_34,D_35,B_33,A_32] :
( equalish(C_34,subtract(D_35,B_33))
| ~ equalish(C_34,subtract(D_35,A_32))
| ~ equalish(A_32,B_33) ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_655,plain,
! [A_134,B_135,B_136] :
( equalish(A_134,subtract(add(B_135,A_134),B_136))
| ~ equalish(B_135,B_136) ),
inference(resolution,[status(thm)],[c_462,c_24]) ).
tff(c_10,plain,
! [A_10,B_11] : equalish(subtract(add(A_10,B_11),B_11),A_10),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_31,plain,
! [A_43,C_44,B_45] :
( equalish(A_43,C_44)
| ~ equalish(B_45,C_44)
| ~ equalish(A_43,B_45) ),
inference(cnfTransformation,[status(thm)],[f_57]) ).
tff(c_42,plain,
! [A_43,A_10,B_11] :
( equalish(A_43,A_10)
| ~ equalish(A_43,subtract(add(A_10,B_11),B_11)) ),
inference(resolution,[status(thm)],[c_10,c_31]) ).
tff(c_675,plain,
! [B_137,B_138] :
( equalish(B_137,B_138)
| ~ equalish(B_138,B_137) ),
inference(resolution,[status(thm)],[c_655,c_42]) ).
tff(c_748,plain,
! [A_7,B_8,C_9] : equalish(add(add(A_7,B_8),C_9),add(A_7,add(B_8,C_9))),
inference(resolution,[status(thm)],[c_8,c_675]) ).
tff(c_26,plain,
~ equalish(add(add(a,b),c),add(a,add(b,c))),
inference(cnfTransformation,[status(thm)],[f_105]) ).
tff(c_24803,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_748,c_26]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM001-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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.13/0.34 % Computer : n031.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 15:09:59 EDT 2023
% 0.13/0.35 % CPUTime :
% 13.66/4.89 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 13.66/4.89
% 13.66/4.89 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 13.86/4.92
% 13.86/4.92 Inference rules
% 13.86/4.92 ----------------------
% 13.86/4.92 #Ref : 0
% 13.86/4.92 #Sup : 6062
% 13.86/4.92 #Fact : 0
% 13.86/4.92 #Define : 0
% 13.86/4.92 #Split : 5
% 13.86/4.92 #Chain : 0
% 13.86/4.92 #Close : 0
% 13.86/4.92
% 13.86/4.92 Ordering : KBO
% 13.86/4.92
% 13.86/4.92 Simplification rules
% 13.86/4.92 ----------------------
% 13.86/4.92 #Subsume : 960
% 13.86/4.92 #Demod : 487
% 13.86/4.92 #Tautology : 463
% 13.86/4.92 #SimpNegUnit : 0
% 13.86/4.92 #BackRed : 1
% 13.86/4.92
% 13.86/4.92 #Partial instantiations: 0
% 13.86/4.92 #Strategies tried : 1
% 13.86/4.92
% 13.86/4.92 Timing (in seconds)
% 13.86/4.92 ----------------------
% 13.86/4.92 Preprocessing : 0.45
% 13.86/4.92 Parsing : 0.25
% 13.86/4.92 CNF conversion : 0.02
% 13.86/4.92 Main loop : 3.31
% 13.86/4.93 Inferencing : 0.77
% 13.86/4.93 Reduction : 0.70
% 13.86/4.93 Demodulation : 0.53
% 13.86/4.93 BG Simplification : 0.06
% 13.86/4.93 Subsumption : 1.51
% 13.86/4.93 Abstraction : 0.06
% 13.86/4.93 MUC search : 0.00
% 13.86/4.93 Cooper : 0.00
% 13.86/4.93 Total : 3.81
% 13.86/4.93 Index Insertion : 0.00
% 13.86/4.93 Index Deletion : 0.00
% 13.86/4.93 Index Matching : 0.00
% 13.86/4.93 BG Taut test : 0.00
%------------------------------------------------------------------------------