TSTP Solution File: KLE086+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : KLE086+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 : n015.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:49 EDT 2023
% Result : Theorem 3.48s 1.86s
% Output : CNFRefutation 3.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of formulae : 29 ( 20 unt; 9 typ; 0 def)
% Number of atoms : 20 ( 19 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 7 >; 3 *; 0 +; 0 <<)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 11 (; 11 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ leq > multiplication > addition > #nlpp > domain > codomain > coantidomain > antidomain > zero > one
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(coantidomain,type,
coantidomain: $i > $i ).
tff(domain,type,
domain: $i > $i ).
tff(antidomain,type,
antidomain: $i > $i ).
tff(multiplication,type,
multiplication: ( $i * $i ) > $i ).
tff(addition,type,
addition: ( $i * $i ) > $i ).
tff(one,type,
one: $i ).
tff(codomain,type,
codomain: $i > $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(zero,type,
zero: $i ).
tff(f_132,negated_conjecture,
domain(zero) != zero,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
tff(f_113,axiom,
! [X0] : ( multiplication(antidomain(X0),X0) = zero ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain1) ).
tff(f_65,axiom,
! [A] : ( multiplication(A,one) = A ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',multiplicative_right_identity) ).
tff(f_58,axiom,
! [A] : ( addition(A,zero) = A ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+0.ax',additive_identity) ).
tff(f_119,axiom,
! [X0] : ( domain(X0) = antidomain(antidomain(X0)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain4) ).
tff(f_117,axiom,
! [X0] : ( addition(antidomain(antidomain(X0)),antidomain(X0)) = one ),
file('/export/starexec/sandbox2/benchmark/Axioms/KLE001+4.ax',domain3) ).
tff(c_44,plain,
domain(zero) != zero,
inference(cnfTransformation,[status(thm)],[f_132]) ).
tff(c_219,plain,
! [X0_42] : ( multiplication(antidomain(X0_42),X0_42) = zero ),
inference(cnfTransformation,[status(thm)],[f_113]) ).
tff(c_12,plain,
! [A_11] : ( multiplication(A_11,one) = A_11 ),
inference(cnfTransformation,[status(thm)],[f_65]) ).
tff(c_228,plain,
antidomain(one) = zero,
inference(superposition,[status(thm),theory(equality)],[c_219,c_12]) ).
tff(c_6,plain,
! [A_6] : ( addition(A_6,zero) = A_6 ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_34,plain,
! [X0_27] : ( antidomain(antidomain(X0_27)) = domain(X0_27) ),
inference(cnfTransformation,[status(thm)],[f_119]) ).
tff(c_251,plain,
domain(one) = antidomain(zero),
inference(superposition,[status(thm),theory(equality)],[c_228,c_34]) ).
tff(c_32,plain,
! [X0_26] : ( addition(antidomain(antidomain(X0_26)),antidomain(X0_26)) = one ),
inference(cnfTransformation,[status(thm)],[f_117]) ).
tff(c_405,plain,
! [X0_49] : ( addition(domain(X0_49),antidomain(X0_49)) = one ),
inference(demodulation,[status(thm),theory(equality)],[c_34,c_32]) ).
tff(c_427,plain,
addition(domain(one),zero) = one,
inference(superposition,[status(thm),theory(equality)],[c_228,c_405]) ).
tff(c_434,plain,
antidomain(zero) = one,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_251,c_427]) ).
tff(c_453,plain,
domain(zero) = antidomain(one),
inference(superposition,[status(thm),theory(equality)],[c_434,c_34]) ).
tff(c_457,plain,
domain(zero) = zero,
inference(demodulation,[status(thm),theory(equality)],[c_228,c_453]) ).
tff(c_459,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_44,c_457]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : KLE086+1 : TPTP v8.1.2. Released v4.0.0.
% 0.15/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.15/0.36 % Computer : n015.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 23:35:14 EDT 2023
% 0.15/0.36 % CPUTime :
% 3.48/1.86 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.48/1.87
% 3.48/1.87 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.56/1.89
% 3.56/1.89 Inference rules
% 3.56/1.89 ----------------------
% 3.56/1.89 #Ref : 0
% 3.56/1.89 #Sup : 109
% 3.56/1.89 #Fact : 0
% 3.56/1.89 #Define : 0
% 3.56/1.89 #Split : 0
% 3.56/1.89 #Chain : 0
% 3.56/1.89 #Close : 0
% 3.56/1.89
% 3.56/1.89 Ordering : KBO
% 3.56/1.89
% 3.56/1.89 Simplification rules
% 3.56/1.89 ----------------------
% 3.56/1.89 #Subsume : 0
% 3.56/1.89 #Demod : 33
% 3.56/1.89 #Tautology : 79
% 3.56/1.89 #SimpNegUnit : 1
% 3.56/1.89 #BackRed : 2
% 3.56/1.89
% 3.56/1.89 #Partial instantiations: 0
% 3.56/1.89 #Strategies tried : 1
% 3.56/1.89
% 3.56/1.89 Timing (in seconds)
% 3.56/1.89 ----------------------
% 3.56/1.90 Preprocessing : 0.51
% 3.56/1.90 Parsing : 0.28
% 3.56/1.90 CNF conversion : 0.03
% 3.56/1.90 Main loop : 0.32
% 3.56/1.90 Inferencing : 0.10
% 3.56/1.90 Reduction : 0.12
% 3.56/1.90 Demodulation : 0.09
% 3.56/1.90 BG Simplification : 0.02
% 3.56/1.90 Subsumption : 0.06
% 3.56/1.90 Abstraction : 0.01
% 3.56/1.90 MUC search : 0.00
% 3.56/1.90 Cooper : 0.00
% 3.56/1.90 Total : 0.87
% 3.56/1.90 Index Insertion : 0.00
% 3.56/1.90 Index Deletion : 0.00
% 3.56/1.90 Index Matching : 0.00
% 3.56/1.90 BG Taut test : 0.00
%------------------------------------------------------------------------------