TSTP Solution File: NUM847+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM847+1 : 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/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:52:54 EDT 2023
% Result : Theorem 69.21s 54.69s
% Output : CNFRefutation 69.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 23
% Syntax : Number of formulae : 38 ( 21 unt; 16 typ; 0 def)
% Number of atoms : 23 ( 22 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 : 22 ( 12 >; 10 *; 0 +; 0 <<)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 4 con; 0-2 aty)
% Number of variables : 27 (; 27 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > leq > greater > geq > vplus > vmul > #nlpp > vsucc > vskolem2 > vd439 > vd437 > vd436 > v1 > #skF_3 > #skF_2 > #skF_1 > #skF_4
%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('#skF_3',type,
'#skF_3': ( $i * $i ) > $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('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(vd436,type,
vd436: $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_229,axiom,
! [Vd78,Vd79] : ( vplus(Vd79,Vd78) = vplus(Vd78,Vd79) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(61,0),0)) ).
tff(f_45,axiom,
! [Vd396,Vd397] :
( ( vmul(Vd396,vsucc(Vd397)) = vplus(vmul(Vd396,Vd397),Vd396) )
& ( vmul(Vd396,v1) = Vd396 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',qu(cond(conseq(axiom(3)),32),and(holds(definiens(249),399,0),holds(definiens(249),398,0)))) ).
tff(f_32,axiom,
vmul(vd436,vplus(vd437,vd439)) = vplus(vmul(vd436,vd437),vmul(vd436,vd439)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(285,440,0)) ).
tff(f_28,negated_conjecture,
vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436) != vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),vd436)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',holds(286,441,3)) ).
tff(f_37,axiom,
! [Vd418,Vd419] : ( vmul(Vd418,Vd419) = vmul(Vd419,Vd418) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(270,0),0)) ).
tff(f_39,axiom,
! [Vd408,Vd409] : ( vmul(vsucc(Vd408),Vd409) = vplus(vmul(Vd408,Vd409),Vd409) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(261,0),0)) ).
tff(f_235,axiom,
! [Vd46,Vd47,Vd48] : ( vplus(vplus(Vd46,Vd47),Vd48) = vplus(Vd46,vplus(Vd47,Vd48)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ass(cond(33,0),0)) ).
tff(c_113,plain,
! [Vd79_109,Vd78_108] : ( vplus(Vd79_109,Vd78_108) = vplus(Vd78_108,Vd79_109) ),
inference(cnfTransformation,[status(thm)],[f_229]) ).
tff(c_1453,plain,
! [Vd396_244,Vd397_245] : ( vplus(vmul(Vd396_244,Vd397_245),Vd396_244) = vmul(Vd396_244,vsucc(Vd397_245)) ),
inference(cnfTransformation,[status(thm)],[f_45]) ).
tff(c_1544,plain,
! [Vd79_109,Vd397_245] : ( vplus(Vd79_109,vmul(Vd79_109,Vd397_245)) = vmul(Vd79_109,vsucc(Vd397_245)) ),
inference(superposition,[status(thm),theory(equality)],[c_113,c_1453]) ).
tff(c_10,plain,
vplus(vmul(vd436,vd437),vmul(vd436,vd439)) = vmul(vd436,vplus(vd437,vd439)),
inference(cnfTransformation,[status(thm)],[f_32]) ).
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_28]) ).
tff(c_144,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_113,c_113,c_2]) ).
tff(c_22572,plain,
vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))) != vmul(vd436,vsucc(vplus(vd437,vd439))),
inference(demodulation,[status(thm),theory(equality)],[c_1544,c_1544,c_144]) ).
tff(c_18,plain,
! [Vd419_2,Vd418_1] : ( vmul(Vd419_2,Vd418_1) = vmul(Vd418_1,Vd419_2) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_1997,plain,
! [Vd408_279,Vd409_280] : ( vplus(vmul(Vd408_279,Vd409_280),Vd409_280) = vmul(vsucc(Vd408_279),Vd409_280) ),
inference(cnfTransformation,[status(thm)],[f_39]) ).
tff(c_2124,plain,
! [Vd418_1,Vd419_2] : ( vplus(vmul(Vd418_1,Vd419_2),Vd418_1) = vmul(vsucc(Vd419_2),Vd418_1) ),
inference(superposition,[status(thm),theory(equality)],[c_18,c_1997]) ).
tff(c_119,plain,
! [Vd46_113,Vd47_114,Vd48_115] : ( vplus(vplus(Vd46_113,Vd47_114),Vd48_115) = vplus(Vd46_113,vplus(Vd47_114,Vd48_115)) ),
inference(cnfTransformation,[status(thm)],[f_235]) ).
tff(c_244655,plain,
! [Vd48_2794] : ( vplus(vmul(vd436,vd437),vplus(vmul(vd436,vd439),Vd48_2794)) = vplus(vmul(vd436,vplus(vd437,vd439)),Vd48_2794) ),
inference(superposition,[status(thm),theory(equality)],[c_10,c_119]) ).
tff(c_246655,plain,
vplus(vmul(vd436,vd437),vmul(vsucc(vd439),vd436)) = vplus(vmul(vd436,vplus(vd437,vd439)),vd436),
inference(superposition,[status(thm),theory(equality)],[c_2124,c_244655]) ).
tff(c_246813,plain,
vplus(vmul(vd436,vd437),vmul(vd436,vsucc(vd439))) = vmul(vd436,vsucc(vplus(vd437,vd439))),
inference(demodulation,[status(thm),theory(equality)],[c_1544,c_113,c_18,c_246655]) ).
tff(c_246815,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_22572,c_246813]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : NUM847+1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.13 % 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.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 14:43:37 EDT 2023
% 0.13/0.34 % CPUTime :
% 69.21/54.69 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 69.21/54.70
% 69.21/54.70 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 69.21/54.72
% 69.21/54.72 Inference rules
% 69.21/54.72 ----------------------
% 69.21/54.72 #Ref : 38
% 69.21/54.72 #Sup : 66075
% 69.21/54.72 #Fact : 10
% 69.21/54.72 #Define : 0
% 69.21/54.72 #Split : 3
% 69.21/54.72 #Chain : 0
% 69.21/54.72 #Close : 0
% 69.21/54.72
% 69.21/54.72 Ordering : KBO
% 69.21/54.72
% 69.21/54.72 Simplification rules
% 69.21/54.72 ----------------------
% 69.21/54.72 #Subsume : 15821
% 69.21/54.72 #Demod : 17590
% 69.21/54.72 #Tautology : 7432
% 69.21/54.72 #SimpNegUnit : 2268
% 69.21/54.72 #BackRed : 8
% 69.21/54.72
% 69.21/54.72 #Partial instantiations: 0
% 69.21/54.72 #Strategies tried : 1
% 69.21/54.72
% 69.21/54.72 Timing (in seconds)
% 69.21/54.72 ----------------------
% 69.21/54.73 Preprocessing : 0.62
% 69.21/54.73 Parsing : 0.32
% 69.21/54.73 CNF conversion : 0.04
% 69.21/54.73 Main loop : 53.00
% 69.21/54.73 Inferencing : 3.76
% 69.21/54.73 Reduction : 24.92
% 69.21/54.73 Demodulation : 16.61
% 69.21/54.73 BG Simplification : 0.33
% 69.21/54.73 Subsumption : 19.74
% 69.21/54.73 Abstraction : 0.42
% 69.21/54.73 MUC search : 0.00
% 69.21/54.73 Cooper : 0.00
% 69.21/54.73 Total : 53.66
% 69.21/54.73 Index Insertion : 0.00
% 69.21/54.73 Index Deletion : 0.00
% 69.21/54.73 Index Matching : 0.00
% 69.21/54.73 BG Taut test : 0.00
%------------------------------------------------------------------------------