TSTP Solution File: GRP041-2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP041-2 : 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/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 : n024.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:39:43 EDT 2023
% Result : Unsatisfiable 2.64s 1.64s
% Output : CNFRefutation 2.64s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 15 ( 6 unt; 6 typ; 0 def)
% Number of atoms : 14 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 8 ( 4 >; 4 *; 0 +; 0 <<)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 13 (; 13 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ product > equalish > multiply > #nlpp > inverse > identity > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(product,type,
product: ( $i * $i * $i ) > $o ).
tff(inverse,type,
inverse: $i > $i ).
tff(multiply,type,
multiply: ( $i * $i ) > $i ).
tff(identity,type,
identity: $i ).
tff(equalish,type,
equalish: ( $i * $i ) > $o ).
tff(f_51,axiom,
! [X] : product(identity,X,X),
file(unknown,unknown) ).
tff(f_65,axiom,
! [X,Y,Z,W] :
( ~ product(X,Y,Z)
| ~ product(X,Y,W)
| equalish(Z,W) ),
file(unknown,unknown) ).
tff(f_99,axiom,
~ equalish(a,a),
file(unknown,unknown) ).
tff(c_2,plain,
! [X_1] : product(identity,X_1,X_1),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_20,plain,
! [Z_29,W_30,X_31,Y_32] :
( equalish(Z_29,W_30)
| ~ product(X_31,Y_32,W_30)
| ~ product(X_31,Y_32,Z_29) ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_40,plain,
! [Z_37,X_38] :
( equalish(Z_37,X_38)
| ~ product(identity,X_38,Z_37) ),
inference(resolution,[status(thm)],[c_2,c_20]) ).
tff(c_49,plain,
! [X_1] : equalish(X_1,X_1),
inference(resolution,[status(thm)],[c_2,c_40]) ).
tff(c_16,plain,
~ equalish(a,a),
inference(cnfTransformation,[status(thm)],[f_99]) ).
tff(c_52,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_49,c_16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP041-2 : TPTP v8.1.2. Released v1.0.0.
% 0.08/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.14/0.36 % Computer : n024.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 22:24:15 EDT 2023
% 0.14/0.36 % CPUTime :
% 2.64/1.64 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.64/1.64
% 2.64/1.64 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.64/1.67
% 2.64/1.67 Inference rules
% 2.64/1.67 ----------------------
% 2.64/1.67 #Ref : 0
% 2.64/1.67 #Sup : 8
% 2.64/1.67 #Fact : 0
% 2.64/1.67 #Define : 0
% 2.64/1.67 #Split : 0
% 2.64/1.67 #Chain : 0
% 2.64/1.67 #Close : 0
% 2.64/1.67
% 2.64/1.67 Ordering : KBO
% 2.64/1.67
% 2.64/1.67 Simplification rules
% 2.64/1.67 ----------------------
% 2.64/1.67 #Subsume : 0
% 2.64/1.67 #Demod : 1
% 2.64/1.67 #Tautology : 0
% 2.64/1.67 #SimpNegUnit : 0
% 2.64/1.67 #BackRed : 1
% 2.64/1.67
% 2.64/1.67 #Partial instantiations: 0
% 2.64/1.67 #Strategies tried : 1
% 2.64/1.67
% 2.64/1.67 Timing (in seconds)
% 2.64/1.67 ----------------------
% 2.64/1.67 Preprocessing : 0.42
% 2.64/1.67 Parsing : 0.23
% 2.64/1.67 CNF conversion : 0.02
% 2.64/1.67 Main loop : 0.17
% 2.64/1.67 Inferencing : 0.07
% 2.64/1.67 Reduction : 0.04
% 2.64/1.67 Demodulation : 0.03
% 2.64/1.67 BG Simplification : 0.01
% 2.64/1.67 Subsumption : 0.04
% 2.64/1.67 Abstraction : 0.01
% 2.64/1.67 MUC search : 0.00
% 2.64/1.67 Cooper : 0.00
% 2.64/1.67 Total : 0.62
% 2.64/1.67 Index Insertion : 0.00
% 2.64/1.67 Index Deletion : 0.00
% 2.64/1.67 Index Matching : 0.00
% 2.64/1.67 BG Taut test : 0.00
%------------------------------------------------------------------------------