TSTP Solution File: BOO003-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : BOO003-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 11.61s 4.05s
% Output : CNFRefutation 11.86s
% 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_51,axiom,
! [X,Y] : product(X,Y,multiply(X,Y)),
file(unknown,unknown) ).
tff(f_61,axiom,
! [X,Y,Z] :
( ~ product(X,Y,Z)
| product(Y,X,Z) ),
file(unknown,unknown) ).
tff(f_189,axiom,
! [X] : product(X,inverse(X),additive_identity),
file(unknown,unknown) ).
tff(f_67,axiom,
! [X] : product(multiplicative_identity,X,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_185,axiom,
! [X] : sum(X,inverse(X),multiplicative_identity),
file(unknown,unknown) ).
tff(f_83,axiom,
! [V3,Z,V1,X,Y,V2,V4] :
( ~ product(X,Y,V1)
| ~ product(X,Z,V2)
| ~ sum(Y,Z,V3)
| ~ product(X,V3,V4)
| sum(V1,V2,V4) ),
file(unknown,unknown) ).
tff(f_65,axiom,
! [X] : sum(X,additive_identity,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_210,axiom,
~ product(x,x,x),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_3,Y_4] : product(X_3,Y_4,multiply(X_3,Y_4)),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_82,plain,
! [Y_100,X_101,Z_102] :
( product(Y_100,X_101,Z_102)
| ~ product(X_101,Y_100,Z_102) ),
inference(cnfTransformation,[status(thm)],[f_61]) ).
tff(c_93,plain,
! [Y_4,X_3] : product(Y_4,X_3,multiply(X_3,Y_4)),
inference(resolution,[status(thm)],[c_4,c_82]) ).
tff(c_40,plain,
! [X_74] : product(X_74,inverse(X_74),additive_identity),
inference(cnfTransformation,[status(thm)],[f_189]) ).
tff(c_14,plain,
! [X_13] : product(multiplicative_identity,X_13,X_13),
inference(cnfTransformation,[status(thm)],[f_67]) ).
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_126,plain,
! [X_109,U_110] :
( ( X_109 = U_110 )
| ~ product(multiplicative_identity,X_109,U_110) ),
inference(resolution,[status(thm)],[c_14,c_107]) ).
tff(c_146,plain,
! [X_3] : ( multiply(X_3,multiplicative_identity) = X_3 ),
inference(resolution,[status(thm)],[c_93,c_126]) ).
tff(c_36,plain,
! [X_72] : sum(X_72,inverse(X_72),multiplicative_identity),
inference(cnfTransformation,[status(thm)],[f_185]) ).
tff(c_1114,plain,
! [V1_203,X_201,V3_202,Y_204,Z_200,V2_199,V4_198] :
( sum(V1_203,V2_199,V4_198)
| ~ product(X_201,V3_202,V4_198)
| ~ sum(Y_204,Z_200,V3_202)
| ~ product(X_201,Z_200,V2_199)
| ~ product(X_201,Y_204,V1_203) ),
inference(cnfTransformation,[status(thm)],[f_83]) ).
tff(c_11059,plain,
! [V1_695,V2_697,X_698,Y_699,Y_696,Z_694] :
( sum(V1_695,V2_697,multiply(X_698,Y_699))
| ~ sum(Y_696,Z_694,Y_699)
| ~ product(X_698,Z_694,V2_697)
| ~ product(X_698,Y_696,V1_695) ),
inference(resolution,[status(thm)],[c_4,c_1114]) ).
tff(c_11091,plain,
! [V1_695,V2_697,X_698,X_72] :
( sum(V1_695,V2_697,multiply(X_698,multiplicative_identity))
| ~ product(X_698,inverse(X_72),V2_697)
| ~ product(X_698,X_72,V1_695) ),
inference(resolution,[status(thm)],[c_36,c_11059]) ).
tff(c_16225,plain,
! [V1_811,V2_812,X_813,X_814] :
( sum(V1_811,V2_812,X_813)
| ~ product(X_813,inverse(X_814),V2_812)
| ~ product(X_813,X_814,V1_811) ),
inference(demodulation,[status(thm),theory(equality)],[c_146,c_11091]) ).
tff(c_16301,plain,
! [V1_815,X_816] :
( sum(V1_815,additive_identity,X_816)
| ~ product(X_816,X_816,V1_815) ),
inference(resolution,[status(thm)],[c_40,c_16225]) ).
tff(c_16373,plain,
! [X_817] : sum(multiply(X_817,X_817),additive_identity,X_817),
inference(resolution,[status(thm)],[c_93,c_16301]) ).
tff(c_12,plain,
! [X_12] : sum(X_12,additive_identity,X_12),
inference(cnfTransformation,[status(thm)],[f_65]) ).
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_208,plain,
! [X_12,U_113] :
( ( X_12 = U_113 )
| ~ sum(X_12,additive_identity,U_113) ),
inference(resolution,[status(thm)],[c_12,c_190]) ).
tff(c_16542,plain,
! [X_818] : ( multiply(X_818,X_818) = X_818 ),
inference(resolution,[status(thm)],[c_16373,c_208]) ).
tff(c_16599,plain,
! [X_818] : product(X_818,X_818,X_818),
inference(superposition,[status(thm),theory(equality)],[c_16542,c_4]) ).
tff(c_46,plain,
~ product(x,x,x),
inference(cnfTransformation,[status(thm)],[f_210]) ).
tff(c_16675,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_16599,c_46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : BOO003-1 : TPTP v8.1.2. Released v1.0.0.
% 0.00/0.09 % 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.08/0.29 % Computer : n026.cluster.edu
% 0.08/0.29 % Model : x86_64 x86_64
% 0.08/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.29 % Memory : 8042.1875MB
% 0.08/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.29 % CPULimit : 300
% 0.08/0.29 % WCLimit : 300
% 0.08/0.29 % DateTime : Thu Aug 3 18:52:47 EDT 2023
% 0.08/0.29 % CPUTime :
% 11.61/4.05 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.61/4.05
% 11.61/4.05 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 11.86/4.08
% 11.86/4.08 Inference rules
% 11.86/4.08 ----------------------
% 11.86/4.08 #Ref : 0
% 11.86/4.08 #Sup : 3960
% 11.86/4.08 #Fact : 0
% 11.86/4.08 #Define : 0
% 11.86/4.08 #Split : 6
% 11.86/4.08 #Chain : 0
% 11.86/4.08 #Close : 0
% 11.86/4.08
% 11.86/4.08 Ordering : KBO
% 11.86/4.08
% 11.86/4.08 Simplification rules
% 11.86/4.08 ----------------------
% 11.86/4.08 #Subsume : 1254
% 11.86/4.08 #Demod : 1772
% 11.86/4.08 #Tautology : 851
% 11.86/4.08 #SimpNegUnit : 36
% 11.86/4.08 #BackRed : 2
% 11.86/4.08
% 11.86/4.08 #Partial instantiations: 0
% 11.86/4.08 #Strategies tried : 1
% 11.86/4.08
% 11.86/4.08 Timing (in seconds)
% 11.86/4.08 ----------------------
% 11.86/4.08 Preprocessing : 0.48
% 11.86/4.08 Parsing : 0.28
% 11.86/4.08 CNF conversion : 0.03
% 11.86/4.08 Main loop : 2.53
% 11.86/4.08 Inferencing : 0.62
% 11.86/4.08 Reduction : 0.71
% 11.86/4.08 Demodulation : 0.51
% 11.86/4.08 BG Simplification : 0.06
% 11.86/4.08 Subsumption : 0.97
% 11.86/4.08 Abstraction : 0.06
% 11.86/4.08 MUC search : 0.00
% 11.86/4.08 Cooper : 0.00
% 11.86/4.09 Total : 3.06
% 11.86/4.09 Index Insertion : 0.00
% 11.86/4.09 Index Deletion : 0.00
% 11.86/4.09 Index Matching : 0.00
% 11.86/4.09 BG Taut test : 0.00
%------------------------------------------------------------------------------