TSTP Solution File: RNG039-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG039-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 : n001.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 5.57s 2.36s
% Output : CNFRefutation 5.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 21
% Syntax : Number of formulae : 65 ( 48 unt; 10 typ; 0 def)
% Number of atoms : 65 ( 28 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 25 ( 15 ~; 10 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 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 : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 42 (; 42 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ sum > product > multiply > add > #nlpp > additive_inverse > d > c > b > additive_identity > a
%Foreground sorts:
%Background operators:
%Foreground operators:
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(d,type,
d: $i ).
tff(c,type,
c: $i ).
tff(f_190,axiom,
! [A] : ( add(A,A) = additive_identity ),
file(unknown,unknown) ).
tff(f_192,axiom,
! [A] : ( multiply(A,A) = A ),
file(unknown,unknown) ).
tff(f_204,axiom,
! [A,B] : product(a,multiply(b,A),multiply(B,A)),
file(unknown,unknown) ).
tff(f_235,axiom,
product(a,b,c),
file(unknown,unknown) ).
tff(f_178,axiom,
! [X,Y,U,V] :
( ~ product(X,Y,U)
| ~ product(X,Y,V)
| ( U = V ) ),
file(unknown,unknown) ).
tff(f_229,axiom,
product(add(a,b),b,add(c,b)),
file(unknown,unknown) ).
tff(f_50,axiom,
! [X,Y] : product(X,Y,multiply(X,Y)),
file(unknown,unknown) ).
tff(f_194,axiom,
multiply(b,a) = d,
file(unknown,unknown) ).
tff(f_238,axiom,
c != d,
file(unknown,unknown) ).
tff(f_188,axiom,
! [A] : ( add(A,additive_identity) = A ),
file(unknown,unknown) ).
tff(f_232,axiom,
product(add(a,b),a,add(a,d)),
file(unknown,unknown) ).
tff(c_44,plain,
! [A_78] : ( add(A_78,A_78) = additive_identity ),
inference(cnfTransformation,[status(thm)],[f_190]) ).
tff(c_46,plain,
! [A_79] : ( multiply(A_79,A_79) = A_79 ),
inference(cnfTransformation,[status(thm)],[f_192]) ).
tff(c_375,plain,
! [A_125,B_126] : product(a,multiply(b,A_125),multiply(B_126,A_125)),
inference(cnfTransformation,[status(thm)],[f_204]) ).
tff(c_395,plain,
! [B_127] : product(a,b,multiply(B_127,b)),
inference(superposition,[status(thm),theory(equality)],[c_46,c_375]) ).
tff(c_399,plain,
product(a,b,b),
inference(superposition,[status(thm),theory(equality)],[c_46,c_395]) ).
tff(c_116,plain,
product(a,b,c),
inference(cnfTransformation,[status(thm)],[f_235]) ).
tff(c_457,plain,
! [V_134,U_135,X_136,Y_137] :
( ( V_134 = U_135 )
| ~ product(X_136,Y_137,V_134)
| ~ product(X_136,Y_137,U_135) ),
inference(cnfTransformation,[status(thm)],[f_178]) ).
tff(c_1050,plain,
! [U_159] :
( ( c = U_159 )
| ~ product(a,b,U_159) ),
inference(resolution,[status(thm)],[c_116,c_457]) ).
tff(c_1067,plain,
c = b,
inference(resolution,[status(thm)],[c_399,c_1050]) ).
tff(c_106,plain,
product(add(a,b),b,add(c,b)),
inference(cnfTransformation,[status(thm)],[f_229]) ).
tff(c_1078,plain,
product(add(a,b),b,add(b,b)),
inference(demodulation,[status(thm),theory(equality)],[c_1067,c_106]) ).
tff(c_1094,plain,
product(add(a,b),b,additive_identity),
inference(demodulation,[status(thm),theory(equality)],[c_44,c_1078]) ).
tff(c_379,plain,
! [B_126] : product(a,b,multiply(B_126,b)),
inference(superposition,[status(thm),theory(equality)],[c_46,c_375]) ).
tff(c_1068,plain,
! [B_126] : ( multiply(B_126,b) = c ),
inference(resolution,[status(thm)],[c_379,c_1050]) ).
tff(c_1178,plain,
! [B_166] : ( multiply(B_166,b) = b ),
inference(demodulation,[status(thm),theory(equality)],[c_1067,c_1068]) ).
tff(c_6,plain,
! [X_3,Y_4] : product(X_3,Y_4,multiply(X_3,Y_4)),
inference(cnfTransformation,[status(thm)],[f_50]) ).
tff(c_1286,plain,
! [B_173] : product(B_173,b,b),
inference(superposition,[status(thm),theory(equality)],[c_1178,c_6]) ).
tff(c_34,plain,
! [V_71,U_70,X_68,Y_69] :
( ( V_71 = U_70 )
| ~ product(X_68,Y_69,V_71)
| ~ product(X_68,Y_69,U_70) ),
inference(cnfTransformation,[status(thm)],[f_178]) ).
tff(c_2506,plain,
! [U_231,B_232] :
( ( b = U_231 )
| ~ product(B_232,b,U_231) ),
inference(resolution,[status(thm)],[c_1286,c_34]) ).
tff(c_2525,plain,
b = additive_identity,
inference(resolution,[status(thm)],[c_1094,c_2506]) ).
tff(c_50,plain,
multiply(b,a) = d,
inference(cnfTransformation,[status(thm)],[f_194]) ).
tff(c_404,plain,
! [A_128] : product(a,multiply(b,A_128),A_128),
inference(superposition,[status(thm),theory(equality)],[c_46,c_375]) ).
tff(c_411,plain,
product(a,d,a),
inference(superposition,[status(thm),theory(equality)],[c_50,c_404]) ).
tff(c_391,plain,
product(a,multiply(b,a),d),
inference(superposition,[status(thm),theory(equality)],[c_50,c_375]) ).
tff(c_393,plain,
product(a,d,d),
inference(demodulation,[status(thm),theory(equality)],[c_50,c_391]) ).
tff(c_1445,plain,
! [U_193] :
( ( d = U_193 )
| ~ product(a,d,U_193) ),
inference(resolution,[status(thm)],[c_393,c_457]) ).
tff(c_1460,plain,
d = a,
inference(resolution,[status(thm)],[c_411,c_1445]) ).
tff(c_120,plain,
d != c,
inference(cnfTransformation,[status(thm)],[f_238]) ).
tff(c_1091,plain,
d != b,
inference(demodulation,[status(thm),theory(equality)],[c_1067,c_120]) ).
tff(c_1467,plain,
b != a,
inference(demodulation,[status(thm),theory(equality)],[c_1460,c_1091]) ).
tff(c_2539,plain,
additive_identity != a,
inference(demodulation,[status(thm),theory(equality)],[c_2525,c_1467]) ).
tff(c_42,plain,
! [A_77] : ( add(A_77,additive_identity) = A_77 ),
inference(cnfTransformation,[status(thm)],[f_188]) ).
tff(c_112,plain,
product(add(a,b),a,add(a,d)),
inference(cnfTransformation,[status(thm)],[f_232]) ).
tff(c_1477,plain,
product(add(a,b),a,add(a,a)),
inference(demodulation,[status(thm),theory(equality)],[c_1460,c_112]) ).
tff(c_1488,plain,
product(add(a,b),a,additive_identity),
inference(demodulation,[status(thm),theory(equality)],[c_44,c_1477]) ).
tff(c_2537,plain,
product(add(a,additive_identity),a,additive_identity),
inference(demodulation,[status(thm),theory(equality)],[c_2525,c_1488]) ).
tff(c_2546,plain,
product(a,a,additive_identity),
inference(demodulation,[status(thm),theory(equality)],[c_42,c_2537]) ).
tff(c_388,plain,
! [B_126] : product(a,d,multiply(B_126,a)),
inference(superposition,[status(thm),theory(equality)],[c_50,c_375]) ).
tff(c_1459,plain,
! [B_126] : ( multiply(B_126,a) = d ),
inference(resolution,[status(thm)],[c_388,c_1445]) ).
tff(c_1496,plain,
! [B_194] : ( multiply(B_194,a) = a ),
inference(demodulation,[status(thm),theory(equality)],[c_1460,c_1459]) ).
tff(c_1623,plain,
! [B_209] : product(B_209,a,a),
inference(superposition,[status(thm),theory(equality)],[c_1496,c_6]) ).
tff(c_1644,plain,
! [U_70,B_209] :
( ( a = U_70 )
| ~ product(B_209,a,U_70) ),
inference(resolution,[status(thm)],[c_1623,c_34]) ).
tff(c_2641,plain,
additive_identity = a,
inference(resolution,[status(thm)],[c_2546,c_1644]) ).
tff(c_2658,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_2539,c_2641]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : RNG039-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/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 : n001.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:30:25 EDT 2023
% 0.14/0.35 % CPUTime :
% 5.57/2.36 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 5.57/2.36
% 5.57/2.36 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 5.57/2.39
% 5.57/2.39 Inference rules
% 5.57/2.39 ----------------------
% 5.57/2.39 #Ref : 0
% 5.57/2.39 #Sup : 627
% 5.57/2.39 #Fact : 0
% 5.57/2.39 #Define : 0
% 5.57/2.39 #Split : 0
% 5.57/2.39 #Chain : 0
% 5.57/2.39 #Close : 0
% 5.57/2.39
% 5.57/2.39 Ordering : KBO
% 5.57/2.39
% 5.57/2.39 Simplification rules
% 5.57/2.39 ----------------------
% 5.57/2.39 #Subsume : 22
% 5.57/2.39 #Demod : 450
% 5.57/2.39 #Tautology : 388
% 5.57/2.39 #SimpNegUnit : 1
% 5.57/2.39 #BackRed : 62
% 5.57/2.39
% 5.57/2.39 #Partial instantiations: 0
% 5.57/2.39 #Strategies tried : 1
% 5.57/2.39
% 5.57/2.39 Timing (in seconds)
% 5.57/2.39 ----------------------
% 5.57/2.40 Preprocessing : 0.56
% 5.57/2.40 Parsing : 0.26
% 5.57/2.40 CNF conversion : 0.04
% 5.57/2.40 Main loop : 0.75
% 5.57/2.40 Inferencing : 0.23
% 5.57/2.40 Reduction : 0.28
% 5.57/2.40 Demodulation : 0.22
% 5.57/2.40 BG Simplification : 0.03
% 5.57/2.40 Subsumption : 0.15
% 5.57/2.40 Abstraction : 0.03
% 5.57/2.40 MUC search : 0.00
% 5.57/2.40 Cooper : 0.00
% 5.57/2.40 Total : 1.37
% 5.57/2.40 Index Insertion : 0.00
% 5.57/2.40 Index Deletion : 0.00
% 5.57/2.40 Index Matching : 0.00
% 5.57/2.40 BG Taut test : 0.00
%------------------------------------------------------------------------------