TSTP Solution File: KLE075+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KLE075+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 : n002.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.86s 1.69s
% Output : CNFRefutation 2.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 10
% Syntax : Number of formulae : 15 ( 8 unt; 7 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 : 3 ( 2 avg)
% Maximal term depth : 4 ( 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 7 (; 7 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ leq > multiplication > addition > #nlpp > domain > zero > one > #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_1',type,
'#skF_1': $i ).
tff(one,type,
one: $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(zero,type,
zero: $i ).
tff(f_67,axiom,
! [A] : ( multiplication(one,A) = A ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_left_identity) ).
tff(f_117,axiom,
! [X0,X1] : ( domain(multiplication(X0,X1)) = domain(multiplication(X0,domain(X1))) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+5.ax',domain2) ).
tff(f_127,negated_conjecture,
~ ! [X0] : ( domain(multiplication(one,domain(X0))) = domain(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
tff(c_14,plain,
! [A_12] : ( multiplication(one,A_12) = A_12 ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
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(one,domain('#skF_1'))) != domain('#skF_1'),
inference(cnfTransformation,[status(thm)],[f_127]) ).
tff(c_39,plain,
domain(multiplication(one,'#skF_1')) != domain('#skF_1'),
inference(demodulation,[status(thm),theory(equality)],[c_30,c_38]) ).
tff(c_41,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_14,c_39]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : KLE075+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/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.35 % Computer : n002.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:40:17 EDT 2023
% 0.14/0.35 % CPUTime :
% 2.86/1.69 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.86/1.70
% 2.86/1.70 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.89/1.73
% 2.89/1.73 Inference rules
% 2.89/1.73 ----------------------
% 2.89/1.73 #Ref : 0
% 2.89/1.73 #Sup : 0
% 2.89/1.73 #Fact : 0
% 2.89/1.73 #Define : 0
% 2.89/1.73 #Split : 0
% 2.89/1.73 #Chain : 0
% 2.89/1.73 #Close : 0
% 2.89/1.73
% 2.89/1.73 Ordering : KBO
% 2.89/1.73
% 2.89/1.73 Simplification rules
% 2.89/1.73 ----------------------
% 2.89/1.73 #Subsume : 18
% 2.89/1.73 #Demod : 2
% 2.89/1.73 #Tautology : 0
% 2.89/1.73 #SimpNegUnit : 0
% 2.89/1.73 #BackRed : 0
% 2.89/1.73
% 2.89/1.73 #Partial instantiations: 0
% 2.89/1.73 #Strategies tried : 1
% 2.89/1.73
% 2.89/1.73 Timing (in seconds)
% 2.89/1.73 ----------------------
% 2.89/1.73 Preprocessing : 0.50
% 2.89/1.74 Parsing : 0.27
% 2.89/1.74 CNF conversion : 0.03
% 2.89/1.74 Main loop : 0.08
% 2.89/1.74 Inferencing : 0.00
% 2.89/1.74 Reduction : 0.04
% 2.89/1.74 Demodulation : 0.03
% 2.89/1.74 BG Simplification : 0.01
% 2.89/1.74 Subsumption : 0.04
% 2.89/1.74 Abstraction : 0.01
% 2.89/1.74 MUC search : 0.00
% 2.89/1.74 Cooper : 0.00
% 2.89/1.74 Total : 0.64
% 2.89/1.74 Index Insertion : 0.00
% 2.89/1.74 Index Deletion : 0.00
% 2.89/1.74 Index Matching : 0.00
% 2.89/1.74 BG Taut test : 0.00
%------------------------------------------------------------------------------