TSTP Solution File: NUM020-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM020-1 : TPTP v8.1.2. Bugfixed v4.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 : n011.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:51 EDT 2023
% Result : Unsatisfiable 6.88s 2.75s
% Output : CNFRefutation 7.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 12
% Syntax : Number of formulae : 21 ( 8 unt; 7 typ; 0 def)
% Number of atoms : 23 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 21 ( 12 ~; 9 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 22 (; 22 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ equalish > multiply > add > #nlpp > successor > n1 > n0 > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(n1,type,
n1: $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(n0,type,
n0: $i ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(successor,type,
successor: $i > $i ).
tff(f_51,axiom,
! [A] : equalish(add(A,n0),A),
file(unknown,unknown) ).
tff(f_53,axiom,
! [A,B] : equalish(add(A,successor(B)),successor(add(A,B))),
file(unknown,unknown) ).
tff(f_67,axiom,
! [A,B] :
( ~ equalish(A,B)
| equalish(successor(A),successor(B)) ),
file(unknown,unknown) ).
tff(f_84,axiom,
! [X,Y,Z] :
( ~ equalish(X,Y)
| ~ equalish(Y,Z)
| equalish(X,Z) ),
file(unknown,unknown) ).
tff(f_87,axiom,
~ equalish(add(a,successor(n0)),successor(a)),
file(unknown,unknown) ).
tff(c_2,plain,
! [A_1] : equalish(add(A_1,n0),A_1),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_4,plain,
! [A_2,B_3] : equalish(add(A_2,successor(B_3)),successor(add(A_2,B_3))),
inference(cnfTransformation,[status(thm)],[f_53]) ).
tff(c_12,plain,
! [A_9,B_10] :
( equalish(successor(A_9),successor(B_10))
| ~ equalish(A_9,B_10) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_84,plain,
! [X_34,Z_35,Y_36] :
( equalish(X_34,Z_35)
| ~ equalish(Y_36,Z_35)
| ~ equalish(X_34,Y_36) ),
inference(cnfTransformation,[status(thm)],[f_84]) ).
tff(c_707,plain,
! [X_74,B_75,A_76] :
( equalish(X_74,successor(B_75))
| ~ equalish(X_74,successor(A_76))
| ~ equalish(A_76,B_75) ),
inference(resolution,[status(thm)],[c_12,c_84]) ).
tff(c_4921,plain,
! [A_166,B_167,B_168] :
( equalish(add(A_166,successor(B_167)),successor(B_168))
| ~ equalish(add(A_166,B_167),B_168) ),
inference(resolution,[status(thm)],[c_4,c_707]) ).
tff(c_22,plain,
~ equalish(add(a,successor(n0)),successor(a)),
inference(cnfTransformation,[status(thm)],[f_87]) ).
tff(c_4947,plain,
~ equalish(add(a,n0),a),
inference(resolution,[status(thm)],[c_4921,c_22]) ).
tff(c_4962,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_4947]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM020-1 : TPTP v8.1.2. Bugfixed v4.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.15/0.36 % Computer : n011.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 15:21:20 EDT 2023
% 0.15/0.36 % CPUTime :
% 6.88/2.75 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 6.88/2.76
% 6.88/2.76 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 7.17/2.78
% 7.17/2.78 Inference rules
% 7.17/2.78 ----------------------
% 7.17/2.78 #Ref : 0
% 7.17/2.78 #Sup : 1145
% 7.17/2.78 #Fact : 0
% 7.17/2.78 #Define : 0
% 7.17/2.78 #Split : 1
% 7.17/2.78 #Chain : 0
% 7.17/2.78 #Close : 0
% 7.17/2.78
% 7.17/2.78 Ordering : KBO
% 7.17/2.78
% 7.17/2.78 Simplification rules
% 7.17/2.78 ----------------------
% 7.17/2.78 #Subsume : 235
% 7.17/2.78 #Demod : 431
% 7.17/2.78 #Tautology : 307
% 7.17/2.78 #SimpNegUnit : 31
% 7.17/2.78 #BackRed : 0
% 7.17/2.78
% 7.17/2.78 #Partial instantiations: 0
% 7.17/2.78 #Strategies tried : 1
% 7.17/2.78
% 7.17/2.78 Timing (in seconds)
% 7.17/2.78 ----------------------
% 7.17/2.79 Preprocessing : 0.43
% 7.17/2.79 Parsing : 0.23
% 7.17/2.79 CNF conversion : 0.02
% 7.17/2.79 Main loop : 1.27
% 7.17/2.79 Inferencing : 0.41
% 7.17/2.79 Reduction : 0.37
% 7.17/2.79 Demodulation : 0.26
% 7.17/2.79 BG Simplification : 0.03
% 7.17/2.79 Subsumption : 0.39
% 7.17/2.79 Abstraction : 0.04
% 7.17/2.79 MUC search : 0.00
% 7.17/2.79 Cooper : 0.00
% 7.17/2.79 Total : 1.75
% 7.17/2.79 Index Insertion : 0.00
% 7.17/2.79 Index Deletion : 0.00
% 7.17/2.79 Index Matching : 0.00
% 7.17/2.79 BG Taut test : 0.00
%------------------------------------------------------------------------------