TSTP Solution File: RNG023-7 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : RNG023-7 : 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 : n017.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:44 EDT 2023
% Result : Unsatisfiable 4.32s 2.10s
% Output : CNFRefutation 4.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 12
% Syntax : Number of formulae : 19 ( 11 unt; 8 typ; 0 def)
% Number of atoms : 11 ( 10 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 10 ( 5 >; 5 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 16 (; 16 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ associator > multiply > commutator > add > #nlpp > additive_inverse > y > x > additive_identity
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(x,type,
x: $i ).
tff(additive_identity,type,
additive_identity: $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(associator,type,
associator: ( $i * $i * $i ) > $i ).
tff(commutator,type,
commutator: ( $i * $i ) > $i ).
tff(additive_inverse,type,
additive_inverse: $i > $i ).
tff(y,type,
y: $i ).
tff(add,type,
add: ( $i * $i ) > $i ).
tff(f_59,axiom,
! [X] : ( add(X,additive_inverse(X)) = additive_identity ),
file(unknown,unknown) ).
tff(f_79,axiom,
! [X,Y] : ( multiply(multiply(X,X),Y) = multiply(X,multiply(X,Y)) ),
file(unknown,unknown) ).
tff(f_82,axiom,
! [X,Y,Z] : ( associator(X,Y,Z) = add(multiply(multiply(X,Y),Z),additive_inverse(multiply(X,multiply(Y,Z)))) ),
file(unknown,unknown) ).
tff(f_104,axiom,
associator(x,x,y) != additive_identity,
file(unknown,unknown) ).
tff(c_12,plain,
! [X_6] : ( add(X_6,additive_inverse(X_6)) = additive_identity ),
inference(cnfTransformation,[status(thm)],[f_59]) ).
tff(c_26,plain,
! [X_21,Y_22] : ( multiply(multiply(X_21,X_21),Y_22) = multiply(X_21,multiply(X_21,Y_22)) ),
inference(cnfTransformation,[status(thm)],[f_79]) ).
tff(c_1581,plain,
! [X_99,Y_100,Z_101] : ( add(multiply(multiply(X_99,Y_100),Z_101),additive_inverse(multiply(X_99,multiply(Y_100,Z_101)))) = associator(X_99,Y_100,Z_101) ),
inference(cnfTransformation,[status(thm)],[f_82]) ).
tff(c_1626,plain,
! [X_21,Y_22] : ( add(multiply(X_21,multiply(X_21,Y_22)),additive_inverse(multiply(X_21,multiply(X_21,Y_22)))) = associator(X_21,X_21,Y_22) ),
inference(superposition,[status(thm),theory(equality)],[c_26,c_1581]) ).
tff(c_1685,plain,
! [X_21,Y_22] : ( associator(X_21,X_21,Y_22) = additive_identity ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_1626]) ).
tff(c_46,plain,
associator(x,x,y) != additive_identity,
inference(cnfTransformation,[status(thm)],[f_104]) ).
tff(c_1872,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1685,c_46]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : RNG023-7 : 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 : n017.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:33:21 EDT 2023
% 0.14/0.35 % CPUTime :
% 4.32/2.10 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.32/2.11
% 4.32/2.11 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.32/2.13
% 4.32/2.13 Inference rules
% 4.32/2.13 ----------------------
% 4.32/2.13 #Ref : 0
% 4.32/2.13 #Sup : 451
% 4.32/2.13 #Fact : 0
% 4.32/2.13 #Define : 0
% 4.32/2.13 #Split : 0
% 4.32/2.13 #Chain : 0
% 4.32/2.13 #Close : 0
% 4.32/2.13
% 4.32/2.13 Ordering : KBO
% 4.32/2.13
% 4.32/2.13 Simplification rules
% 4.32/2.13 ----------------------
% 4.32/2.13 #Subsume : 4
% 4.32/2.13 #Demod : 531
% 4.32/2.13 #Tautology : 292
% 4.32/2.13 #SimpNegUnit : 0
% 4.32/2.13 #BackRed : 1
% 4.32/2.13
% 4.32/2.13 #Partial instantiations: 0
% 4.32/2.13 #Strategies tried : 1
% 4.32/2.13
% 4.32/2.13 Timing (in seconds)
% 4.32/2.13 ----------------------
% 4.32/2.14 Preprocessing : 0.50
% 4.32/2.14 Parsing : 0.24
% 4.32/2.14 CNF conversion : 0.03
% 4.32/2.14 Main loop : 0.58
% 4.32/2.14 Inferencing : 0.20
% 4.32/2.14 Reduction : 0.23
% 4.32/2.14 Demodulation : 0.18
% 4.32/2.14 BG Simplification : 0.03
% 4.32/2.14 Subsumption : 0.09
% 4.32/2.14 Abstraction : 0.03
% 4.32/2.14 MUC search : 0.00
% 4.32/2.14 Cooper : 0.00
% 4.32/2.14 Total : 1.12
% 4.32/2.14 Index Insertion : 0.00
% 4.32/2.14 Index Deletion : 0.00
% 4.32/2.14 Index Matching : 0.00
% 4.32/2.14 BG Taut test : 0.00
%------------------------------------------------------------------------------