TSTP Solution File: NUM851+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM851+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/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 : n031.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:55 EDT 2023
% Result : Theorem 3.30s 1.85s
% Output : CNFRefutation 3.55s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 21
% Syntax : Number of formulae : 26 ( 9 unt; 17 typ; 0 def)
% Number of atoms : 9 ( 8 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 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 : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 10 (; 10 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ less > leq > greater > geq > vplus > vmul > #nlpp > vsucc > vskolem2 > vd473 > vd471 > vd470 > vd469 > v1 > #skF_3 > #skF_2 > #skF_1 > #skF_4
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(vd473,type,
vd473: $i ).
tff(greater,type,
greater: ( $i * $i ) > $o ).
tff(vplus,type,
vplus: ( $i * $i ) > $i ).
tff(vd470,type,
vd470: $i ).
tff(vd469,type,
vd469: $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(vd471,type,
vd471: $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('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff(f_30,axiom,
vd470 = vplus(vd471,vd473),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holds(conseq_conjunct1(conseq(302)),474,0)) ).
tff(f_35,axiom,
! [Vd432,Vd433,Vd434] : ( vmul(Vd432,vplus(Vd433,Vd434)) = vplus(vmul(Vd432,Vd433),vmul(Vd432,Vd434)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(281,0),0)) ).
tff(f_37,axiom,
! [Vd418,Vd419] : ( vmul(Vd418,Vd419) = vmul(Vd419,Vd418) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(270,0),0)) ).
tff(f_28,negated_conjecture,
vmul(vplus(vd471,vd473),vd469) != vplus(vmul(vd471,vd469),vmul(vd473,vd469)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holds(conseq_conjunct2(conseq(302)),475,1)) ).
tff(c_6,plain,
vplus(vd471,vd473) = vd470,
inference(cnfTransformation,[status(thm)],[f_30]) ).
tff(c_12,plain,
! [Vd432_4,Vd433_5,Vd434_6] : ( vplus(vmul(Vd432_4,Vd433_5),vmul(Vd432_4,Vd434_6)) = vmul(Vd432_4,vplus(Vd433_5,Vd434_6)) ),
inference(cnfTransformation,[status(thm)],[f_35]) ).
tff(c_14,plain,
! [Vd419_8,Vd418_7] : ( vmul(Vd419_8,Vd418_7) = vmul(Vd418_7,Vd419_8) ),
inference(cnfTransformation,[status(thm)],[f_37]) ).
tff(c_2,plain,
vplus(vmul(vd471,vd469),vmul(vd473,vd469)) != vmul(vplus(vd471,vd473),vd469),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_136,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_6,c_12,c_6,c_14,c_14,c_14,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : NUM851+1 : TPTP v8.1.2. Released v4.1.0.
% 0.08/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.37 % Computer : n031.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 3 15:44:14 EDT 2023
% 0.15/0.37 % CPUTime :
% 3.30/1.85 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.51/1.85
% 3.51/1.85 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.55/1.87
% 3.55/1.87 Inference rules
% 3.55/1.87 ----------------------
% 3.55/1.87 #Ref : 0
% 3.55/1.87 #Sup : 0
% 3.55/1.87 #Fact : 0
% 3.55/1.87 #Define : 0
% 3.55/1.87 #Split : 0
% 3.55/1.87 #Chain : 0
% 3.55/1.87 #Close : 0
% 3.55/1.87
% 3.55/1.87 Ordering : KBO
% 3.55/1.87
% 3.55/1.87 Simplification rules
% 3.55/1.87 ----------------------
% 3.55/1.87 #Subsume : 60
% 3.55/1.87 #Demod : 13
% 3.55/1.87 #Tautology : 3
% 3.55/1.87 #SimpNegUnit : 0
% 3.55/1.87 #BackRed : 0
% 3.55/1.87
% 3.55/1.87 #Partial instantiations: 0
% 3.55/1.87 #Strategies tried : 1
% 3.55/1.87
% 3.55/1.87 Timing (in seconds)
% 3.55/1.87 ----------------------
% 3.55/1.88 Preprocessing : 0.61
% 3.55/1.88 Parsing : 0.32
% 3.55/1.88 CNF conversion : 0.04
% 3.55/1.88 Main loop : 0.17
% 3.55/1.88 Inferencing : 0.00
% 3.55/1.88 Reduction : 0.10
% 3.55/1.88 Demodulation : 0.07
% 3.55/1.88 BG Simplification : 0.03
% 3.55/1.88 Subsumption : 0.06
% 3.55/1.88 Abstraction : 0.01
% 3.55/1.88 MUC search : 0.00
% 3.55/1.88 Cooper : 0.00
% 3.55/1.88 Total : 0.82
% 3.55/1.88 Index Insertion : 0.00
% 3.55/1.88 Index Deletion : 0.00
% 3.55/1.88 Index Matching : 0.00
% 3.55/1.88 BG Taut test : 0.00
%------------------------------------------------------------------------------