TSTP Solution File: ALG235-1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : ALG235-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/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 : n031.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:32:27 EDT 2023
% Result : Unsatisfiable 10.99s 4.29s
% Output : CNFRefutation 11.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of formulae : 16 ( 11 unt; 5 typ; 0 def)
% Number of atoms : 11 ( 10 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 2 ( 1 >; 1 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 24 (; 24 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ mult > #nlpp > d > c > b > a
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(a,type,
a: $i ).
tff(b,type,
b: $i ).
tff(d,type,
d: $i ).
tff(mult,type,
mult: ( $i * $i ) > $i ).
tff(c,type,
c: $i ).
tff(f_27,axiom,
! [A,B,C,D] : ( mult(A,mult(B,mult(C,D))) = mult(C,mult(B,mult(A,D))) ),
file(unknown,unknown) ).
tff(f_25,axiom,
! [A,B] : ( mult(A,mult(B,mult(A,B))) = mult(A,B) ),
file(unknown,unknown) ).
tff(f_31,axiom,
mult(a,mult(b,mult(a,mult(c,mult(d,c))))) != mult(a,mult(b,mult(d,c))),
file(unknown,unknown) ).
tff(c_4,plain,
! [C_5,B_4,A_3,D_6] : ( mult(C_5,mult(B_4,mult(A_3,D_6))) = mult(A_3,mult(B_4,mult(C_5,D_6))) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_2,plain,
! [A_1,B_2] : ( mult(A_1,mult(B_2,mult(A_1,B_2))) = mult(A_1,B_2) ),
inference(cnfTransformation,[status(thm)],[f_25]) ).
tff(c_26,plain,
! [C_13,B_14,A_15,D_16] : ( mult(C_13,mult(B_14,mult(A_15,D_16))) = mult(A_15,mult(B_14,mult(C_13,D_16))) ),
inference(cnfTransformation,[status(thm)],[f_27]) ).
tff(c_6882,plain,
! [A_74,B_75,A_76,B_77] : ( mult(A_74,mult(B_75,mult(A_76,mult(B_77,mult(A_74,B_77))))) = mult(A_76,mult(B_75,mult(A_74,B_77))) ),
inference(superposition,[status(thm),theory(equality)],[c_2,c_26]) ).
tff(c_7395,plain,
! [A_3,B_75,D_6,C_5] : ( mult(A_3,mult(B_75,mult(A_3,mult(D_6,mult(C_5,D_6))))) = mult(C_5,mult(B_75,mult(A_3,D_6))) ),
inference(superposition,[status(thm),theory(equality)],[c_4,c_6882]) ).
tff(c_8,plain,
mult(a,mult(b,mult(a,mult(c,mult(d,c))))) != mult(a,mult(b,mult(d,c))),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_9680,plain,
mult(d,mult(b,mult(a,c))) != mult(a,mult(b,mult(d,c))),
inference(demodulation,[status(thm),theory(equality)],[c_7395,c_8]) ).
tff(c_9683,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4,c_9680]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : ALG235-1 : TPTP v8.1.2. Released v4.0.0.
% 0.08/0.15 % 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.16/0.36 % Computer : n031.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 20:46:29 EDT 2023
% 0.16/0.37 % CPUTime :
% 10.99/4.29 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.99/4.29
% 10.99/4.29 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 11.13/4.32
% 11.13/4.32 Inference rules
% 11.13/4.32 ----------------------
% 11.13/4.32 #Ref : 0
% 11.13/4.32 #Sup : 2449
% 11.13/4.32 #Fact : 0
% 11.13/4.32 #Define : 0
% 11.13/4.32 #Split : 0
% 11.13/4.32 #Chain : 0
% 11.13/4.32 #Close : 0
% 11.13/4.32
% 11.13/4.32 Ordering : KBO
% 11.13/4.32
% 11.13/4.32 Simplification rules
% 11.13/4.32 ----------------------
% 11.13/4.32 #Subsume : 107
% 11.13/4.32 #Demod : 2964
% 11.13/4.32 #Tautology : 486
% 11.13/4.32 #SimpNegUnit : 0
% 11.13/4.32 #BackRed : 3
% 11.13/4.32
% 11.13/4.32 #Partial instantiations: 0
% 11.13/4.32 #Strategies tried : 1
% 11.13/4.32
% 11.13/4.32 Timing (in seconds)
% 11.13/4.32 ----------------------
% 11.13/4.32 Preprocessing : 0.39
% 11.13/4.32 Parsing : 0.21
% 11.13/4.32 CNF conversion : 0.02
% 11.13/4.32 Main loop : 2.85
% 11.13/4.32 Inferencing : 0.62
% 11.13/4.32 Reduction : 1.85
% 11.13/4.32 Demodulation : 1.74
% 11.13/4.32 BG Simplification : 0.11
% 11.13/4.32 Subsumption : 0.21
% 11.13/4.32 Abstraction : 0.17
% 11.13/4.32 MUC search : 0.00
% 11.13/4.32 Cooper : 0.00
% 11.13/4.32 Total : 3.29
% 11.13/4.32 Index Insertion : 0.00
% 11.13/4.32 Index Deletion : 0.00
% 11.13/4.32 Index Matching : 0.00
% 11.13/4.32 BG Taut test : 0.00
%------------------------------------------------------------------------------