TSTP Solution File: SWV069+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV069+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 : n017.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:48 EDT 2023
% Result : Theorem 8.77s 3.23s
% Output : CNFRefutation 9.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 73
% Syntax : Number of formulae : 98 ( 30 unt; 62 typ; 0 def)
% Number of atoms : 48 ( 20 equ)
% Maximal formula atoms : 6 ( 1 avg)
% Number of connectives : 25 ( 13 ~; 6 |; 4 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 2 avg)
% Maximal term depth : 6 ( 2 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 : 57 ( 57 usr; 12 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 > 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(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('#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(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_504,axiom,
gt(n4,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_4_0) ).
tff(f_94,axiom,
! [X,Y] :
( gt(Y,X)
=> leq(X,Y) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
tff(f_591,axiom,
succ(succ(n0)) = n2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_2) ).
tff(f_592,axiom,
succ(succ(succ(n0))) = n3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_3) ).
tff(f_590,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_1) ).
tff(f_588,axiom,
succ(succ(succ(succ(n0)))) = n4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_4) ).
tff(f_589,axiom,
succ(succ(succ(succ(succ(n0))))) = n5,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_5) ).
tff(f_402,axiom,
! [X] : ( pred(succ(X)) = X ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
tff(f_74,axiom,
! [X] : leq(X,X),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',reflexivity_leq) ).
tff(f_400,axiom,
! [X] : ( minus(X,n1) = pred(X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
tff(f_492,negated_conjecture,
~ ( ( leq(n0,pv10)
& leq(pv10,minus(n135300,n1)) )
=> ( leq(n0,n0)
& leq(n0,pv10)
& leq(n0,minus(n5,n1))
& leq(pv10,minus(n135300,n1)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_array_0010) ).
tff(c_538,plain,
gt(n4,n0),
inference(cnfTransformation,[status(thm)],[f_504]) ).
tff(c_915,plain,
! [X_204,Y_205] :
( leq(X_204,Y_205)
| ~ gt(Y_205,X_204) ),
inference(cnfTransformation,[status(thm)],[f_94]) ).
tff(c_592,plain,
succ(succ(n0)) = n2,
inference(cnfTransformation,[status(thm)],[f_591]) ).
tff(c_594,plain,
succ(succ(succ(n0))) = n3,
inference(cnfTransformation,[status(thm)],[f_592]) ).
tff(c_595,plain,
succ(n2) = n3,
inference(demodulation,[status(thm),theory(equality)],[c_592,c_594]) ).
tff(c_590,plain,
succ(n0) = n1,
inference(cnfTransformation,[status(thm)],[f_590]) ).
tff(c_596,plain,
succ(n1) = n2,
inference(demodulation,[status(thm),theory(equality)],[c_590,c_592]) ).
tff(c_586,plain,
succ(succ(succ(succ(n0)))) = n4,
inference(cnfTransformation,[status(thm)],[f_588]) ).
tff(c_598,plain,
succ(n3) = n4,
inference(demodulation,[status(thm),theory(equality)],[c_595,c_596,c_590,c_586]) ).
tff(c_588,plain,
succ(succ(succ(succ(succ(n0))))) = n5,
inference(cnfTransformation,[status(thm)],[f_589]) ).
tff(c_597,plain,
succ(succ(n3)) = n5,
inference(demodulation,[status(thm),theory(equality)],[c_595,c_596,c_590,c_588]) ).
tff(c_599,plain,
succ(n4) = n5,
inference(demodulation,[status(thm),theory(equality)],[c_598,c_597]) ).
tff(c_680,plain,
! [X_191] : ( pred(succ(X_191)) = X_191 ),
inference(cnfTransformation,[status(thm)],[f_402]) ).
tff(c_701,plain,
pred(n5) = n4,
inference(superposition,[status(thm),theory(equality)],[c_599,c_680]) ).
tff(c_8,plain,
! [X_7] : leq(X_7,X_7),
inference(cnfTransformation,[status(thm)],[f_74]) ).
tff(c_470,plain,
! [X_140] : ( minus(X_140,n1) = pred(X_140) ),
inference(cnfTransformation,[status(thm)],[f_400]) ).
tff(c_516,plain,
leq(n0,pv10),
inference(cnfTransformation,[status(thm)],[f_492]) ).
tff(c_514,plain,
leq(pv10,minus(n135300,n1)),
inference(cnfTransformation,[status(thm)],[f_492]) ).
tff(c_512,plain,
( ~ leq(pv10,minus(n135300,n1))
| ~ leq(n0,minus(n5,n1))
| ~ leq(n0,pv10)
| ~ leq(n0,n0) ),
inference(cnfTransformation,[status(thm)],[f_492]) ).
tff(c_601,plain,
( ~ leq(n0,minus(n5,n1))
| ~ leq(n0,n0) ),
inference(demodulation,[status(thm),theory(equality)],[c_516,c_514,c_512]) ).
tff(c_603,plain,
( ~ leq(n0,pred(n5))
| ~ leq(n0,n0) ),
inference(demodulation,[status(thm),theory(equality)],[c_470,c_601]) ).
tff(c_612,plain,
~ leq(n0,pred(n5)),
inference(demodulation,[status(thm),theory(equality)],[c_8,c_603]) ).
tff(c_740,plain,
~ leq(n0,n4),
inference(demodulation,[status(thm),theory(equality)],[c_701,c_612]) ).
tff(c_918,plain,
~ gt(n4,n0),
inference(resolution,[status(thm)],[c_915,c_740]) ).
tff(c_922,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_538,c_918]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWV069+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.14/0.36 % Computer : n017.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Thu Aug 3 22:31:37 EDT 2023
% 0.14/0.36 % CPUTime :
% 8.77/3.23 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 8.77/3.23
% 8.77/3.23 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 9.14/3.27
% 9.14/3.27 Inference rules
% 9.14/3.27 ----------------------
% 9.14/3.28 #Ref : 0
% 9.14/3.28 #Sup : 92
% 9.14/3.28 #Fact : 0
% 9.14/3.28 #Define : 0
% 9.14/3.28 #Split : 0
% 9.14/3.28 #Chain : 0
% 9.14/3.28 #Close : 0
% 9.14/3.28
% 9.14/3.28 Ordering : KBO
% 9.14/3.28
% 9.14/3.28 Simplification rules
% 9.14/3.28 ----------------------
% 9.14/3.28 #Subsume : 0
% 9.14/3.28 #Demod : 53
% 9.14/3.28 #Tautology : 72
% 9.14/3.28 #SimpNegUnit : 0
% 9.14/3.28 #BackRed : 1
% 9.14/3.28
% 9.14/3.28 #Partial instantiations: 0
% 9.14/3.28 #Strategies tried : 1
% 9.14/3.28
% 9.14/3.28 Timing (in seconds)
% 9.14/3.28 ----------------------
% 9.30/3.28 Preprocessing : 1.35
% 9.30/3.28 Parsing : 0.53
% 9.30/3.28 CNF conversion : 0.11
% 9.30/3.28 Main loop : 0.67
% 9.30/3.28 Inferencing : 0.10
% 9.30/3.28 Reduction : 0.28
% 9.30/3.28 Demodulation : 0.20
% 9.30/3.28 BG Simplification : 0.17
% 9.30/3.28 Subsumption : 0.20
% 9.30/3.28 Abstraction : 0.10
% 9.30/3.28 MUC search : 0.00
% 9.30/3.28 Cooper : 0.00
% 9.30/3.28 Total : 2.08
% 9.30/3.28 Index Insertion : 0.00
% 9.30/3.28 Index Deletion : 0.00
% 9.30/3.28 Index Matching : 0.00
% 9.30/3.28 BG Taut test : 0.00
%------------------------------------------------------------------------------