TSTP Solution File: NUM848+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM848+2 : TPTP v8.1.2. Released v4.1.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 : n017.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:52:54 EDT 2023
% Result : Theorem 4.23s 2.03s
% Output : CNFRefutation 4.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 15
% Syntax : Number of formulae : 26 ( 15 unt; 10 typ; 0 def)
% Number of atoms : 17 ( 16 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 5 ( 4 ~; 0 |; 1 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 10 ( 6 >; 4 *; 0 +; 0 <<)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > leq > vplus > vmul > #nlpp > vsucc > vskolem2 > vd439 > vd437 > vd436 > v1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(vd439,type,
vd439: $i ).
tff(vplus,type,
vplus: ( $i * $i ) > $i ).
tff(vd437,type,
vd437: $i ).
tff(less,type,
less: ( $i * $i ) > $o ).
tff(vskolem2,type,
vskolem2: $i > $i ).
tff(vsucc,type,
vsucc: $i > $i ).
tff(v1,type,
v1: $i ).
tff(vmul,type,
vmul: ( $i * $i ) > $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(vd436,type,
vd436: $i ).
tff(f_46,axiom,
! [Vd78,Vd79] : ( vplus(Vd79,Vd78) = vplus(Vd78,Vd79) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(61,0),0)) ).
tff(f_40,axiom,
! [Vd396,Vd397] :
( ( vmul(Vd396,vsucc(Vd397)) = vplus(vmul(Vd396,Vd397),Vd396) )
& ( vmul(Vd396,v1) = Vd396 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',qu(cond(conseq(axiom(3)),32),and(holds(definiens(249),399,0),holds(definiens(249),398,0)))) ).
tff(f_34,axiom,
vmul(vd436,vplus(vd437,vd439)) = vplus(vmul(vd436,vd437),vmul(vd436,vd439)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holds(285,440,0)) ).
tff(f_30,axiom,
vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436) = vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holds(286,441,3)) ).
tff(f_29,negated_conjecture,
vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)) != vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holds(286,441,4)) ).
tff(c_24,plain,
! [Vd79_6,Vd78_5] : ( vplus(Vd79_6,Vd78_5) = vplus(Vd78_5,Vd79_6) ),
inference(cnfTransformation,[status(thm)],[f_46]) ).
tff(c_373,plain,
! [Vd396_32,Vd397_33] : ( vplus(vmul(Vd396_32,Vd397_33),Vd396_32) = vmul(Vd396_32,vsucc(Vd397_33)) ),
inference(cnfTransformation,[status(thm)],[f_40]) ).
tff(c_413,plain,
! [Vd78_5,Vd397_33] : ( vplus(Vd78_5,vmul(Vd78_5,Vd397_33)) = vmul(Vd78_5,vsucc(Vd397_33)) ),
inference(superposition,[status(thm),theory(equality)],[c_24,c_373]) ).
tff(c_12,plain,
vplus(vmul(vd436,vd437),vmul(vd436,vd439)) = vmul(vd436,vplus(vd437,vd439)),
inference(cnfTransformation,[status(thm)],[f_34]) ).
tff(c_4,plain,
vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436) = vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)),
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_43,plain,
vplus(vmul(vd436,vd437),vplus(vd436,vmul(vd436,vd439))) = vplus(vd436,vmul(vd436,vplus(vd437,vd439))),
inference(demodulation,[status(thm),theory(equality)],[c_12,c_24,c_24,c_4]) ).
tff(c_2,plain,
vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)) != vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_44,plain,
vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))) != vplus(vd436,vmul(vd436,vplus(vd437,vd439))),
inference(demodulation,[status(thm),theory(equality)],[c_43,c_24,c_2]) ).
tff(c_773,plain,
vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))) != vmul(vd436,vsucc(vplus(vd437,vd439))),
inference(demodulation,[status(thm),theory(equality)],[c_413,c_44]) ).
tff(c_1236,plain,
vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))) = vmul(vd436,vsucc(vplus(vd437,vd439))),
inference(demodulation,[status(thm),theory(equality)],[c_413,c_413,c_43]) ).
tff(c_1237,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_773,c_1236]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : NUM848+2 : TPTP v8.1.2. Released v4.1.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.17/0.35 % Computer : n017.cluster.edu
% 0.17/0.35 % Model : x86_64 x86_64
% 0.17/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.35 % Memory : 8042.1875MB
% 0.17/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.35 % CPULimit : 300
% 0.17/0.35 % WCLimit : 300
% 0.17/0.35 % DateTime : Thu Aug 3 14:22:51 EDT 2023
% 0.17/0.35 % CPUTime :
% 4.23/2.03 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 4.23/2.03
% 4.23/2.03 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 4.23/2.05
% 4.23/2.05 Inference rules
% 4.23/2.05 ----------------------
% 4.23/2.05 #Ref : 0
% 4.23/2.05 #Sup : 291
% 4.23/2.05 #Fact : 0
% 4.23/2.05 #Define : 0
% 4.23/2.05 #Split : 0
% 4.23/2.06 #Chain : 0
% 4.23/2.06 #Close : 0
% 4.23/2.06
% 4.23/2.06 Ordering : KBO
% 4.23/2.06
% 4.23/2.06 Simplification rules
% 4.23/2.06 ----------------------
% 4.23/2.06 #Subsume : 16
% 4.23/2.06 #Demod : 234
% 4.23/2.06 #Tautology : 134
% 4.23/2.06 #SimpNegUnit : 1
% 4.23/2.06 #BackRed : 1
% 4.23/2.06
% 4.23/2.06 #Partial instantiations: 0
% 4.23/2.06 #Strategies tried : 1
% 4.23/2.06
% 4.23/2.06 Timing (in seconds)
% 4.23/2.06 ----------------------
% 4.23/2.06 Preprocessing : 0.48
% 4.23/2.06 Parsing : 0.26
% 4.23/2.06 CNF conversion : 0.02
% 4.23/2.06 Main loop : 0.54
% 4.23/2.06 Inferencing : 0.17
% 4.23/2.06 Reduction : 0.23
% 4.23/2.06 Demodulation : 0.19
% 4.23/2.06 BG Simplification : 0.03
% 4.23/2.06 Subsumption : 0.08
% 4.23/2.06 Abstraction : 0.03
% 4.23/2.06 MUC search : 0.00
% 4.23/2.06 Cooper : 0.00
% 4.23/2.06 Total : 1.05
% 4.23/2.06 Index Insertion : 0.00
% 4.23/2.06 Index Deletion : 0.00
% 4.23/2.06 Index Matching : 0.00
% 4.23/2.06 BG Taut test : 0.00
%------------------------------------------------------------------------------