TSTP Solution File: RNG038-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG038-2 : 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/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 : n010.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:54:47 EDT 2023
% Result : Unsatisfiable 3.96s 2.10s
% Output : CNFRefutation 3.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 16
% Syntax : Number of formulae : 28 ( 9 unt; 10 typ; 0 def)
% Number of atoms : 31 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 28 ( 15 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 15 ( 7 >; 8 *; 0 +; 0 <<)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 31 (; 31 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sum > product > equalish > multiply > h > add > #nlpp > additive_inverse > b > additive_identity > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(h,type,
h: ( $i * $i ) > $i ).
tff(sum,type,
sum: ( $i * $i * $i ) > $o ).
tff(a,type,
a: $i ).
tff(product,type,
product: ( $i * $i * $i ) > $o ).
tff(additive_identity,type,
additive_identity: $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(additive_inverse,type,
additive_inverse: $i > $i ).
tff(b,type,
b: $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(f_104,axiom,
! [X] : sum(X,additive_identity,X),
file(unknown,unknown) ).
tff(f_227,axiom,
! [X,Y,U,V] :
( ~ sum(X,Y,U)
| ~ sum(X,Y,V)
| equalish(U,V) ),
file(unknown,unknown) ).
tff(f_244,axiom,
! [X,Y] :
( ~ equalish(X,additive_identity)
| product(X,h(X,Y),Y) ),
file(unknown,unknown) ).
tff(f_237,axiom,
! [X] : product(additive_identity,X,additive_identity),
file(unknown,unknown) ).
tff(f_235,axiom,
! [X,Y,U,V] :
( ~ product(X,Y,U)
| ~ product(X,Y,V)
| equalish(U,V) ),
file(unknown,unknown) ).
tff(f_249,axiom,
~ equalish(a,additive_identity),
file(unknown,unknown) ).
tff(c_20,plain,
! [X_33] : sum(X_33,additive_identity,X_33),
inference(cnfTransformation,[status(thm)],[f_104]) ).
tff(c_117,plain,
! [U_136,V_137,X_138,Y_139] :
( equalish(U_136,V_137)
| ~ sum(X_138,Y_139,V_137)
| ~ sum(X_138,Y_139,U_136) ),
inference(cnfTransformation,[status(thm)],[f_227]) ).
tff(c_140,plain,
! [U_142,X_143] :
( equalish(U_142,X_143)
| ~ sum(X_143,additive_identity,U_142) ),
inference(resolution,[status(thm)],[c_20,c_117]) ).
tff(c_164,plain,
! [X_33] : equalish(X_33,X_33),
inference(resolution,[status(thm)],[c_20,c_140]) ).
tff(c_54,plain,
! [X_104,Y_105] :
( product(X_104,h(X_104,Y_105),Y_105)
| ~ equalish(X_104,additive_identity) ),
inference(cnfTransformation,[status(thm)],[f_244]) ).
tff(c_50,plain,
! [X_102] : product(additive_identity,X_102,additive_identity),
inference(cnfTransformation,[status(thm)],[f_237]) ).
tff(c_484,plain,
! [U_191,V_192,X_193,Y_194] :
( equalish(U_191,V_192)
| ~ product(X_193,Y_194,V_192)
| ~ product(X_193,Y_194,U_191) ),
inference(cnfTransformation,[status(thm)],[f_235]) ).
tff(c_521,plain,
! [U_195,X_196] :
( equalish(U_195,additive_identity)
| ~ product(additive_identity,X_196,U_195) ),
inference(resolution,[status(thm)],[c_50,c_484]) ).
tff(c_544,plain,
! [Y_105] :
( equalish(Y_105,additive_identity)
| ~ equalish(additive_identity,additive_identity) ),
inference(resolution,[status(thm)],[c_54,c_521]) ).
tff(c_567,plain,
! [Y_105] : equalish(Y_105,additive_identity),
inference(demodulation,[status(thm),theory(equality)],[c_164,c_544]) ).
tff(c_58,plain,
~ equalish(a,additive_identity),
inference(cnfTransformation,[status(thm)],[f_249]) ).
tff(c_581,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_567,c_58]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : RNG038-2 : TPTP v8.1.2. Released v1.0.0.
% 0.13/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.14/0.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 17:53:13 EDT 2023
% 0.14/0.35 % CPUTime :
% 3.96/2.10 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.96/2.10
% 3.96/2.10 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.96/2.13
% 3.96/2.13 Inference rules
% 3.96/2.13 ----------------------
% 3.96/2.13 #Ref : 0
% 3.96/2.13 #Sup : 138
% 3.96/2.13 #Fact : 0
% 3.96/2.13 #Define : 0
% 3.96/2.13 #Split : 0
% 3.96/2.13 #Chain : 0
% 3.96/2.13 #Close : 0
% 3.96/2.13
% 3.96/2.13 Ordering : KBO
% 3.96/2.13
% 3.96/2.13 Simplification rules
% 3.96/2.13 ----------------------
% 3.96/2.13 #Subsume : 13
% 3.96/2.13 #Demod : 24
% 3.96/2.13 #Tautology : 20
% 3.96/2.13 #SimpNegUnit : 0
% 3.96/2.13 #BackRed : 3
% 3.96/2.13
% 3.96/2.13 #Partial instantiations: 0
% 3.96/2.13 #Strategies tried : 1
% 3.96/2.13
% 3.96/2.13 Timing (in seconds)
% 3.96/2.13 ----------------------
% 3.96/2.13 Preprocessing : 0.51
% 3.96/2.13 Parsing : 0.29
% 3.96/2.13 CNF conversion : 0.03
% 3.96/2.13 Main loop : 0.43
% 3.96/2.13 Inferencing : 0.16
% 3.96/2.13 Reduction : 0.11
% 3.96/2.13 Demodulation : 0.08
% 3.96/2.13 BG Simplification : 0.03
% 3.96/2.13 Subsumption : 0.10
% 3.96/2.13 Abstraction : 0.02
% 3.96/2.13 MUC search : 0.00
% 3.96/2.13 Cooper : 0.00
% 3.96/2.13 Total : 0.99
% 3.96/2.13 Index Insertion : 0.00
% 3.96/2.13 Index Deletion : 0.00
% 3.96/2.13 Index Matching : 0.00
% 3.96/2.13 BG Taut test : 0.00
%------------------------------------------------------------------------------