TSTP Solution File: SWV155+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV155+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 : n008.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:02 EDT 2023
% Result : Theorem 7.56s 2.63s
% Output : CNFRefutation 7.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 73
% Syntax : Number of formulae : 80 ( 5 unt; 72 typ; 0 def)
% Number of atoms : 25 ( 9 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 23 ( 6 ~; 3 |; 9 &)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 3 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 165 ( 52 >; 113 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 67 ( 67 usr; 19 con; 0-8 aty)
% Number of variables : 4 (; 4 !; 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 > times > plus > minus > divide > dim > a_select2 > #nlpp > trans > succ > sqrt > pred > inv > x > use > true > tptp_sum_index > tptp_minus_1 > tptp_float_0_0 > q > pv70 > pv12 > pv10 > n5 > n4 > n3 > n2 > n135299 > n1 > n0 > def > center > #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(times,type,
times: ( $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(n135299,type,
n135299: $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(divide,type,
divide: ( $i * $i ) > $i ).
tff('#skF_19',type,
'#skF_19': ( $i * $i * $i * $i * $i * $i * $i * $i ) > $i ).
tff(x,type,
x: $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(pv10,type,
pv10: $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(sqrt,type,
sqrt: $i > $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(tptp_sum_index,type,
tptp_sum_index: $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(q,type,
q: $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(pv70,type,
pv70: $i ).
tff(def,type,
def: $i ).
tff(pv12,type,
pv12: $i ).
tff(center,type,
center: $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_513,negated_conjecture,
~ ( ( ( pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) )
& leq(n0,pv10)
& leq(n0,pv12)
& leq(pv10,n135299)
& leq(pv12,n4)
& ! [A] :
( ( leq(n0,A)
& leq(A,pred(pv12)) )
=> ( a_select3(q,pv10,A) = divide(sqrt(times(minus(a_select3(center,A,n0),a_select2(x,pv10)),minus(a_select3(center,A,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ) )
& ! [B] :
( ( leq(n0,B)
& leq(B,pred(pv10)) )
=> ( sum(n0,n4,a_select3(q,B,tptp_sum_index)) = n1 ) ) )
=> ! [C] :
( ( leq(n0,C)
& leq(C,pred(pv10)) )
=> ( ( pv10 != C )
=> ( sum(n0,n4,a_select3(q,C,tptp_sum_index)) = n1 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0005) ).
tff(c_512,plain,
sum(n0,n4,a_select3(q,'#skF_28',tptp_sum_index)) != n1,
inference(cnfTransformation,[status(thm)],[f_513]) ).
tff(c_518,plain,
leq(n0,'#skF_28'),
inference(cnfTransformation,[status(thm)],[f_513]) ).
tff(c_516,plain,
leq('#skF_28',pred(pv10)),
inference(cnfTransformation,[status(thm)],[f_513]) ).
tff(c_819,plain,
! [B_197] :
( ( sum(n0,n4,a_select3(q,B_197,tptp_sum_index)) = n1 )
| ~ leq(B_197,pred(pv10))
| ~ leq(n0,B_197) ),
inference(cnfTransformation,[status(thm)],[f_513]) ).
tff(c_822,plain,
( ( sum(n0,n4,a_select3(q,'#skF_28',tptp_sum_index)) = n1 )
| ~ leq(n0,'#skF_28') ),
inference(resolution,[status(thm)],[c_516,c_819]) ).
tff(c_829,plain,
sum(n0,n4,a_select3(q,'#skF_28',tptp_sum_index)) = n1,
inference(demodulation,[status(thm),theory(equality)],[c_518,c_822]) ).
tff(c_831,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_512,c_829]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV155+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.13 % 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.34 % Computer : n008.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Thu Aug 3 23:11:03 EDT 2023
% 0.13/0.34 % CPUTime :
% 7.56/2.63 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.56/2.64
% 7.56/2.64 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.65/2.67
% 7.65/2.67 Inference rules
% 7.65/2.67 ----------------------
% 7.65/2.67 #Ref : 0
% 7.65/2.67 #Sup : 64
% 7.65/2.67 #Fact : 0
% 7.65/2.67 #Define : 0
% 7.65/2.67 #Split : 0
% 7.65/2.67 #Chain : 0
% 7.65/2.67 #Close : 0
% 7.65/2.67
% 7.65/2.67 Ordering : KBO
% 7.65/2.67
% 7.65/2.67 Simplification rules
% 7.65/2.67 ----------------------
% 7.65/2.67 #Subsume : 0
% 7.65/2.67 #Demod : 37
% 7.65/2.67 #Tautology : 55
% 7.65/2.67 #SimpNegUnit : 1
% 7.65/2.67 #BackRed : 0
% 7.65/2.67
% 7.65/2.67 #Partial instantiations: 0
% 7.65/2.67 #Strategies tried : 1
% 7.65/2.67
% 7.65/2.67 Timing (in seconds)
% 7.65/2.67 ----------------------
% 7.65/2.67 Preprocessing : 0.90
% 7.65/2.67 Parsing : 0.35
% 7.65/2.67 CNF conversion : 0.07
% 7.65/2.67 Main loop : 0.71
% 7.65/2.67 Inferencing : 0.11
% 7.65/2.67 Reduction : 0.31
% 7.65/2.67 Demodulation : 0.22
% 7.65/2.67 BG Simplification : 0.10
% 7.65/2.67 Subsumption : 0.20
% 7.65/2.67 Abstraction : 0.06
% 7.65/2.67 MUC search : 0.00
% 7.65/2.67 Cooper : 0.00
% 7.65/2.67 Total : 1.67
% 7.65/2.67 Index Insertion : 0.00
% 7.65/2.67 Index Deletion : 0.00
% 7.65/2.67 Index Matching : 0.00
% 7.65/2.67 BG Taut test : 0.00
%------------------------------------------------------------------------------