TSTP Solution File: SWV164+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV164+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 : n005.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:04 EDT 2023
% Result : Theorem 10.70s 3.48s
% Output : CNFRefutation 11.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 83
% Syntax : Number of formulae : 107 ( 17 unt; 75 typ; 0 def)
% Number of atoms : 57 ( 8 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 43 ( 18 ~; 11 |; 6 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 11 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 166 ( 53 >; 113 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 70 ( 70 usr; 21 con; 0-8 aty)
% Number of variables : 31 (; 31 !; 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 > exp > x > use > true > tptp_sum_index > tptp_pi > tptp_minus_2 > tptp_minus_1 > tptp_float_0_0 > sigma > rho > q > pv10 > n5 > n4 > n3 > n2 > n135299 > n1 > n0 > mu > 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_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(tptp_minus_2,type,
tptp_minus_2: $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(rho,type,
rho: $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(mu,type,
mu: $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(sigma,type,
sigma: $i ).
tff(tptp_pi,type,
tptp_pi: $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(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(exp,type,
exp: $i > $i ).
tff(minus,type,
minus: ( $i * $i ) > $i ).
tff(f_497,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(pv10,n135299)
& ! [A] :
( ( leq(n0,A)
& leq(A,pred(pv10)) )
=> ( sum(n0,n4,a_select3(q,A,tptp_sum_index)) = n1 ) ) )
=> ! [B] :
( ( leq(n0,B)
& leq(B,tptp_minus_1) )
=> ( a_select3(q,pv10,B) = divide(divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,B)),minus(a_select2(x,pv10),a_select2(mu,B))),tptp_minus_2),times(a_select2(sigma,B),a_select2(sigma,B)))),a_select2(rho,B)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,B))),sum(n0,n4,divide(times(exp(divide(divide(times(minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index)),minus(a_select2(x,pv10),a_select2(mu,tptp_sum_index))),tptp_minus_2),times(a_select2(sigma,tptp_sum_index),a_select2(sigma,tptp_sum_index)))),a_select2(rho,tptp_sum_index)),times(sqrt(times(n2,tptp_pi)),a_select2(sigma,tptp_sum_index))))) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0014) ).
tff(f_88,axiom,
! [X,Y] :
( geq(X,Y)
<=> leq(Y,X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_geq) ).
tff(f_100,axiom,
! [X,Y] :
( ( leq(X,Y)
& ( X != Y ) )
=> gt(Y,X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt2) ).
tff(f_377,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_tptp_minus_1) ).
tff(f_115,axiom,
! [X,Y] :
( leq(X,Y)
<=> gt(succ(Y),X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_succ_gt_equiv) ).
tff(f_70,axiom,
! [X] : ~ gt(X,X),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
tff(f_412,axiom,
! [X,Y] :
( leq(succ(X),Y)
=> gt(Y,X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_succ_gt) ).
tff(f_67,axiom,
! [X,Y,Z] :
( ( gt(X,Y)
& gt(Y,Z) )
=> gt(X,Z) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',transitivity_gt) ).
tff(c_516,plain,
leq(n0,'#skF_28'),
inference(cnfTransformation,[status(thm)],[f_497]) ).
tff(c_950,plain,
! [X_205,Y_206] :
( geq(X_205,Y_206)
| ~ leq(Y_206,X_205) ),
inference(cnfTransformation,[status(thm)],[f_88]) ).
tff(c_970,plain,
geq('#skF_28',n0),
inference(resolution,[status(thm)],[c_516,c_950]) ).
tff(c_514,plain,
leq('#skF_28',tptp_minus_1),
inference(cnfTransformation,[status(thm)],[f_497]) ).
tff(c_3331,plain,
! [Y_268,X_269] :
( gt(Y_268,X_269)
| ( Y_268 = X_269 )
| ~ leq(X_269,Y_268) ),
inference(cnfTransformation,[status(thm)],[f_100]) ).
tff(c_3392,plain,
( gt(tptp_minus_1,'#skF_28')
| ( tptp_minus_1 = '#skF_28' ) ),
inference(resolution,[status(thm)],[c_514,c_3331]) ).
tff(c_3542,plain,
tptp_minus_1 = '#skF_28',
inference(splitLeft,[status(thm)],[c_3392]) ).
tff(c_16,plain,
! [Y_14,X_13] :
( leq(Y_14,X_13)
| ~ geq(X_13,Y_14) ),
inference(cnfTransformation,[status(thm)],[f_88]) ).
tff(c_448,plain,
succ(tptp_minus_1) = n0,
inference(cnfTransformation,[status(thm)],[f_377]) ).
tff(c_2395,plain,
! [Y_244,X_245] :
( gt(succ(Y_244),X_245)
| ~ leq(X_245,Y_244) ),
inference(cnfTransformation,[status(thm)],[f_115]) ).
tff(c_6,plain,
! [X_6] : ~ gt(X_6,X_6),
inference(cnfTransformation,[status(thm)],[f_70]) ).
tff(c_2448,plain,
! [Y_246] : ~ leq(succ(Y_246),Y_246),
inference(resolution,[status(thm)],[c_2395,c_6]) ).
tff(c_2496,plain,
~ leq(n0,tptp_minus_1),
inference(superposition,[status(thm),theory(equality)],[c_448,c_2448]) ).
tff(c_2529,plain,
~ geq(tptp_minus_1,n0),
inference(resolution,[status(thm)],[c_16,c_2496]) ).
tff(c_3550,plain,
~ geq('#skF_28',n0),
inference(demodulation,[status(thm),theory(equality)],[c_3542,c_2529]) ).
tff(c_3582,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_970,c_3550]) ).
tff(c_3583,plain,
gt(tptp_minus_1,'#skF_28'),
inference(splitRight,[status(thm)],[c_3392]) ).
tff(c_1087,plain,
! [Y_213,X_214] :
( gt(Y_213,X_214)
| ~ leq(succ(X_214),Y_213) ),
inference(cnfTransformation,[status(thm)],[f_412]) ).
tff(c_1198,plain,
! [Y_216] :
( gt(Y_216,tptp_minus_1)
| ~ leq(n0,Y_216) ),
inference(superposition,[status(thm),theory(equality)],[c_448,c_1087]) ).
tff(c_1219,plain,
gt('#skF_28',tptp_minus_1),
inference(resolution,[status(thm)],[c_516,c_1198]) ).
tff(c_4085,plain,
! [X_280,Z_281,Y_282] :
( gt(X_280,Z_281)
| ~ gt(Y_282,Z_281)
| ~ gt(X_280,Y_282) ),
inference(cnfTransformation,[status(thm)],[f_67]) ).
tff(c_4326,plain,
! [X_284] :
( gt(X_284,tptp_minus_1)
| ~ gt(X_284,'#skF_28') ),
inference(resolution,[status(thm)],[c_1219,c_4085]) ).
tff(c_4343,plain,
~ gt(tptp_minus_1,'#skF_28'),
inference(resolution,[status(thm)],[c_4326,c_6]) ).
tff(c_4351,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_3583,c_4343]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV164+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/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 : n005.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:09:57 EDT 2023
% 0.14/0.36 % CPUTime :
% 10.70/3.48 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.09/3.48
% 11.09/3.48 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 11.12/3.51
% 11.12/3.51 Inference rules
% 11.12/3.51 ----------------------
% 11.12/3.51 #Ref : 0
% 11.12/3.51 #Sup : 950
% 11.12/3.51 #Fact : 2
% 11.12/3.51 #Define : 0
% 11.12/3.51 #Split : 4
% 11.12/3.51 #Chain : 0
% 11.12/3.51 #Close : 0
% 11.12/3.51
% 11.12/3.51 Ordering : KBO
% 11.12/3.51
% 11.12/3.51 Simplification rules
% 11.12/3.51 ----------------------
% 11.12/3.51 #Subsume : 92
% 11.12/3.51 #Demod : 499
% 11.12/3.51 #Tautology : 326
% 11.12/3.51 #SimpNegUnit : 6
% 11.12/3.51 #BackRed : 105
% 11.12/3.51
% 11.12/3.51 #Partial instantiations: 0
% 11.12/3.51 #Strategies tried : 1
% 11.12/3.51
% 11.12/3.51 Timing (in seconds)
% 11.12/3.51 ----------------------
% 11.12/3.51 Preprocessing : 1.01
% 11.12/3.51 Parsing : 0.38
% 11.12/3.51 CNF conversion : 0.08
% 11.12/3.51 Main loop : 1.43
% 11.12/3.51 Inferencing : 0.33
% 11.12/3.51 Reduction : 0.58
% 11.12/3.51 Demodulation : 0.42
% 11.12/3.51 BG Simplification : 0.13
% 11.12/3.51 Subsumption : 0.32
% 11.12/3.51 Abstraction : 0.07
% 11.12/3.51 MUC search : 0.00
% 11.12/3.51 Cooper : 0.00
% 11.12/3.51 Total : 2.49
% 11.12/3.51 Index Insertion : 0.00
% 11.12/3.51 Index Deletion : 0.00
% 11.12/3.51 Index Matching : 0.00
% 11.12/3.51 BG Taut test : 0.00
%------------------------------------------------------------------------------