TSTP Solution File: SWV067+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV067+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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% Computer : n020.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:47 EDT 2023
% Result : Theorem 9.41s 3.15s
% Output : CNFRefutation 9.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 75
% Syntax : Number of formulae : 118 ( 29 unt; 65 typ; 0 def)
% Number of atoms : 98 ( 10 equ)
% Maximal formula atoms : 14 ( 1 avg)
% Number of connectives : 79 ( 34 ~; 25 |; 12 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 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 : 60 ( 60 usr; 15 con; 0-8 aty)
% Number of variables : 43 (; 43 !; 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 > q > pv78 > pv63 > pv10 > n5 > n4 > n3 > n2 > n135300 > 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(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(pv63,type,
pv63: $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(pv78,type,
pv78: $i ).
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(n135300,type,
n135300: $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(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_74,axiom,
! [X] : leq(X,X),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',reflexivity_leq) ).
tff(f_89,axiom,
! [X,Y] :
( geq(X,Y)
<=> leq(Y,X) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_geq) ).
tff(f_94,axiom,
! [X,Y] :
( gt(Y,X)
=> leq(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
tff(f_607,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',successor_1) ).
tff(f_116,axiom,
! [X,Y] :
( leq(X,Y)
<=> gt(succ(Y),X) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_succ_gt_equiv) ).
tff(f_71,axiom,
! [X] : ~ gt(X,X),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
tff(f_62,axiom,
! [X,Y] :
( gt(X,Y)
| gt(Y,X)
| ( X = Y ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',totality) ).
tff(f_509,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(n1,pv63)
& leq(pv10,minus(n135300,n1))
& leq(pv63,minus(n5,n1)) )
=> ( leq(n0,pv10)
& leq(n0,pv63)
& leq(pv10,minus(n135300,n1))
& leq(pv63,minus(n5,n1))
& ( ~ gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) ) )
& ( gt(a_select3(q,pv10,pv63),pv78)
=> ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_array_0008) ).
tff(f_101,axiom,
! [X,Y] :
( ( leq(X,Y)
& ( X != Y ) )
=> gt(Y,X) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt2) ).
tff(f_68,axiom,
! [X,Y,Z] :
( ( gt(X,Y)
& gt(Y,Z) )
=> gt(X,Z) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',transitivity_gt) ).
tff(c_8,plain,
! [X_7] : leq(X_7,X_7),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_992,plain,
! [X_201,Y_202] :
( geq(X_201,Y_202)
| ~ leq(Y_202,X_201) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_1010,plain,
! [X_7] : geq(X_7,X_7),
inference(resolution,[status(thm)],[c_8,c_992]) ).
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_600,plain,
succ(n0) = n1,
inference(cnfTransformation,[status(thm)],[f_607]) ).
tff(c_1504,plain,
! [Y_226,X_227] :
( gt(succ(Y_226),X_227)
| ~ leq(X_227,Y_226) ),
inference(cnfTransformation,[status(thm)],[f_116]) ).
tff(c_6,plain,
! [X_6] : ~ gt(X_6,X_6),
inference(cnfTransformation,[status(thm)],[f_71]) ).
tff(c_1547,plain,
! [Y_228] : ~ leq(succ(Y_228),Y_228),
inference(resolution,[status(thm)],[c_1504,c_6]) ).
tff(c_1581,plain,
~ leq(n1,n0),
inference(superposition,[status(thm),theory(equality)],[c_600,c_1547]) ).
tff(c_1662,plain,
~ gt(n0,n1),
inference(resolution,[status(thm)],[c_20,c_1581]) ).
tff(c_1832,plain,
! [Y_233,X_234] :
( ( Y_233 = X_234 )
| gt(Y_233,X_234)
| gt(X_234,Y_233) ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_1052,plain,
! [X_208,Y_209] :
( leq(X_208,Y_209)
| ~ gt(Y_209,X_208) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_512,plain,
leq(pv63,minus(n5,n1)),
inference(cnfTransformation,[status(thm)],[f_509]) ).
tff(c_514,plain,
leq(pv10,minus(n135300,n1)),
inference(cnfTransformation,[status(thm)],[f_509]) ).
tff(c_518,plain,
leq(n0,pv10),
inference(cnfTransformation,[status(thm)],[f_509]) ).
tff(c_520,plain,
( ~ leq(pv63,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv63)
| ~ leq(n0,pv10) ),
inference(cnfTransformation,[status(thm)],[f_509]) ).
tff(c_611,plain,
( ~ leq(pv63,minus(n5,n1))
| ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,pv63) ),
inference(demodulation,[status(thm),theory(equality)],[c_518,c_520]) ).
tff(c_613,plain,
( ~ leq(pv63,minus(n5,n1))
| ~ leq(n0,pv63) ),
inference(demodulation,[status(thm),theory(equality)],[c_514,c_611]) ).
tff(c_615,plain,
~ leq(n0,pv63),
inference(demodulation,[status(thm),theory(equality)],[c_512,c_613]) ).
tff(c_1060,plain,
~ gt(pv63,n0),
inference(resolution,[status(thm)],[c_1052,c_615]) ).
tff(c_1866,plain,
( ( pv63 = n0 )
| gt(n0,pv63) ),
inference(resolution,[status(thm)],[c_1832,c_1060]) ).
tff(c_1995,plain,
gt(n0,pv63),
inference(splitLeft,[status(thm)],[c_1866]) ).
tff(c_16,plain,
! [Y_14,X_13] :
( leq(Y_14,X_13)
| ~ geq(X_13,Y_14) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_1663,plain,
~ geq(n0,n1),
inference(resolution,[status(thm)],[c_16,c_1581]) ).
tff(c_516,plain,
leq(n1,pv63),
inference(cnfTransformation,[status(thm)],[f_509]) ).
tff(c_2408,plain,
! [Y_246,X_247] :
( gt(Y_246,X_247)
| ( Y_246 = X_247 )
| ~ leq(X_247,Y_246) ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_2447,plain,
( gt(pv63,n1)
| ( pv63 = n1 ) ),
inference(resolution,[status(thm)],[c_516,c_2408]) ).
tff(c_2767,plain,
pv63 = n1,
inference(splitLeft,[status(thm)],[c_2447]) ).
tff(c_18,plain,
! [X_13,Y_14] :
( geq(X_13,Y_14)
| ~ leq(Y_14,X_13) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_1059,plain,
! [Y_209,X_208] :
( geq(Y_209,X_208)
| ~ gt(Y_209,X_208) ),
inference(resolution,[status(thm)],[c_1052,c_18]) ).
tff(c_1999,plain,
geq(n0,pv63),
inference(resolution,[status(thm)],[c_1995,c_1059]) ).
tff(c_2768,plain,
geq(n0,n1),
inference(demodulation,[status(thm),theory(equality)],[c_2767,c_1999]) ).
tff(c_2778,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1663,c_2768]) ).
tff(c_2779,plain,
gt(pv63,n1),
inference(splitRight,[status(thm)],[c_2447]) ).
tff(c_3048,plain,
! [X_258,Z_259,Y_260] :
( gt(X_258,Z_259)
| ~ gt(Y_260,Z_259)
| ~ gt(X_258,Y_260) ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_3224,plain,
! [X_263] :
( gt(X_263,n1)
| ~ gt(X_263,pv63) ),
inference(resolution,[status(thm)],[c_2779,c_3048]) ).
tff(c_3230,plain,
gt(n0,n1),
inference(resolution,[status(thm)],[c_1995,c_3224]) ).
tff(c_3252,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_1662,c_3230]) ).
tff(c_3253,plain,
pv63 = n0,
inference(splitRight,[status(thm)],[c_1866]) ).
tff(c_1026,plain,
! [Y_204,X_205] :
( leq(Y_204,X_205)
| ~ geq(X_205,Y_204) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_1034,plain,
~ geq(pv63,n0),
inference(resolution,[status(thm)],[c_1026,c_615]) ).
tff(c_3256,plain,
~ geq(n0,n0),
inference(demodulation,[status(thm),theory(equality)],[c_3253,c_1034]) ).
tff(c_3264,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1010,c_3256]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWV067+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/sandbox/solver/bin/beagle.jar -auto -q -proof -print tff -smtsolver /export/starexec/sandbox/solver/bin/cvc4-1.4-x86_64-linux-opt -liasolver cooper -t %d %s
% 0.15/0.36 % Computer : n020.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Thu Aug 3 22:35:07 EDT 2023
% 0.15/0.37 % CPUTime :
% 9.41/3.15 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 9.41/3.16
% 9.41/3.16 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 9.56/3.19
% 9.56/3.19 Inference rules
% 9.56/3.19 ----------------------
% 9.56/3.19 #Ref : 0
% 9.56/3.19 #Sup : 715
% 9.56/3.19 #Fact : 2
% 9.56/3.19 #Define : 0
% 9.56/3.19 #Split : 5
% 9.56/3.19 #Chain : 0
% 9.56/3.19 #Close : 0
% 9.56/3.19
% 9.56/3.19 Ordering : KBO
% 9.56/3.19
% 9.56/3.19 Simplification rules
% 9.56/3.19 ----------------------
% 9.56/3.19 #Subsume : 60
% 9.56/3.19 #Demod : 257
% 9.56/3.19 #Tautology : 244
% 9.56/3.19 #SimpNegUnit : 7
% 9.56/3.19 #BackRed : 51
% 9.56/3.19
% 9.56/3.19 #Partial instantiations: 0
% 9.56/3.19 #Strategies tried : 1
% 9.56/3.19
% 9.56/3.19 Timing (in seconds)
% 9.56/3.19 ----------------------
% 9.56/3.19 Preprocessing : 0.91
% 9.56/3.19 Parsing : 0.36
% 9.56/3.19 CNF conversion : 0.07
% 9.56/3.19 Main loop : 1.20
% 9.56/3.19 Inferencing : 0.27
% 9.56/3.19 Reduction : 0.48
% 9.56/3.19 Demodulation : 0.34
% 9.56/3.19 BG Simplification : 0.11
% 9.56/3.19 Subsumption : 0.29
% 9.56/3.19 Abstraction : 0.07
% 9.56/3.19 MUC search : 0.00
% 9.56/3.19 Cooper : 0.00
% 9.56/3.19 Total : 2.17
% 9.56/3.19 Index Insertion : 0.00
% 9.56/3.19 Index Deletion : 0.00
% 9.56/3.19 Index Matching : 0.00
% 9.56/3.19 BG Taut test : 0.00
%------------------------------------------------------------------------------