TSTP Solution File: BOO004-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : BOO004-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/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 : n026.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:34:21 EDT 2023
% Result : Unsatisfiable 17.11s 6.88s
% Output : CNFRefutation 17.11s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 18
% Syntax : Number of formulae : 40 ( 18 unt; 8 typ; 0 def)
% Number of atoms : 60 ( 8 equ)
% Maximal formula atoms : 5 ( 1 avg)
% Number of connectives : 58 ( 30 ~; 28 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 11 ( 5 >; 6 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 74 (; 74 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sum > product > multiply > add > #nlpp > inverse > x > multiplicative_identity > additive_identity
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(sum,type,
sum: ( $i * $i * $i ) > $o ).
tff(product,type,
product: ( $i * $i * $i ) > $o ).
tff(x,type,
x: $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(additive_identity,type,
additive_identity: $i ).
tff(multiplicative_identity,type,
multiplicative_identity: $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(f_49,axiom,
! [X,Y] : sum(X,Y,add(X,Y)),
file(unknown,unknown) ).
tff(f_56,axiom,
! [X,Y,Z] :
( ~ sum(X,Y,Z)
| sum(Y,X,Z) ),
file(unknown,unknown) ).
tff(f_183,axiom,
! [X] : sum(inverse(X),X,multiplicative_identity),
file(unknown,unknown) ).
tff(f_63,axiom,
! [X] : sum(additive_identity,X,X),
file(unknown,unknown) ).
tff(f_198,axiom,
! [X,Y,U,V] :
( ~ sum(X,Y,U)
| ~ sum(X,Y,V)
| ( U = V ) ),
file(unknown,unknown) ).
tff(f_189,axiom,
! [X] : product(X,inverse(X),additive_identity),
file(unknown,unknown) ).
tff(f_167,axiom,
! [V3,Z,V1,X,Y,V2,V4] :
( ~ sum(Y,X,V1)
| ~ sum(Z,X,V2)
| ~ product(Y,Z,V3)
| ~ sum(V3,X,V4)
| product(V1,V2,V4) ),
file(unknown,unknown) ).
tff(f_69,axiom,
! [X] : product(X,multiplicative_identity,X),
file(unknown,unknown) ).
tff(f_206,axiom,
! [X,Y,U,V] :
( ~ product(X,Y,U)
| ~ product(X,Y,V)
| ( U = V ) ),
file(unknown,unknown) ).
tff(f_210,axiom,
~ sum(x,x,x),
file(unknown,unknown) ).
tff(c_2,plain,
! [X_1,Y_2] : sum(X_1,Y_2,add(X_1,Y_2)),
inference(cnfTransformation,[status(thm)],[f_49]) ).
tff(c_57,plain,
! [Y_95,X_96,Z_97] :
( sum(Y_95,X_96,Z_97)
| ~ sum(X_96,Y_95,Z_97) ),
inference(cnfTransformation,[status(thm)],[f_56]) ).
tff(c_68,plain,
! [Y_2,X_1] : sum(Y_2,X_1,add(X_1,Y_2)),
inference(resolution,[status(thm)],[c_2,c_57]) ).
tff(c_34,plain,
! [X_71] : sum(inverse(X_71),X_71,multiplicative_identity),
inference(cnfTransformation,[status(thm)],[f_183]) ).
tff(c_10,plain,
! [X_11] : sum(additive_identity,X_11,X_11),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_190,plain,
! [V_112,U_113,X_114,Y_115] :
( ( V_112 = U_113 )
| ~ sum(X_114,Y_115,V_112)
| ~ sum(X_114,Y_115,U_113) ),
inference(cnfTransformation,[status(thm)],[f_198]) ).
tff(c_236,plain,
! [X_117,U_118] :
( ( X_117 = U_118 )
| ~ sum(additive_identity,X_117,U_118) ),
inference(resolution,[status(thm)],[c_10,c_190]) ).
tff(c_257,plain,
! [Y_2] : ( add(additive_identity,Y_2) = Y_2 ),
inference(resolution,[status(thm)],[c_2,c_236]) ).
tff(c_40,plain,
! [X_74] : product(X_74,inverse(X_74),additive_identity),
inference(cnfTransformation,[status(thm)],[f_189]) ).
tff(c_1037,plain,
! [Y_185,V4_186,Z_184,V1_181,V3_182,V2_187,X_183] :
( product(V1_181,V2_187,V4_186)
| ~ sum(V3_182,X_183,V4_186)
| ~ product(Y_185,Z_184,V3_182)
| ~ sum(Z_184,X_183,V2_187)
| ~ sum(Y_185,X_183,V1_181) ),
inference(cnfTransformation,[status(thm)],[f_167]) ).
tff(c_10706,plain,
! [Y_636,V1_633,X_635,Y_638,Z_634,V2_637] :
( product(V1_633,V2_637,add(X_635,Y_638))
| ~ product(Y_636,Z_634,X_635)
| ~ sum(Z_634,Y_638,V2_637)
| ~ sum(Y_636,Y_638,V1_633) ),
inference(resolution,[status(thm)],[c_2,c_1037]) ).
tff(c_10730,plain,
! [V1_633,V2_637,Y_638,X_74] :
( product(V1_633,V2_637,add(additive_identity,Y_638))
| ~ sum(inverse(X_74),Y_638,V2_637)
| ~ sum(X_74,Y_638,V1_633) ),
inference(resolution,[status(thm)],[c_40,c_10706]) ).
tff(c_38772,plain,
! [V1_1082,V2_1083,Y_1084,X_1085] :
( product(V1_1082,V2_1083,Y_1084)
| ~ sum(inverse(X_1085),Y_1084,V2_1083)
| ~ sum(X_1085,Y_1084,V1_1082) ),
inference(demodulation,[status(thm),theory(equality)],[c_257,c_10730]) ).
tff(c_38910,plain,
! [V1_1086,X_1087] :
( product(V1_1086,multiplicative_identity,X_1087)
| ~ sum(X_1087,X_1087,V1_1086) ),
inference(resolution,[status(thm)],[c_34,c_38772]) ).
tff(c_39085,plain,
! [X_1088] : product(add(X_1088,X_1088),multiplicative_identity,X_1088),
inference(resolution,[status(thm)],[c_68,c_38910]) ).
tff(c_16,plain,
! [X_14] : product(X_14,multiplicative_identity,X_14),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_107,plain,
! [V_105,U_106,X_107,Y_108] :
( ( V_105 = U_106 )
| ~ product(X_107,Y_108,V_105)
| ~ product(X_107,Y_108,U_106) ),
inference(cnfTransformation,[status(thm)],[f_206]) ).
tff(c_125,plain,
! [X_14,U_106] :
( ( X_14 = U_106 )
| ~ product(X_14,multiplicative_identity,U_106) ),
inference(resolution,[status(thm)],[c_16,c_107]) ).
tff(c_39360,plain,
! [X_1089] : ( add(X_1089,X_1089) = X_1089 ),
inference(resolution,[status(thm)],[c_39085,c_125]) ).
tff(c_39409,plain,
! [X_1089] : sum(X_1089,X_1089,X_1089),
inference(superposition,[status(thm),theory(equality)],[c_39360,c_2]) ).
tff(c_46,plain,
~ sum(x,x,x),
inference(cnfTransformation,[status(thm)],[f_210]) ).
tff(c_39469,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_39409,c_46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : BOO004-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/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 : n026.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 18:49:17 EDT 2023
% 0.14/0.35 % CPUTime :
% 17.11/6.88 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 17.11/6.89
% 17.11/6.89 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 17.11/6.91
% 17.11/6.91 Inference rules
% 17.11/6.91 ----------------------
% 17.11/6.91 #Ref : 0
% 17.11/6.91 #Sup : 9356
% 17.11/6.91 #Fact : 0
% 17.11/6.91 #Define : 0
% 17.11/6.91 #Split : 7
% 17.11/6.91 #Chain : 0
% 17.11/6.91 #Close : 0
% 17.11/6.91
% 17.11/6.91 Ordering : KBO
% 17.11/6.91
% 17.11/6.91 Simplification rules
% 17.11/6.91 ----------------------
% 17.11/6.91 #Subsume : 2986
% 17.11/6.91 #Demod : 4239
% 17.11/6.91 #Tautology : 2105
% 17.11/6.91 #SimpNegUnit : 237
% 17.11/6.91 #BackRed : 32
% 17.11/6.91
% 17.11/6.91 #Partial instantiations: 0
% 17.11/6.91 #Strategies tried : 1
% 17.11/6.91
% 17.11/6.91 Timing (in seconds)
% 17.11/6.91 ----------------------
% 17.11/6.92 Preprocessing : 0.50
% 17.11/6.92 Parsing : 0.28
% 17.11/6.92 CNF conversion : 0.03
% 17.11/6.92 Main loop : 5.34
% 17.11/6.92 Inferencing : 0.94
% 17.11/6.92 Reduction : 1.42
% 17.11/6.92 Demodulation : 1.03
% 17.11/6.92 BG Simplification : 0.08
% 17.11/6.92 Subsumption : 2.54
% 17.11/6.92 Abstraction : 0.11
% 17.11/6.92 MUC search : 0.00
% 17.11/6.92 Cooper : 0.00
% 17.11/6.92 Total : 5.90
% 17.11/6.92 Index Insertion : 0.00
% 17.11/6.92 Index Deletion : 0.00
% 17.11/6.92 Index Matching : 0.00
% 17.11/6.92 BG Taut test : 0.00
%------------------------------------------------------------------------------