TSTP Solution File: GRP206-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP206-1 : TPTP v8.1.2. Released v2.3.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 : 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:40:28 EDT 2023
% Result : Unsatisfiable 3.07s 1.85s
% Output : CNFRefutation 3.07s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 13
% Syntax : Number of formulae : 22 ( 13 unt; 9 typ; 0 def)
% Number of atoms : 13 ( 12 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 8 ( 5 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 4 con; 0-2 aty)
% Number of variables : 17 (; 17 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ right_division > multiply > left_division > #nlpp > right_inverse > left_inverse > identity > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(right_inverse,type,
right_inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(left_division,type,
left_division: ( $i * $i ) > $i ).
tff(right_division,type,
right_division: ( $i * $i ) > $i ).
tff(b,type,
b: $i ).
tff(identity,type,
identity: $i ).
tff(left_inverse,type,
left_inverse: $i > $i ).
tff(c,type,
c: $i ).
tff(f_26,axiom,
! [X] : ( multiply(X,identity) = X ),
file(unknown,unknown) ).
tff(f_24,axiom,
! [X] : ( multiply(identity,X) = X ),
file(unknown,unknown) ).
tff(f_41,axiom,
! [X,Y,Z] : ( multiply(X,multiply(multiply(Y,Z),X)) = multiply(multiply(X,Y),multiply(Z,X)) ),
file(unknown,unknown) ).
tff(f_44,axiom,
multiply(multiply(a,multiply(b,c)),a) != multiply(multiply(a,b),multiply(c,a)),
file(unknown,unknown) ).
tff(c_4,plain,
! [X_2] : ( multiply(X_2,identity) = X_2 ),
inference(cnfTransformation,[status(thm)],[f_26]) ).
tff(c_2,plain,
! [X_1] : ( multiply(identity,X_1) = X_1 ),
inference(cnfTransformation,[status(thm)],[f_24]) ).
tff(c_305,plain,
! [X_33,Y_34,Z_35] : ( multiply(multiply(X_33,Y_34),multiply(Z_35,X_33)) = multiply(X_33,multiply(multiply(Y_34,Z_35),X_33)) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_359,plain,
! [X_1,Y_34] : ( multiply(X_1,multiply(multiply(Y_34,identity),X_1)) = multiply(multiply(X_1,Y_34),X_1) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_305]) ).
tff(c_373,plain,
! [X_1,Y_34] : ( multiply(multiply(X_1,Y_34),X_1) = multiply(X_1,multiply(Y_34,X_1)) ),
inference(demodulation,[status(thm),theory(equality)],[c_4,c_359]) ).
tff(c_18,plain,
! [X_13,Y_14,Z_15] : ( multiply(multiply(X_13,Y_14),multiply(Z_15,X_13)) = multiply(X_13,multiply(multiply(Y_14,Z_15),X_13)) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_20,plain,
multiply(multiply(a,multiply(b,c)),a) != multiply(multiply(a,b),multiply(c,a)),
inference(cnfTransformation,[status(thm)],[f_44]) ).
tff(c_21,plain,
multiply(multiply(a,multiply(b,c)),a) != multiply(a,multiply(multiply(b,c),a)),
inference(demodulation,[status(thm),theory(equality)],[c_18,c_20]) ).
tff(c_619,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_373,c_21]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : GRP206-1 : TPTP v8.1.2. Released v2.3.0.
% 0.00/0.13 % 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.16/0.34 % Computer : n026.cluster.edu
% 0.16/0.34 % Model : x86_64 x86_64
% 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.34 % Memory : 8042.1875MB
% 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.34 % CPULimit : 300
% 0.16/0.34 % WCLimit : 300
% 0.16/0.34 % DateTime : Thu Aug 3 22:21:16 EDT 2023
% 0.16/0.34 % CPUTime :
% 3.07/1.85 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 3.07/1.86
% 3.07/1.86 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 3.07/1.88
% 3.07/1.88 Inference rules
% 3.07/1.88 ----------------------
% 3.07/1.88 #Ref : 0
% 3.07/1.88 #Sup : 146
% 3.07/1.88 #Fact : 0
% 3.07/1.88 #Define : 0
% 3.07/1.88 #Split : 0
% 3.07/1.88 #Chain : 0
% 3.07/1.88 #Close : 0
% 3.07/1.88
% 3.07/1.88 Ordering : KBO
% 3.07/1.88
% 3.07/1.88 Simplification rules
% 3.07/1.88 ----------------------
% 3.07/1.88 #Subsume : 0
% 3.07/1.88 #Demod : 72
% 3.07/1.88 #Tautology : 117
% 3.07/1.88 #SimpNegUnit : 0
% 3.07/1.88 #BackRed : 1
% 3.07/1.88
% 3.07/1.88 #Partial instantiations: 0
% 3.07/1.88 #Strategies tried : 1
% 3.07/1.88
% 3.07/1.88 Timing (in seconds)
% 3.07/1.88 ----------------------
% 3.07/1.89 Preprocessing : 0.43
% 3.07/1.89 Parsing : 0.23
% 3.07/1.89 CNF conversion : 0.02
% 3.07/1.89 Main loop : 0.36
% 3.07/1.89 Inferencing : 0.16
% 3.07/1.89 Reduction : 0.11
% 3.07/1.89 Demodulation : 0.08
% 3.07/1.89 BG Simplification : 0.02
% 3.07/1.89 Subsumption : 0.05
% 3.07/1.89 Abstraction : 0.02
% 3.07/1.89 MUC search : 0.00
% 3.07/1.89 Cooper : 0.00
% 3.07/1.89 Total : 0.83
% 3.07/1.89 Index Insertion : 0.00
% 3.07/1.89 Index Deletion : 0.00
% 3.07/1.89 Index Matching : 0.00
% 3.07/1.89 BG Taut test : 0.00
%------------------------------------------------------------------------------