TSTP Solution File: GRP001-5 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP001-5 : 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 : n013.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:34 EDT 2023
% Result : Unsatisfiable 4.05s 2.02s
% Output : CNFRefutation 4.05s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of formulae : 28 ( 14 unt; 5 typ; 0 def)
% Number of atoms : 42 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 40 ( 21 ~; 19 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 3 ( 1 >; 2 *; 0 +; 0 <<)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 45 (; 45 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ product > #nlpp > identity > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(product,type,
product: ( $i * $i * $i ) > $o ).
tff(b,type,
b: $i ).
tff(identity,type,
identity: $i ).
tff(c,type,
c: $i ).
tff(f_67,axiom,
~ product(b,a,c),
file(unknown,unknown) ).
tff(f_64,axiom,
! [X] : product(X,X,identity),
file(unknown,unknown) ).
tff(f_65,axiom,
product(a,b,c),
file(unknown,unknown) ).
tff(f_40,axiom,
! [X] : product(X,identity,X),
file(unknown,unknown) ).
tff(f_62,axiom,
! [W,U,Z,X,Y,V] :
( ~ product(X,Y,U)
| ~ product(Y,Z,V)
| ~ product(X,V,W)
| product(U,Z,W) ),
file(unknown,unknown) ).
tff(f_38,axiom,
! [X] : product(identity,X,X),
file(unknown,unknown) ).
tff(f_51,axiom,
! [W,U,Z,X,Y,V] :
( ~ product(X,Y,U)
| ~ product(Y,Z,V)
| ~ product(U,Z,W)
| product(X,V,W) ),
file(unknown,unknown) ).
tff(c_14,plain,
~ product(b,a,c),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_10,plain,
! [X_15] : product(X_15,X_15,identity),
inference(cnfTransformation,[status(thm)],[f_64]) ).
tff(c_12,plain,
product(a,b,c),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_4,plain,
! [X_2] : product(X_2,identity,X_2),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_18,plain,
! [Z_24,X_20,Y_21,V_22,U_23,W_19] :
( product(U_23,Z_24,W_19)
| ~ product(X_20,V_22,W_19)
| ~ product(Y_21,Z_24,V_22)
| ~ product(X_20,Y_21,U_23) ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_151,plain,
! [U_50,Z_51,X_52,Y_53] :
( product(U_50,Z_51,X_52)
| ~ product(Y_53,Z_51,identity)
| ~ product(X_52,Y_53,U_50) ),
inference(resolution,[status(thm)],[c_4,c_18]) ).
tff(c_208,plain,
! [U_58,X_59,X_60] :
( product(U_58,X_59,X_60)
| ~ product(X_60,X_59,U_58) ),
inference(resolution,[status(thm)],[c_10,c_151]) ).
tff(c_225,plain,
product(c,b,a),
inference(resolution,[status(thm)],[c_12,c_208]) ).
tff(c_2,plain,
! [X_1] : product(identity,X_1,X_1),
inference(cnfTransformation,[status(thm)],[f_38]) ).
tff(c_74,plain,
! [X_33,U_35,W_36,Y_38,Z_37,V_34] :
( product(X_33,V_34,W_36)
| ~ product(U_35,Z_37,W_36)
| ~ product(Y_38,Z_37,V_34)
| ~ product(X_33,Y_38,U_35) ),
inference(cnfTransformation,[status(thm)],[f_51]) ).
tff(c_251,plain,
! [X_62,V_63,X_64,Y_65] :
( product(X_62,V_63,X_64)
| ~ product(Y_65,X_64,V_63)
| ~ product(X_62,Y_65,identity) ),
inference(resolution,[status(thm)],[c_2,c_74]) ).
tff(c_735,plain,
! [X_108] :
( product(X_108,a,b)
| ~ product(X_108,c,identity) ),
inference(resolution,[status(thm)],[c_225,c_251]) ).
tff(c_748,plain,
product(c,a,b),
inference(resolution,[status(thm)],[c_10,c_735]) ).
tff(c_160,plain,
! [U_50,X_15,X_52] :
( product(U_50,X_15,X_52)
| ~ product(X_52,X_15,U_50) ),
inference(resolution,[status(thm)],[c_10,c_151]) ).
tff(c_766,plain,
product(b,a,c),
inference(resolution,[status(thm)],[c_748,c_160]) ).
tff(c_789,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_14,c_766]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : GRP001-5 : TPTP v8.1.2. Released v1.0.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.36 % Computer : n013.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Thu Aug 3 21:55:47 EDT 2023
% 0.13/0.36 % CPUTime :
% 4.05/2.02 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 4.05/2.03
% 4.05/2.03 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 4.05/2.07
% 4.05/2.07 Inference rules
% 4.05/2.07 ----------------------
% 4.05/2.07 #Ref : 0
% 4.05/2.07 #Sup : 201
% 4.05/2.07 #Fact : 0
% 4.05/2.07 #Define : 0
% 4.05/2.07 #Split : 6
% 4.05/2.07 #Chain : 0
% 4.05/2.07 #Close : 0
% 4.05/2.07
% 4.05/2.07 Ordering : KBO
% 4.05/2.07
% 4.05/2.07 Simplification rules
% 4.05/2.07 ----------------------
% 4.05/2.07 #Subsume : 20
% 4.05/2.07 #Demod : 56
% 4.05/2.07 #Tautology : 58
% 4.05/2.07 #SimpNegUnit : 1
% 4.05/2.07 #BackRed : 0
% 4.05/2.07
% 4.05/2.07 #Partial instantiations: 0
% 4.05/2.07 #Strategies tried : 1
% 4.05/2.07
% 4.05/2.07 Timing (in seconds)
% 4.05/2.07 ----------------------
% 4.33/2.07 Preprocessing : 0.39
% 4.33/2.07 Parsing : 0.21
% 4.33/2.07 CNF conversion : 0.02
% 4.33/2.07 Main loop : 0.58
% 4.33/2.07 Inferencing : 0.21
% 4.34/2.07 Reduction : 0.14
% 4.34/2.07 Demodulation : 0.09
% 4.34/2.07 BG Simplification : 0.02
% 4.34/2.07 Subsumption : 0.17
% 4.34/2.07 Abstraction : 0.02
% 4.34/2.07 MUC search : 0.00
% 4.34/2.07 Cooper : 0.00
% 4.34/2.07 Total : 1.03
% 4.34/2.08 Index Insertion : 0.00
% 4.34/2.08 Index Deletion : 0.00
% 4.34/2.08 Index Matching : 0.00
% 4.34/2.08 BG Taut test : 0.00
%------------------------------------------------------------------------------