TSTP Solution File: GRP671-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : GRP671-1 : TPTP v8.1.2. Released v4.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 : 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:41:53 EDT 2023
% Result : Unsatisfiable 3.77s 2.07s
% Output : CNFRefutation 3.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 11
% Syntax : Number of formulae : 18 ( 11 unt; 7 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 ( 2 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 14 (; 14 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ rd > mult > ld > #nlpp > i > unit > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(ld,type,
ld: ( $i * $i ) > $i ).
tff(rd,type,
rd: ( $i * $i ) > $i ).
tff(a,type,
a: $i ).
tff(i,type,
i: $i > $i ).
tff(b,type,
b: $i ).
tff(unit,type,
unit: $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(f_35,axiom,
! [A] : ( mult(unit,A) = A ),
file(unknown,unknown) ).
tff(f_33,axiom,
! [A] : ( mult(A,unit) = A ),
file(unknown,unknown) ).
tff(f_41,axiom,
! [A,B,C] : ( mult(mult(A,B),mult(C,mult(A,B))) = mult(mult(mult(A,mult(B,C)),A),B) ),
file(unknown,unknown) ).
tff(f_43,axiom,
mult(mult(a,b),a) != mult(a,mult(b,a)),
file(unknown,unknown) ).
tff(c_12,plain,
! [A_10] : ( mult(unit,A_10) = A_10 ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_10,plain,
! [A_9] : ( mult(A_9,unit) = A_9 ),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_491,plain,
! [A_43,B_44,C_45] : ( mult(mult(mult(A_43,mult(B_44,C_45)),A_43),B_44) = mult(mult(A_43,B_44),mult(C_45,mult(A_43,B_44))) ),
inference(cnfTransformation,[status(thm)],[f_41]) ).
tff(c_575,plain,
! [B_44,C_45] : ( mult(mult(unit,B_44),mult(C_45,mult(unit,B_44))) = mult(mult(unit,mult(B_44,C_45)),B_44) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_491]) ).
tff(c_597,plain,
! [B_44,C_45] : ( mult(mult(B_44,C_45),B_44) = mult(B_44,mult(C_45,B_44)) ),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_12,c_12,c_575]) ).
tff(c_20,plain,
mult(mult(a,b),a) != mult(a,mult(b,a)),
inference(cnfTransformation,[status(thm)],[f_43]) ).
tff(c_2378,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_597,c_20]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : GRP671-1 : TPTP v8.1.2. Released v4.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.14/0.36 % Computer : n013.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.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Thu Aug 3 21:52:32 EDT 2023
% 0.14/0.37 % CPUTime :
% 3.77/2.07 % SZS status Unsatisfiable for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.77/2.07
% 3.77/2.07 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.77/2.10
% 3.77/2.10 Inference rules
% 3.77/2.10 ----------------------
% 3.77/2.10 #Ref : 0
% 3.77/2.10 #Sup : 579
% 3.77/2.10 #Fact : 0
% 3.77/2.10 #Define : 0
% 3.77/2.10 #Split : 0
% 3.77/2.10 #Chain : 0
% 3.77/2.10 #Close : 0
% 3.77/2.10
% 3.77/2.10 Ordering : KBO
% 3.77/2.10
% 3.77/2.10 Simplification rules
% 3.77/2.10 ----------------------
% 3.77/2.10 #Subsume : 0
% 3.77/2.10 #Demod : 555
% 3.77/2.10 #Tautology : 425
% 3.77/2.10 #SimpNegUnit : 0
% 3.77/2.10 #BackRed : 5
% 3.77/2.10
% 3.77/2.10 #Partial instantiations: 0
% 3.77/2.10 #Strategies tried : 1
% 3.77/2.10
% 3.77/2.10 Timing (in seconds)
% 3.77/2.10 ----------------------
% 3.77/2.10 Preprocessing : 0.42
% 3.77/2.10 Parsing : 0.23
% 3.77/2.10 CNF conversion : 0.02
% 3.77/2.10 Main loop : 0.61
% 3.77/2.10 Inferencing : 0.25
% 3.77/2.10 Reduction : 0.21
% 3.77/2.10 Demodulation : 0.16
% 3.77/2.10 BG Simplification : 0.03
% 3.77/2.10 Subsumption : 0.09
% 3.77/2.10 Abstraction : 0.04
% 3.77/2.10 MUC search : 0.00
% 3.77/2.10 Cooper : 0.00
% 3.77/2.10 Total : 1.08
% 3.77/2.10 Index Insertion : 0.00
% 3.77/2.10 Index Deletion : 0.00
% 3.77/2.10 Index Matching : 0.00
% 3.77/2.10 BG Taut test : 0.00
%------------------------------------------------------------------------------