TSTP Solution File: ROB009-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ROB009-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 : n002.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:55:04 EDT 2023
% Result : Unsatisfiable 3.11s 1.86s
% Output : CNFRefutation 3.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 10
% Syntax : Number of formulae : 19 ( 14 unt; 5 typ; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 17 (; 17 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ add > #nlpp > negate > 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(negate,type,
negate: $i > $i ).
tff(c,type,
c: $i ).
tff(f_54,axiom,
a != b,
file(unknown,unknown) ).
tff(f_49,axiom,
! [X,Y] : ( negate(add(negate(add(X,Y)),negate(add(X,negate(Y))))) = X ),
file(unknown,unknown) ).
tff(f_45,axiom,
! [X,Y] : ( add(X,Y) = add(Y,X) ),
file(unknown,unknown) ).
tff(f_47,axiom,
! [X,Y,Z] : ( add(add(X,Y),Z) = add(X,add(Y,Z)) ),
file(unknown,unknown) ).
tff(f_52,axiom,
negate(add(a,negate(add(b,c)))) = negate(add(b,negate(add(a,c)))),
file(unknown,unknown) ).
tff(c_10,plain,
b != a,
inference(cnfTransformation,[status(thm)],[f_54]) ).
tff(c_6,plain,
! [X_6,Y_7] : ( negate(add(negate(add(X_6,Y_7)),negate(add(X_6,negate(Y_7))))) = X_6 ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_2,plain,
! [Y_2,X_1] : ( add(Y_2,X_1) = add(X_1,Y_2) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_44,plain,
! [X_10,Y_11,Z_12] : ( add(add(X_10,Y_11),Z_12) = add(X_10,add(Y_11,Z_12)) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_53,plain,
! [Z_12,X_10,Y_11] : ( add(Z_12,add(X_10,Y_11)) = add(X_10,add(Y_11,Z_12)) ),
inference(superposition,[status(thm),theory(equality)],[c_44,c_2]) ).
tff(c_8,plain,
negate(add(b,negate(add(a,c)))) = negate(add(a,negate(add(b,c)))),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_377,plain,
negate(add(negate(add(b,add(a,c))),negate(add(a,negate(add(b,c)))))) = b,
inference(superposition,[status(thm),theory(equality)],[c_8,c_6]) ).
tff(c_380,plain,
b = a,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_2,c_53,c_377]) ).
tff(c_382,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_10,c_380]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : ROB009-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.15 % 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 : n002.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 20:51:01 EDT 2023
% 0.15/0.37 % CPUTime :
% 3.11/1.86 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.11/1.87
% 3.11/1.87 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.45/1.89
% 3.45/1.89 Inference rules
% 3.45/1.89 ----------------------
% 3.45/1.89 #Ref : 0
% 3.45/1.89 #Sup : 99
% 3.45/1.89 #Fact : 0
% 3.45/1.89 #Define : 0
% 3.45/1.89 #Split : 0
% 3.45/1.89 #Chain : 0
% 3.45/1.89 #Close : 0
% 3.45/1.89
% 3.45/1.89 Ordering : KBO
% 3.45/1.89
% 3.45/1.89 Simplification rules
% 3.45/1.89 ----------------------
% 3.45/1.89 #Subsume : 7
% 3.45/1.89 #Demod : 47
% 3.45/1.89 #Tautology : 28
% 3.45/1.89 #SimpNegUnit : 1
% 3.45/1.89 #BackRed : 0
% 3.45/1.89
% 3.45/1.89 #Partial instantiations: 0
% 3.45/1.89 #Strategies tried : 1
% 3.45/1.89
% 3.45/1.89 Timing (in seconds)
% 3.45/1.89 ----------------------
% 3.45/1.89 Preprocessing : 0.42
% 3.45/1.90 Parsing : 0.21
% 3.45/1.90 CNF conversion : 0.02
% 3.45/1.90 Main loop : 0.34
% 3.45/1.90 Inferencing : 0.11
% 3.45/1.90 Reduction : 0.14
% 3.45/1.90 Demodulation : 0.12
% 3.45/1.90 BG Simplification : 0.02
% 3.45/1.90 Subsumption : 0.05
% 3.45/1.90 Abstraction : 0.02
% 3.45/1.90 MUC search : 0.00
% 3.45/1.90 Cooper : 0.00
% 3.45/1.90 Total : 0.81
% 3.45/1.90 Index Insertion : 0.00
% 3.45/1.90 Index Deletion : 0.00
% 3.45/1.90 Index Matching : 0.00
% 3.45/1.90 BG Taut test : 0.00
%------------------------------------------------------------------------------