TSTP Solution File: SWV184+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV184+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 : 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 11:03:07 EDT 2023
% Result : Theorem 8.90s 3.10s
% Output : CNFRefutation 9.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 71
% Syntax : Number of formulae : 80 ( 6 unt; 70 typ; 0 def)
% Number of atoms : 42 ( 12 equ)
% Maximal formula atoms : 27 ( 4 avg)
% Number of connectives : 40 ( 8 ~; 6 |; 14 &)
% ( 0 <=>; 12 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 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 : 65 ( 65 usr; 20 con; 0-8 aty)
% Number of variables : 10 (; 10 !; 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 > sigmaold_init > rhoold_init > rho_init > q_init > n5 > n4 > n3 > n2 > n135299 > n1 > n0 > muold_init > loopcounter > init > def > center_init > #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_28 > #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(center_init,type,
center_init: $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(n135299,type,
n135299: $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(rho_init,type,
rho_init: $i ).
tff('#skF_19',type,
'#skF_19': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff(sigmaold_init,type,
sigmaold_init: $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(rhoold_init,type,
rhoold_init: $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(q_init,type,
q_init: $i ).
tff(n0,type,
n0: $i ).
tff('#skF_11',type,
'#skF_11': ( $i * $i * $i ) > $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(muold_init,type,
muold_init: $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(init,type,
init: $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('#skF_28',type,
'#skF_28': $i ).
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(n2,type,
n2: $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_542,negated_conjecture,
~ ( ( gt(loopcounter,n1)
& ! [A] :
( ( leq(n0,A)
& leq(A,n135299) )
=> ! [B] :
( ( leq(n0,B)
& leq(B,n4) )
=> ( a_select3(q_init,A,B) = init ) ) )
& ! [C] :
( ( leq(n0,C)
& leq(C,n4) )
=> ( a_select2(rho_init,C) = init ) )
& ! [D] :
( ( leq(n0,D)
& leq(D,n4) )
=> ( a_select3(center_init,D,n0) = init ) )
& ( gt(loopcounter,n1)
=> ! [E] :
( ( leq(n0,E)
& leq(E,n4) )
=> ( a_select2(muold_init,E) = init ) ) )
& ( gt(loopcounter,n1)
=> ! [F] :
( ( leq(n0,F)
& leq(F,n4) )
=> ( a_select2(rhoold_init,F) = init ) ) )
& ( gt(loopcounter,n1)
=> ! [G] :
( ( leq(n0,G)
& leq(G,n4) )
=> ( a_select2(sigmaold_init,G) = init ) ) ) )
=> ! [H] :
( ( leq(n0,H)
& leq(H,n4) )
=> ( a_select2(sigmaold_init,H) = init ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0096) ).
tff(c_512,plain,
a_select2(sigmaold_init,'#skF_28') != init,
inference(cnfTransformation,[status(thm)],[f_542]) ).
tff(c_516,plain,
leq(n0,'#skF_28'),
inference(cnfTransformation,[status(thm)],[f_542]) ).
tff(c_514,plain,
leq('#skF_28',n4),
inference(cnfTransformation,[status(thm)],[f_542]) ).
tff(c_530,plain,
gt(loopcounter,n1),
inference(cnfTransformation,[status(thm)],[f_542]) ).
tff(c_518,plain,
! [G_188] :
( ( a_select2(sigmaold_init,G_188) = init )
| ~ leq(G_188,n4)
| ~ leq(n0,G_188)
| ~ gt(loopcounter,n1) ),
inference(cnfTransformation,[status(thm)],[f_542]) ).
tff(c_1839,plain,
! [G_237] :
( ( a_select2(sigmaold_init,G_237) = init )
| ~ leq(G_237,n4)
| ~ leq(n0,G_237) ),
inference(demodulation,[status(thm),theory(equality)],[c_530,c_518]) ).
tff(c_1852,plain,
( ( a_select2(sigmaold_init,'#skF_28') = init )
| ~ leq(n0,'#skF_28') ),
inference(resolution,[status(thm)],[c_514,c_1839]) ).
tff(c_1863,plain,
a_select2(sigmaold_init,'#skF_28') = init,
inference(demodulation,[status(thm),theory(equality)],[c_516,c_1852]) ).
tff(c_1865,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_512,c_1863]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.13 % Problem : SWV184+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.06/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.13/0.35 % Computer : n003.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 22:54:54 EDT 2023
% 0.13/0.35 % CPUTime :
% 8.90/3.10 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 9.20/3.11
% 9.20/3.11 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 9.20/3.13
% 9.20/3.13 Inference rules
% 9.20/3.13 ----------------------
% 9.20/3.13 #Ref : 0
% 9.20/3.13 #Sup : 336
% 9.20/3.13 #Fact : 0
% 9.20/3.13 #Define : 0
% 9.20/3.13 #Split : 1
% 9.20/3.13 #Chain : 0
% 9.20/3.13 #Close : 0
% 9.20/3.13
% 9.20/3.13 Ordering : KBO
% 9.20/3.13
% 9.20/3.13 Simplification rules
% 9.20/3.13 ----------------------
% 9.20/3.13 #Subsume : 1
% 9.20/3.13 #Demod : 201
% 9.20/3.13 #Tautology : 185
% 9.20/3.13 #SimpNegUnit : 1
% 9.20/3.13 #BackRed : 0
% 9.20/3.13
% 9.20/3.13 #Partial instantiations: 0
% 9.20/3.13 #Strategies tried : 1
% 9.20/3.13
% 9.20/3.13 Timing (in seconds)
% 9.20/3.13 ----------------------
% 9.20/3.14 Preprocessing : 1.07
% 9.20/3.14 Parsing : 0.41
% 9.20/3.14 CNF conversion : 0.09
% 9.20/3.14 Main loop : 0.97
% 9.20/3.14 Inferencing : 0.19
% 9.20/3.14 Reduction : 0.40
% 9.20/3.14 Demodulation : 0.28
% 9.20/3.14 BG Simplification : 0.12
% 9.20/3.14 Subsumption : 0.26
% 9.20/3.14 Abstraction : 0.09
% 9.20/3.14 MUC search : 0.00
% 9.20/3.14 Cooper : 0.00
% 9.20/3.14 Total : 2.08
% 9.20/3.14 Index Insertion : 0.00
% 9.20/3.14 Index Deletion : 0.00
% 9.20/3.14 Index Matching : 0.00
% 9.20/3.14 BG Taut test : 0.00
%------------------------------------------------------------------------------