TSTP Solution File: KLE074+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KLE074+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 : n029.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:44:48 EDT 2023
% Result : Theorem 2.45s 1.60s
% Output : CNFRefutation 2.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 12
% Syntax : Number of formulae : 17 ( 8 unt; 9 typ; 0 def)
% Number of atoms : 8 ( 7 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 : 2 ( 0 usr)
% Number of type conns : 7 ( 4 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 13 (; 13 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ leq > multiplication > addition > #nlpp > domain > zero > one > #skF_2 > #skF_3 > #skF_1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(domain,type,
domain: $i > $i ).
tff(multiplication,type,
multiplication: ( $i * $i ) > $i ).
tff(addition,type,
addition: ( $i * $i ) > $i ).
tff('#skF_2',type,
'#skF_2': $i ).
tff('#skF_3',type,
'#skF_3': $i ).
tff('#skF_1',type,
'#skF_1': $i ).
tff(one,type,
one: $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(zero,type,
zero: $i ).
tff(f_63,axiom,
! [A,B,C] : ( multiplication(A,multiplication(B,C)) = multiplication(multiplication(A,B),C) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+0.ax',multiplicative_associativity) ).
tff(f_117,axiom,
! [X0,X1] : ( domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))) ),
file('/export/starexec/sandbox/benchmark/Axioms/KLE001+5.ax',domain2) ).
tff(f_127,negated_conjecture,
~ ! [X0,X1,X2] : ( domain(multiplication(multiplication(X0,X1),domain(X2))) = domain(multiplication(X0,domain(multiplication(X1,domain(X2))))) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
tff(c_10,plain,
! [A_8,B_9,C_10] : ( multiplication(multiplication(A_8,B_9),C_10) = multiplication(A_8,multiplication(B_9,C_10)) ),
inference(cnfTransformation,[status(thm)],[f_63]) ).
tff(c_30,plain,
! [X0_24,X1_25] : ( domain(multiplication(X0_24,domain(X1_25))) = domain(multiplication(X0_24,X1_25)) ),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_38,plain,
domain(multiplication('#skF_1',domain(multiplication('#skF_2',domain('#skF_3'))))) != domain(multiplication(multiplication('#skF_1','#skF_2'),domain('#skF_3'))),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_39,plain,
domain(multiplication(multiplication('#skF_1','#skF_2'),'#skF_3')) != domain(multiplication('#skF_1',multiplication('#skF_2','#skF_3'))),
inference(demodulation,[status(thm),theory(equality)],[c_30,c_30,c_30,c_38]) ).
tff(c_41,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_10,c_39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KLE074+1 : TPTP v8.1.2. Released v4.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.14/0.35 % Computer : n029.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 23:37:22 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.45/1.60 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.45/1.60
% 2.45/1.60 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 2.45/1.63
% 2.45/1.63 Inference rules
% 2.45/1.63 ----------------------
% 2.45/1.63 #Ref : 0
% 2.45/1.63 #Sup : 0
% 2.45/1.63 #Fact : 0
% 2.45/1.63 #Define : 0
% 2.45/1.63 #Split : 0
% 2.45/1.63 #Chain : 0
% 2.45/1.63 #Close : 0
% 2.45/1.63
% 2.45/1.63 Ordering : KBO
% 2.45/1.63
% 2.45/1.63 Simplification rules
% 2.45/1.63 ----------------------
% 2.45/1.63 #Subsume : 18
% 2.45/1.63 #Demod : 4
% 2.45/1.63 #Tautology : 0
% 2.45/1.63 #SimpNegUnit : 0
% 2.45/1.63 #BackRed : 0
% 2.45/1.63
% 2.45/1.63 #Partial instantiations: 0
% 2.45/1.63 #Strategies tried : 1
% 2.45/1.63
% 2.45/1.63 Timing (in seconds)
% 2.45/1.63 ----------------------
% 2.45/1.64 Preprocessing : 0.48
% 2.45/1.64 Parsing : 0.26
% 2.45/1.64 CNF conversion : 0.03
% 2.45/1.64 Main loop : 0.09
% 2.45/1.64 Inferencing : 0.00
% 2.45/1.64 Reduction : 0.04
% 2.45/1.64 Demodulation : 0.04
% 2.45/1.64 BG Simplification : 0.02
% 2.45/1.64 Subsumption : 0.03
% 2.45/1.64 Abstraction : 0.01
% 2.45/1.64 MUC search : 0.00
% 2.45/1.64 Cooper : 0.00
% 2.45/1.64 Total : 0.62
% 2.45/1.64 Index Insertion : 0.00
% 2.45/1.64 Index Deletion : 0.00
% 2.45/1.64 Index Matching : 0.00
% 2.45/1.64 BG Taut test : 0.00
%------------------------------------------------------------------------------