TSTP Solution File: SWV137+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV137+1 : TPTP v8.1.2. Bugfixed v3.3.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 : n023.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 11:02:59 EDT 2023
% Result : Theorem 9.26s 3.25s
% Output : CNFRefutation 9.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 69
% Syntax : Number of formulae : 78 ( 7 unt; 65 typ; 0 def)
% Number of atoms : 30 ( 0 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 25 ( 8 ~; 4 |; 10 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 160 ( 49 >; 111 *; 0 +; 0 <<)
% Number of predicates : 6 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 60 ( 60 usr; 15 con; 0-8 aty)
% Number of variables : 11 (; 11 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ lt > leq > gt > geq > tptp_update3 > tptp_update2 > tptp_const_array2 > sum > a_select3 > uniform_int_rnd > tptp_msub > tptp_mmul > tptp_madd > tptp_const_array1 > plus > minus > dim > a_select2 > #nlpp > trans > succ > pred > inv > use > true > tptp_minus_1 > tptp_float_0_0 > s_worst7 > s_values7 > s_sworst7 > s_best7 > pv1325 > n5 > n4 > n3 > n2 > n1 > n0 > def > #skF_13 > #skF_24 > #skF_17 > #skF_23 > #skF_6 > #skF_19 > #skF_27 > #skF_21 > #skF_25 > #skF_12 > #skF_18 > #skF_3 > #skF_26 > #skF_20 > #skF_11 > #skF_7 > #skF_9 > #skF_15 > #skF_22 > #skF_14 > #skF_2 > #skF_8 > #skF_1 > #skF_5 > #skF_4 > #skF_16 > #skF_10
%Foreground sorts:
%Background operators:
%Foreground operators:
tff('#skF_13',type,
'#skF_13': ( $i * $i * $i ) > $i ).
tff('#skF_24',type,
'#skF_24': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff(true,type,
true: $o ).
tff('#skF_17',type,
'#skF_17': ( $i * $i * $i * $i ) > $i ).
tff(tptp_const_array2,type,
tptp_const_array2: ( $i * $i * $i ) > $i ).
tff('#skF_23',type,
'#skF_23': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff('#skF_6',type,
'#skF_6': ( $i * $i ) > $i ).
tff(tptp_minus_1,type,
tptp_minus_1: $i ).
tff('#skF_19',type,
'#skF_19': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff('#skF_27',type,
'#skF_27': ( $i * $i * $i * $i ) > $i ).
tff('#skF_21',type,
'#skF_21': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff('#skF_25',type,
'#skF_25': ( $i * $i * $i * $i * $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': ( $i * $i * $i ) > $i ).
tff('#skF_18',type,
'#skF_18': ( $i * $i * $i * $i ) > $i ).
tff(a_select3,type,
a_select3: ( $i * $i * $i ) > $i ).
tff(tptp_float_0_0,type,
tptp_float_0_0: $i ).
tff(a_select2,type,
a_select2: ( $i * $i ) > $i ).
tff('#skF_3',type,
'#skF_3': ( $i * $i ) > $i ).
tff(trans,type,
trans: $i > $i ).
tff(tptp_update3,type,
tptp_update3: ( $i * $i * $i * $i ) > $i ).
tff(n3,type,
n3: $i ).
tff('#skF_26',type,
'#skF_26': ( $i * $i * $i * $i * $i * $i ) > $i ).
tff(use,type,
use: $i ).
tff(pv1325,type,
pv1325: $i ).
tff(inv,type,
inv: $i > $i ).
tff(n1,type,
n1: $i ).
tff(tptp_madd,type,
tptp_madd: ( $i * $i ) > $i ).
tff(plus,type,
plus: ( $i * $i ) > $i ).
tff('#skF_20',type,
'#skF_20': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff(n0,type,
n0: $i ).
tff('#skF_11',type,
'#skF_11': ( $i * $i * $i ) > $i ).
tff(s_worst7,type,
s_worst7: $i ).
tff(tptp_update2,type,
tptp_update2: ( $i * $i * $i ) > $i ).
tff(gt,type,
gt: ( $i * $i ) > $o ).
tff('#skF_7',type,
'#skF_7': ( $i * $i * $i ) > $i ).
tff(n4,type,
n4: $i ).
tff(tptp_msub,type,
tptp_msub: ( $i * $i ) > $i ).
tff(s_values7,type,
s_values7: $i ).
tff('#skF_9',type,
'#skF_9': ( $i * $i * $i ) > $i ).
tff(tptp_const_array1,type,
tptp_const_array1: ( $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': ( $i * $i * $i ) > $i ).
tff('#skF_22',type,
'#skF_22': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff('#skF_14',type,
'#skF_14': ( $i * $i * $i ) > $i ).
tff(tptp_mmul,type,
tptp_mmul: ( $i * $i ) > $i ).
tff(uniform_int_rnd,type,
uniform_int_rnd: ( $i * $i ) > $i ).
tff(geq,type,
geq: ( $i * $i ) > $o ).
tff(leq,type,
leq: ( $i * $i ) > $o ).
tff(lt,type,
lt: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': ( $i * $i ) > $i ).
tff(def,type,
def: $i ).
tff('#skF_8',type,
'#skF_8': ( $i * $i * $i ) > $i ).
tff(s_best7,type,
s_best7: $i ).
tff(n2,type,
n2: $i ).
tff(s_sworst7,type,
s_sworst7: $i ).
tff(n5,type,
n5: $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(succ,type,
succ: $i > $i ).
tff(pred,type,
pred: $i > $i ).
tff(sum,type,
sum: ( $i * $i * $i ) > $i ).
tff('#skF_5',type,
'#skF_5': ( $i * $i ) > $i ).
tff('#skF_4',type,
'#skF_4': ( $i * $i ) > $i ).
tff('#skF_16',type,
'#skF_16': ( $i * $i * $i ) > $i ).
tff('#skF_10',type,
'#skF_10': ( $i * $i * $i ) > $i ).
tff(dim,type,
dim: ( $i * $i ) > $i ).
tff(minus,type,
minus: ( $i * $i ) > $i ).
tff(f_514,axiom,
gt(n2,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_2_0) ).
tff(f_94,axiom,
! [X,Y] :
( gt(Y,X)
=> leq(X,Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
tff(f_502,negated_conjecture,
~ ( ( leq(n0,s_best7)
& leq(n0,s_sworst7)
& leq(n0,s_worst7)
& leq(n2,pv1325)
& leq(s_best7,n3)
& leq(s_sworst7,n3)
& leq(s_worst7,n3)
& leq(pv1325,n3)
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_best7))
& leq(a_select2(s_values7,pv1325),a_select2(s_values7,s_worst7)) )
=> leq(n0,pv1325) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0007) ).
tff(f_80,axiom,
! [X,Y,Z] :
( ( leq(X,Y)
& leq(Y,Z) )
=> leq(X,Z) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).
tff(c_554,plain,
gt(n2,n0),
inference(cnfTransformation,[status(thm)],[f_514]) ).
tff(c_20,plain,
! [X_15,Y_16] :
( leq(X_15,Y_16)
| ~ gt(Y_16,X_15) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_526,plain,
leq(n2,pv1325),
inference(cnfTransformation,[status(thm)],[f_502]) ).
tff(c_3017,plain,
! [X_261,Z_262,Y_263] :
( leq(X_261,Z_262)
| ~ leq(Y_263,Z_262)
| ~ leq(X_261,Y_263) ),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_3174,plain,
! [X_271] :
( leq(X_271,pv1325)
| ~ leq(X_271,n2) ),
inference(resolution,[status(thm)],[c_526,c_3017]) ).
tff(c_512,plain,
~ leq(n0,pv1325),
inference(cnfTransformation,[status(thm)],[f_502]) ).
tff(c_3213,plain,
~ leq(n0,n2),
inference(resolution,[status(thm)],[c_3174,c_512]) ).
tff(c_3216,plain,
~ gt(n2,n0),
inference(resolution,[status(thm)],[c_20,c_3213]) ).
tff(c_3223,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_554,c_3216]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.13/0.13 % Problem : SWV137+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.13/0.14 % 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 : n023.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 23:24:22 EDT 2023
% 0.14/0.35 % CPUTime :
% 9.26/3.25 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.26/3.26
% 9.26/3.26 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 9.87/3.28
% 9.87/3.28 Inference rules
% 9.87/3.28 ----------------------
% 9.87/3.28 #Ref : 0
% 9.87/3.28 #Sup : 714
% 9.87/3.28 #Fact : 2
% 9.87/3.28 #Define : 0
% 9.87/3.28 #Split : 6
% 9.87/3.28 #Chain : 0
% 9.87/3.28 #Close : 0
% 9.87/3.28
% 9.87/3.28 Ordering : KBO
% 9.87/3.28
% 9.87/3.28 Simplification rules
% 9.87/3.28 ----------------------
% 9.87/3.28 #Subsume : 59
% 9.87/3.28 #Demod : 227
% 9.87/3.28 #Tautology : 239
% 9.87/3.28 #SimpNegUnit : 3
% 9.87/3.28 #BackRed : 32
% 9.87/3.28
% 9.87/3.28 #Partial instantiations: 0
% 9.87/3.28 #Strategies tried : 1
% 9.87/3.28
% 9.87/3.28 Timing (in seconds)
% 9.87/3.28 ----------------------
% 9.87/3.29 Preprocessing : 0.93
% 9.87/3.29 Parsing : 0.37
% 9.87/3.29 CNF conversion : 0.07
% 9.87/3.29 Main loop : 1.20
% 9.87/3.29 Inferencing : 0.28
% 9.87/3.29 Reduction : 0.45
% 9.87/3.29 Demodulation : 0.32
% 9.87/3.29 BG Simplification : 0.11
% 9.87/3.29 Subsumption : 0.30
% 9.87/3.29 Abstraction : 0.07
% 9.87/3.29 MUC search : 0.00
% 9.87/3.29 Cooper : 0.00
% 9.87/3.29 Total : 2.17
% 9.87/3.29 Index Insertion : 0.00
% 9.87/3.29 Index Deletion : 0.00
% 9.87/3.29 Index Matching : 0.00
% 9.87/3.29 BG Taut test : 0.00
%------------------------------------------------------------------------------