TSTP Solution File: GRP518-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP518-1 : TPTP v8.1.2. Released v2.6.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 : n019.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:41:25 EDT 2023
% Result : Unsatisfiable 2.90s 1.83s
% Output : CNFRefutation 2.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 15 ( 11 unt; 4 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 : 5 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 3 ( 2 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 22 (; 22 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ multiply > #nlpp > inverse > b2 > a2
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(b2,type,
b2: $i ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(a2,type,
a2: $i ).
tff(f_23,axiom,
! [A,B,C] : ( multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)) = C ),
file(unknown,unknown) ).
tff(f_25,axiom,
multiply(multiply(inverse(b2),b2),a2) != a2,
file(unknown,unknown) ).
tff(c_2,plain,
! [A_1,B_2,C_3] : ( multiply(A_1,multiply(multiply(inverse(multiply(A_1,B_2)),C_3),B_2)) = C_3 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_5,plain,
! [A_4,B_5,C_6] : ( multiply(A_4,multiply(multiply(inverse(multiply(A_4,B_5)),C_6),B_5)) = C_6 ),
inference(cnfTransformation,[status(thm)],[f_23]) ).
tff(c_28,plain,
! [A_7,C_8,C_9,B_10] : ( multiply(A_7,multiply(multiply(inverse(C_8),C_9),multiply(multiply(inverse(multiply(A_7,B_10)),C_8),B_10))) = C_9 ),
inference(superposition,[status(thm),theory(equality)],[c_5,c_2]) ).
tff(c_78,plain,
! [C_3,C_9] : ( multiply(multiply(inverse(C_3),C_9),C_3) = C_9 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_28]) ).
tff(c_81,plain,
! [C_11,C_12] : ( multiply(multiply(inverse(C_11),C_12),C_11) = C_12 ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_28]) ).
tff(c_104,plain,
! [C_13,C_14,C_15] : ( multiply(multiply(inverse(C_13),C_14),multiply(multiply(inverse(C_14),C_15),C_13)) = C_15 ),
inference(superposition,[status(thm),theory(equality)],[c_81,c_2]) ).
tff(c_129,plain,
! [C_3,C_9] : ( multiply(multiply(inverse(C_3),C_3),C_9) = C_9 ),
inference(superposition,[status(thm),theory(equality)],[c_78,c_104]) ).
tff(c_4,plain,
multiply(multiply(inverse(b2),b2),a2) != a2,
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_223,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_129,c_4]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP518-1 : TPTP v8.1.2. Released v2.6.0.
% 0.00/0.14 % 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.13/0.35 % Computer : n019.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 22:27:16 EDT 2023
% 0.13/0.35 % CPUTime :
% 2.90/1.83 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.90/1.83
% 2.90/1.83 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.90/1.86
% 2.90/1.86 Inference rules
% 2.90/1.86 ----------------------
% 2.90/1.86 #Ref : 0
% 2.90/1.86 #Sup : 57
% 2.90/1.86 #Fact : 0
% 2.90/1.86 #Define : 0
% 2.90/1.86 #Split : 0
% 2.90/1.86 #Chain : 0
% 2.90/1.86 #Close : 0
% 2.90/1.86
% 2.90/1.86 Ordering : KBO
% 2.90/1.86
% 2.90/1.86 Simplification rules
% 2.90/1.86 ----------------------
% 2.90/1.86 #Subsume : 0
% 2.90/1.86 #Demod : 8
% 2.90/1.86 #Tautology : 12
% 2.90/1.86 #SimpNegUnit : 0
% 2.90/1.86 #BackRed : 1
% 2.90/1.86
% 2.90/1.86 #Partial instantiations: 0
% 2.90/1.86 #Strategies tried : 1
% 2.90/1.86
% 2.90/1.86 Timing (in seconds)
% 2.90/1.86 ----------------------
% 3.02/1.87 Preprocessing : 0.39
% 3.02/1.87 Parsing : 0.21
% 3.02/1.87 CNF conversion : 0.02
% 3.02/1.87 Main loop : 0.29
% 3.02/1.87 Inferencing : 0.13
% 3.02/1.87 Reduction : 0.08
% 3.02/1.87 Demodulation : 0.06
% 3.02/1.87 BG Simplification : 0.02
% 3.02/1.87 Subsumption : 0.05
% 3.02/1.87 Abstraction : 0.02
% 3.02/1.87 MUC search : 0.00
% 3.02/1.87 Cooper : 0.00
% 3.02/1.87 Total : 0.73
% 3.02/1.87 Index Insertion : 0.00
% 3.02/1.87 Index Deletion : 0.00
% 3.02/1.87 Index Matching : 0.00
% 3.02/1.87 BG Taut test : 0.00
%------------------------------------------------------------------------------