TSTP Solution File: GRP020-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP020-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 : n005.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:38 EDT 2023
% Result : Unsatisfiable 2.88s 1.73s
% Output : CNFRefutation 2.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 9
% Syntax : Number of formulae : 16 ( 8 unt; 5 typ; 0 def)
% Number of atoms : 16 ( 6 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 12 ( 7 ~; 5 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 6 ( 3 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 17 (; 17 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ product > 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(f_60,axiom,
! [X,Y] : product(X,Y,multiply(X,Y)),
file(unknown,unknown) ).
tff(f_55,axiom,
! [X] : product(inverse(X),X,identity),
file(unknown,unknown) ).
tff(f_69,axiom,
! [X,Y,Z,W] :
( ~ product(X,Y,Z)
| ~ product(X,Y,W)
| ( Z = W ) ),
file(unknown,unknown) ).
tff(f_95,axiom,
multiply(inverse(a),a) != identity,
file(unknown,unknown) ).
tff(c_10,plain,
! [X_5,Y_6] : product(X_5,Y_6,multiply(X_5,Y_6)),
inference(cnfTransformation,[status(thm)],[f_60]) ).
tff(c_6,plain,
! [X_3] : product(inverse(X_3),X_3,identity),
inference(cnfTransformation,[status(thm)],[f_55]) ).
tff(c_24,plain,
! [Z_29,W_30,X_31,Y_32] :
( ( Z_29 = W_30 )
| ~ product(X_31,Y_32,W_30)
| ~ product(X_31,Y_32,Z_29) ),
inference(cnfTransformation,[status(thm)],[f_69]) ).
tff(c_210,plain,
! [Z_54,X_55] :
( ( identity = Z_54 )
| ~ product(inverse(X_55),X_55,Z_54) ),
inference(resolution,[status(thm)],[c_6,c_24]) ).
tff(c_225,plain,
! [Y_6] : ( multiply(inverse(Y_6),Y_6) = identity ),
inference(resolution,[status(thm)],[c_10,c_210]) ).
tff(c_18,plain,
multiply(inverse(a),a) != identity,
inference(cnfTransformation,[status(thm)],[f_95]) ).
tff(c_232,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_225,c_18]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GRP020-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.16/0.36 % Computer : n005.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu Aug 3 22:08:57 EDT 2023
% 0.22/0.37 % CPUTime :
% 2.88/1.73 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.88/1.73
% 2.88/1.73 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.88/1.76
% 2.88/1.76 Inference rules
% 2.88/1.76 ----------------------
% 2.88/1.76 #Ref : 0
% 2.88/1.76 #Sup : 49
% 2.88/1.76 #Fact : 0
% 2.88/1.76 #Define : 0
% 2.88/1.76 #Split : 0
% 2.88/1.76 #Chain : 0
% 2.88/1.76 #Close : 0
% 2.88/1.76
% 2.88/1.76 Ordering : KBO
% 2.88/1.76
% 2.88/1.76 Simplification rules
% 2.88/1.76 ----------------------
% 2.88/1.76 #Subsume : 2
% 2.88/1.76 #Demod : 12
% 2.88/1.76 #Tautology : 27
% 2.88/1.76 #SimpNegUnit : 0
% 2.88/1.76 #BackRed : 1
% 2.88/1.76
% 2.88/1.76 #Partial instantiations: 0
% 2.88/1.76 #Strategies tried : 1
% 2.88/1.76
% 2.88/1.76 Timing (in seconds)
% 2.88/1.76 ----------------------
% 2.88/1.76 Preprocessing : 0.42
% 2.88/1.76 Parsing : 0.23
% 2.88/1.76 CNF conversion : 0.02
% 2.88/1.76 Main loop : 0.26
% 2.88/1.76 Inferencing : 0.10
% 2.88/1.77 Reduction : 0.07
% 2.88/1.77 Demodulation : 0.05
% 2.88/1.77 BG Simplification : 0.01
% 2.88/1.77 Subsumption : 0.06
% 2.88/1.77 Abstraction : 0.01
% 2.88/1.77 MUC search : 0.00
% 2.88/1.77 Cooper : 0.00
% 2.88/1.77 Total : 0.73
% 2.88/1.77 Index Insertion : 0.00
% 2.88/1.77 Index Deletion : 0.00
% 2.88/1.77 Index Matching : 0.00
% 2.88/1.77 BG Taut test : 0.00
%------------------------------------------------------------------------------