TSTP Solution File: NUM847+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM847+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 : n026.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 7.30s 2.87s
% Output : CNFRefutation 7.30s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 17
% Syntax : Number of formulae : 30 ( 17 unt; 12 typ; 0 def)
% Number of atoms : 19 ( 18 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 : 14 ( 8 >; 6 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-2 aty)
% Number of variables : 19 (; 19 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > leq > greater > geq > vplus > vmul > #nlpp > vsucc > vskolem2 > vd439 > vd437 > vd436 > v1
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(greater,type,
greater: ( $i * $i ) > $o ).
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(geq,type,
geq: ( $i * $i ) > $o ).
tff(vmul,type,
vmul: ( $i * $i ) > $i ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(vd436,type,
vd436: $i ).
tff(f_52,axiom,
! [Vd78,Vd79] : ( vplus(Vd79,Vd78) = vplus(Vd78,Vd79) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(61,0),0)) ).
tff(f_42,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_33,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_29,negated_conjecture,
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_58,axiom,
! [Vd46,Vd47,Vd48] : ( vplus(vplus(Vd46,Vd47),Vd48) = vplus(Vd46,vplus(Vd47,Vd48)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(33,0),0)) ).
tff(c_28,plain,
! [Vd79_9,Vd78_8] : ( vplus(Vd79_9,Vd78_8) = vplus(Vd78_8,Vd79_9) ),
inference(cnfTransformation,[status(thm)],[f_52]) ).
tff(c_404,plain,
! [Vd396_41,Vd397_42] : ( vplus(vmul(Vd396_41,Vd397_42),Vd396_41) = vmul(Vd396_41,vsucc(Vd397_42)) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_444,plain,
! [Vd78_8,Vd397_42] : ( vplus(Vd78_8,vmul(Vd78_8,Vd397_42)) = vmul(Vd78_8,vsucc(Vd397_42)) ),
inference(superposition,[status(thm),theory(equality)],[c_28,c_404]) ).
tff(c_10,plain,
vplus(vmul(vd436,vd437),vmul(vd436,vd439)) = vmul(vd436,vplus(vd437,vd439)),
inference(cnfTransformation,[status(thm)],[f_33]) ).
tff(c_2,plain,
vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436) != vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)),
inference(cnfTransformation,[status(thm)],[f_29]) ).
tff(c_51,plain,
vplus(vmul(vd436,vd437),vplus(vd436,vmul(vd436,vd439))) != vplus(vd436,vmul(vd436,vplus(vd437,vd439))),
inference(demodulation,[status(thm),theory(equality)],[c_10,c_28,c_28,c_2]) ).
tff(c_891,plain,
vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))) != vmul(vd436,vsucc(vplus(vd437,vd439))),
inference(demodulation,[status(thm),theory(equality)],[c_444,c_444,c_51]) ).
tff(c_20,plain,
! [Vd396_2,Vd397_3] : ( vplus(vmul(Vd396_2,Vd397_3),Vd396_2) = vmul(Vd396_2,vsucc(Vd397_3)) ),
inference(cnfTransformation,[status(thm)],[f_42]) ).
tff(c_34,plain,
! [Vd46_13,Vd47_14,Vd48_15] : ( vplus(vplus(Vd46_13,Vd47_14),Vd48_15) = vplus(Vd46_13,vplus(Vd47_14,Vd48_15)) ),
inference(cnfTransformation,[status(thm)],[f_58]) ).
tff(c_4880,plain,
! [Vd48_103] : ( vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),Vd48_103)) = vplus(vmul(vd436,vplus(vd437,vd439)),Vd48_103) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_34]) ).
tff(c_4979,plain,
vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))) = vplus(vmul(vd436,vplus(vd437,vd439)),vd436),
inference(superposition,[status(thm),theory(equality)],[c_20,c_4880]) ).
tff(c_5016,plain,
vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))) = vmul(vd436,vsucc(vplus(vd437,vd439))),
inference(demodulation,[status(thm),theory(equality)],[c_444,c_28,c_4979]) ).
tff(c_5018,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_891,c_5016]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM847+2 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.13 % 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 : n026.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 15:41:32 EDT 2023
% 0.14/0.35 % CPUTime :
% 7.30/2.87 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.30/2.88
% 7.30/2.88 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.30/2.90
% 7.30/2.90 Inference rules
% 7.30/2.90 ----------------------
% 7.30/2.90 #Ref : 0
% 7.30/2.90 #Sup : 1243
% 7.30/2.90 #Fact : 0
% 7.30/2.90 #Define : 0
% 7.30/2.90 #Split : 0
% 7.30/2.90 #Chain : 0
% 7.30/2.90 #Close : 0
% 7.30/2.90
% 7.30/2.90 Ordering : KBO
% 7.30/2.90
% 7.30/2.90 Simplification rules
% 7.30/2.90 ----------------------
% 7.30/2.90 #Subsume : 161
% 7.30/2.90 #Demod : 990
% 7.30/2.90 #Tautology : 244
% 7.30/2.90 #SimpNegUnit : 1
% 7.30/2.90 #BackRed : 1
% 7.30/2.90
% 7.30/2.90 #Partial instantiations: 0
% 7.30/2.90 #Strategies tried : 1
% 7.30/2.90
% 7.30/2.90 Timing (in seconds)
% 7.30/2.90 ----------------------
% 7.30/2.90 Preprocessing : 0.50
% 7.30/2.90 Parsing : 0.27
% 7.30/2.90 CNF conversion : 0.02
% 7.30/2.90 Main loop : 1.23
% 7.30/2.90 Inferencing : 0.35
% 7.30/2.90 Reduction : 0.62
% 7.30/2.90 Demodulation : 0.52
% 7.30/2.90 BG Simplification : 0.05
% 7.30/2.91 Subsumption : 0.15
% 7.30/2.91 Abstraction : 0.06
% 7.30/2.91 MUC search : 0.00
% 7.30/2.91 Cooper : 0.00
% 7.30/2.91 Total : 1.77
% 7.30/2.91 Index Insertion : 0.00
% 7.30/2.91 Index Deletion : 0.00
% 7.30/2.91 Index Matching : 0.00
% 7.30/2.91 BG Taut test : 0.00
%------------------------------------------------------------------------------