TSTP Solution File: ROB011-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ROB011-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 : n023.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 4.54s 2.12s
% Output : CNFRefutation 4.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 15
% Syntax : Number of formulae : 31 ( 22 unt; 9 typ; 0 def)
% Number of atoms : 22 ( 21 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 5 >; 2 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 21 (; 21 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ positive_integer > multiply > add > #nlpp > successor > negate > one > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(positive_integer,type,
positive_integer: $i > $o ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(one,type,
one: $i ).
tff(negate,type,
negate: $i > $i ).
tff(successor,type,
successor: $i > $i ).
tff(c,type,
c: $i ).
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_74,axiom,
! [X] : ( multiply(one,X) = X ),
file(unknown,unknown) ).
tff(f_90,axiom,
negate(add(a,negate(add(b,multiply(one,add(a,c)))))) != c,
file(unknown,unknown) ).
tff(f_88,axiom,
negate(add(a,negate(b))) = c,
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(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_67,plain,
! [X_16,Y_17,Z_18] : ( add(add(X_16,Y_17),Z_18) = add(X_16,add(Y_17,Z_18)) ),
inference(cnfTransformation,[status(thm)],[f_47]) ).
tff(c_99,plain,
! [X_16,Y_17,X_1] : ( add(X_16,add(Y_17,X_1)) = add(X_1,add(X_16,Y_17)) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_67]) ).
tff(c_8,plain,
! [X_8] : ( multiply(one,X_8) = X_8 ),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_18,plain,
negate(add(a,negate(add(b,multiply(one,add(a,c)))))) != c,
inference(cnfTransformation,[status(thm)],[f_90]) ).
tff(c_19,plain,
negate(add(a,negate(add(b,add(a,c))))) != c,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_18]) ).
tff(c_104,plain,
negate(add(a,negate(add(a,add(c,b))))) != c,
inference(demodulation,[status(thm),theory(equality)],[c_99,c_19]) ).
tff(c_105,plain,
negate(add(a,negate(add(a,add(b,c))))) != c,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_104]) ).
tff(c_16,plain,
negate(add(a,negate(b))) = c,
inference(cnfTransformation,[status(thm)],[f_88]) ).
tff(c_454,plain,
! [X_28,Y_29] : ( negate(add(negate(add(X_28,Y_29)),negate(add(X_28,negate(Y_29))))) = X_28 ),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_517,plain,
negate(add(negate(add(a,b)),c)) = a,
inference(superposition,[status(thm),theory(equality)],[c_16,c_454]) ).
tff(c_544,plain,
negate(add(c,negate(add(a,b)))) = a,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_517]) ).
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_554,plain,
negate(add(negate(add(c,add(a,b))),a)) = c,
inference(superposition,[status(thm),theory(equality)],[c_544,c_6]) ).
tff(c_558,plain,
negate(add(a,negate(add(a,add(b,c))))) = c,
inference(demodulation,[status(thm),theory(equality)],[c_2,c_99,c_2,c_99,c_2,c_554]) ).
tff(c_1513,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_105,c_558]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : ROB011-1 : TPTP v8.1.2. Released v1.0.0.
% 0.12/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.14/0.36 % Computer : n023.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 20:51:22 EDT 2023
% 0.14/0.36 % CPUTime :
% 4.54/2.12 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.54/2.12
% 4.54/2.12 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.54/2.15
% 4.54/2.15 Inference rules
% 4.54/2.15 ----------------------
% 4.54/2.15 #Ref : 0
% 4.54/2.15 #Sup : 399
% 4.54/2.15 #Fact : 0
% 4.54/2.15 #Define : 0
% 4.54/2.15 #Split : 0
% 4.54/2.15 #Chain : 0
% 4.54/2.15 #Close : 0
% 4.54/2.15
% 4.54/2.15 Ordering : KBO
% 4.54/2.15
% 4.54/2.15 Simplification rules
% 4.54/2.15 ----------------------
% 4.54/2.15 #Subsume : 40
% 4.54/2.15 #Demod : 202
% 4.54/2.15 #Tautology : 77
% 4.54/2.15 #SimpNegUnit : 1
% 4.54/2.15 #BackRed : 1
% 4.54/2.15
% 4.54/2.15 #Partial instantiations: 0
% 4.54/2.15 #Strategies tried : 1
% 4.54/2.15
% 4.54/2.15 Timing (in seconds)
% 4.54/2.15 ----------------------
% 4.54/2.15 Preprocessing : 0.44
% 4.54/2.15 Parsing : 0.23
% 4.54/2.15 CNF conversion : 0.02
% 4.54/2.15 Main loop : 0.66
% 4.54/2.15 Inferencing : 0.20
% 4.54/2.15 Reduction : 0.29
% 4.54/2.15 Demodulation : 0.26
% 4.54/2.15 BG Simplification : 0.03
% 4.54/2.15 Subsumption : 0.10
% 4.54/2.15 Abstraction : 0.03
% 4.54/2.15 MUC search : 0.00
% 4.54/2.15 Cooper : 0.00
% 4.54/2.15 Total : 1.15
% 4.54/2.15 Index Insertion : 0.00
% 4.54/2.15 Index Deletion : 0.00
% 4.54/2.15 Index Matching : 0.00
% 4.54/2.15 BG Taut test : 0.00
%------------------------------------------------------------------------------