TSTP Solution File: NUM846+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : NUM846+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 : n003.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 2.61s 1.64s
% Output : CNFRefutation 2.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 15
% Syntax : Number of formulae : 19 ( 7 unt; 12 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 : 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 : 4 (; 4 !; 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_32,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_55,axiom,
! [Vd78,Vd79] : ( vplus(Vd79,Vd78) = vplus(Vd78,Vd79) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ass(cond(61,0),0)) ).
tff(f_29,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_32]) ).
tff(c_30,plain,
! [Vd79_12,Vd78_11] : ( vplus(Vd79_12,Vd78_11) = vplus(Vd78_11,Vd79_12) ),
inference(cnfTransformation,[status(thm)],[f_55]) ).
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_29]) ).
tff(c_55,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_8,c_30,c_30,c_2]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.14 % Problem : NUM846+2 : TPTP v8.1.2. Released v4.1.0.
% 0.13/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.36 % Computer : n003.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 14:37:53 EDT 2023
% 0.22/0.36 % CPUTime :
% 2.61/1.64 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 2.84/1.64
% 2.84/1.64 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 2.84/1.66
% 2.84/1.66 Inference rules
% 2.84/1.66 ----------------------
% 2.84/1.66 #Ref : 0
% 2.84/1.66 #Sup : 0
% 2.84/1.66 #Fact : 0
% 2.84/1.66 #Define : 0
% 2.84/1.66 #Split : 0
% 2.84/1.66 #Chain : 0
% 2.84/1.66 #Close : 0
% 2.84/1.66
% 2.84/1.66 Ordering : KBO
% 2.84/1.66
% 2.84/1.66 Simplification rules
% 2.84/1.66 ----------------------
% 2.84/1.66 #Subsume : 17
% 2.84/1.66 #Demod : 10
% 2.84/1.66 #Tautology : 5
% 2.84/1.66 #SimpNegUnit : 0
% 2.84/1.66 #BackRed : 0
% 2.84/1.66
% 2.84/1.66 #Partial instantiations: 0
% 2.84/1.66 #Strategies tried : 1
% 2.84/1.66
% 2.84/1.66 Timing (in seconds)
% 2.84/1.67 ----------------------
% 2.84/1.67 Preprocessing : 0.51
% 2.84/1.67 Parsing : 0.28
% 2.84/1.67 CNF conversion : 0.03
% 2.84/1.67 Main loop : 0.10
% 2.84/1.67 Inferencing : 0.00
% 2.84/1.67 Reduction : 0.06
% 2.84/1.67 Demodulation : 0.05
% 2.84/1.67 BG Simplification : 0.02
% 2.84/1.67 Subsumption : 0.03
% 2.84/1.67 Abstraction : 0.01
% 2.84/1.67 MUC search : 0.00
% 2.84/1.67 Cooper : 0.00
% 2.84/1.67 Total : 0.65
% 2.84/1.67 Index Insertion : 0.00
% 2.84/1.67 Index Deletion : 0.00
% 2.84/1.67 Index Matching : 0.00
% 2.84/1.67 BG Taut test : 0.00
%------------------------------------------------------------------------------