TSTP Solution File: SWV139+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV139+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 : n016.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 8.62s 3.10s
% Output : CNFRefutation 8.62s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 69
% Syntax : Number of formulae : 78 ( 7 unt; 66 typ; 0 def)
% Number of atoms : 42 ( 2 equ)
% Maximal formula atoms : 27 ( 3 avg)
% Number of connectives : 42 ( 12 ~; 3 |; 13 &)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 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 : 7 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 61 ( 61 usr; 16 con; 0-8 aty)
% Number of variables : 5 (; 5 !; 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_001 > tptp_float_0_0 > s_worst7 > s_sworst7 > s_best7 > pv1341 > n5 > n4 > n3 > n2 > n1 > n0 > loopcounter > 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(loopcounter,type,
loopcounter: $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(tptp_float_0_001,type,
tptp_float_0_001: $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(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('#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(pv1341,type,
pv1341: $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_540,negated_conjecture,
~ ( ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(n0,s_best7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0009) ).
tff(f_631,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_1) ).
tff(f_413,axiom,
! [X,Y] :
( leq(succ(X),Y)
=> gt(Y,X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_succ_gt) ).
tff(c_512,plain,
~ leq(n0,s_best7),
inference(cnfTransformation,[status(thm)],[f_540]) ).
tff(c_524,plain,
( leq(n0,s_best7)
| ~ gt(loopcounter,n0) ),
inference(cnfTransformation,[status(thm)],[f_540]) ).
tff(c_616,plain,
~ gt(loopcounter,n0),
inference(negUnitSimplification,[status(thm)],[c_512,c_524]) ).
tff(c_538,plain,
leq(n1,loopcounter),
inference(cnfTransformation,[status(thm)],[f_540]) ).
tff(c_600,plain,
succ(n0) = n1,
inference(cnfTransformation,[status(thm)],[f_631]) ).
tff(c_1420,plain,
! [Y_220,X_221] :
( gt(Y_220,X_221)
| ~ leq(succ(X_221),Y_220) ),
inference(cnfTransformation,[status(thm)],[f_413]) ).
tff(c_3211,plain,
! [Y_273] :
( gt(Y_273,n0)
| ~ leq(n1,Y_273) ),
inference(superposition,[status(thm),theory(equality)],[c_600,c_1420]) ).
tff(c_3234,plain,
gt(loopcounter,n0),
inference(resolution,[status(thm)],[c_538,c_3211]) ).
tff(c_3244,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_616,c_3234]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWV139+1 : TPTP v8.1.2. Bugfixed v3.3.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.16/0.36 % Computer : n016.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Thu Aug 3 23:34:38 EDT 2023
% 0.16/0.36 % CPUTime :
% 8.62/3.10 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.62/3.11
% 8.62/3.11 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 8.62/3.13
% 8.62/3.13 Inference rules
% 8.62/3.13 ----------------------
% 8.62/3.13 #Ref : 0
% 8.62/3.13 #Sup : 718
% 8.62/3.13 #Fact : 2
% 8.62/3.13 #Define : 0
% 8.62/3.13 #Split : 4
% 8.62/3.13 #Chain : 0
% 8.62/3.13 #Close : 0
% 8.62/3.13
% 8.62/3.13 Ordering : KBO
% 8.62/3.13
% 8.62/3.13 Simplification rules
% 8.62/3.13 ----------------------
% 8.62/3.13 #Subsume : 89
% 8.62/3.13 #Demod : 227
% 8.62/3.13 #Tautology : 235
% 8.62/3.13 #SimpNegUnit : 6
% 8.62/3.13 #BackRed : 37
% 8.62/3.13
% 8.62/3.13 #Partial instantiations: 0
% 8.62/3.13 #Strategies tried : 1
% 8.62/3.13
% 8.62/3.13 Timing (in seconds)
% 8.62/3.13 ----------------------
% 8.62/3.14 Preprocessing : 0.91
% 8.62/3.14 Parsing : 0.36
% 8.62/3.14 CNF conversion : 0.07
% 8.62/3.14 Main loop : 1.17
% 8.62/3.14 Inferencing : 0.26
% 8.62/3.14 Reduction : 0.51
% 8.62/3.14 Demodulation : 0.38
% 8.62/3.14 BG Simplification : 0.11
% 8.62/3.14 Subsumption : 0.25
% 8.62/3.14 Abstraction : 0.07
% 8.62/3.14 MUC search : 0.00
% 8.62/3.14 Cooper : 0.00
% 8.62/3.14 Total : 2.13
% 8.62/3.14 Index Insertion : 0.00
% 8.62/3.14 Index Deletion : 0.00
% 8.62/3.14 Index Matching : 0.00
% 8.62/3.14 BG Taut test : 0.00
%------------------------------------------------------------------------------