TSTP Solution File: NUM846+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM846+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 : n013.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:53 EDT 2023
% Result : Theorem 3.38s 1.82s
% Output : CNFRefutation 3.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 19
% Syntax : Number of formulae : 23 ( 7 unt; 16 typ; 0 def)
% Number of atoms : 7 ( 6 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 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 : 4 (; 4 !; 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_31,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_228,axiom,
! [Vd78,Vd79] : ( vplus(Vd79,Vd78) = vplus(Vd78,Vd79) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(61,0),0)) ).
tff(f_28,negated_conjecture,
vplus(vmul(vd436,vplus(vd437,vd439)),vd436) != vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',holds(286,441,2)) ).
tff(c_8,plain,
vplus(vmul(vd436,vd437),vmul(vd436,vd439)) = vmul(vd436,vplus(vd437,vd439)),
inference(cnfTransformation,[status(thm)],[f_31]) ).
tff(c_111,plain,
! [Vd79_109,Vd78_108] : ( vplus(Vd79_109,Vd78_108) = vplus(Vd78_108,Vd79_109) ),
inference(cnfTransformation,[status(thm)],[f_228]) ).
tff(c_2,plain,
vplus(vplus(vmul(vd436,vd437),vmul(vd436,vd439)),vd436) != vplus(vmul(vd436,vplus(vd437,vd439)),vd436),
inference(cnfTransformation,[status(thm)],[f_28]) ).
tff(c_142,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_111,c_111,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : NUM846+1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/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.14/0.36 % Computer : n013.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 14:53:17 EDT 2023
% 0.14/0.36 % CPUTime :
% 3.38/1.82 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 3.38/1.83
% 3.38/1.83 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 3.38/1.85
% 3.38/1.85 Inference rules
% 3.38/1.85 ----------------------
% 3.38/1.85 #Ref : 0
% 3.38/1.85 #Sup : 0
% 3.38/1.85 #Fact : 0
% 3.38/1.85 #Define : 0
% 3.38/1.85 #Split : 0
% 3.38/1.85 #Chain : 0
% 3.38/1.85 #Close : 0
% 3.38/1.85
% 3.38/1.85 Ordering : KBO
% 3.38/1.85
% 3.38/1.85 Simplification rules
% 3.38/1.85 ----------------------
% 3.38/1.85 #Subsume : 57
% 3.38/1.85 #Demod : 12
% 3.38/1.85 #Tautology : 7
% 3.38/1.85 #SimpNegUnit : 0
% 3.38/1.85 #BackRed : 0
% 3.38/1.85
% 3.38/1.85 #Partial instantiations: 0
% 3.38/1.85 #Strategies tried : 1
% 3.38/1.85
% 3.38/1.85 Timing (in seconds)
% 3.38/1.85 ----------------------
% 3.38/1.85 Preprocessing : 0.63
% 3.38/1.85 Parsing : 0.32
% 3.38/1.85 CNF conversion : 0.05
% 3.38/1.85 Main loop : 0.17
% 3.38/1.85 Inferencing : 0.00
% 3.38/1.85 Reduction : 0.10
% 3.38/1.85 Demodulation : 0.07
% 3.38/1.85 BG Simplification : 0.03
% 3.38/1.85 Subsumption : 0.05
% 3.38/1.85 Abstraction : 0.01
% 3.38/1.85 MUC search : 0.00
% 3.38/1.85 Cooper : 0.00
% 3.38/1.86 Total : 0.84
% 3.38/1.86 Index Insertion : 0.00
% 3.38/1.86 Index Deletion : 0.00
% 3.38/1.86 Index Matching : 0.00
% 3.38/1.86 BG Taut test : 0.00
%------------------------------------------------------------------------------