TSTP Solution File: SWV046+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV046+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 : n002.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:44 EDT 2023
% Result : Theorem 7.06s 2.62s
% Output : CNFRefutation 7.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 80
% Syntax : Number of formulae : 99 ( 21 unt; 73 typ; 0 def)
% Number of atoms : 46 ( 27 equ)
% Maximal formula atoms : 11 ( 1 avg)
% Number of connectives : 40 ( 20 ~; 10 |; 7 &)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 164 ( 51 >; 113 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 68 ( 68 usr; 21 con; 0-8 aty)
% Number of variables : 12 (; 12 !; 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 > pred > inv > x > use > true > tptp_minus_1 > tptp_float_0_0 > q > pv83 > pv81 > pv80 > pv79 > pv78 > pv44 > pv35 > n5 > n4 > n3 > n2 > n135300 > 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_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('#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(pv81,type,
pv81: $i ).
tff('#skF_27',type,
'#skF_27': ( $i * $i * $i * $i ) > $i ).
tff(pv35,type,
pv35: $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('#skF_26',type,
'#skF_26': ( $i * $i * $i * $i * $i * $i ) > $i ).
tff(use,type,
use: $i ).
tff(inv,type,
inv: $i > $i ).
tff(pv83,type,
pv83: $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(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(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(pv44,type,
pv44: $i ).
tff(pv79,type,
pv79: $i ).
tff(q,type,
q: $i ).
tff(pv80,type,
pv80: $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_372,axiom,
! [Body] : ( sum(n0,tptp_minus_1,Body) = n0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',sum_plus_base) ).
tff(f_377,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_tptp_minus_1) ).
tff(f_401,axiom,
! [X] : ( pred(succ(X)) = X ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
tff(f_399,axiom,
! [X] : ( minus(X,n1) = pred(X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
tff(f_452,axiom,
! [X,U,VAL] : ( a_select2(tptp_update2(X,U,VAL),U) = VAL ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',sel2_update_1) ).
tff(f_474,axiom,
true,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',ttrue) ).
tff(f_502,negated_conjecture,
~ ( ( ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) )
& ( pv80 = sum(n0,minus(n135300,n1),times(a_select3(q,pv81,pv35),a_select2(x,pv81))) )
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) )
=> ( ( ( n0 != pv44 )
=> ( ( n0 = sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) )
& ( pv78 = sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) )
& leq(n0,pv35)
& leq(pv35,minus(n5,n1)) ) )
& ( ( n0 = pv44 )
=> true ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0010) ).
tff(c_444,plain,
! [Body_128] : ( sum(n0,tptp_minus_1,Body_128) = n0 ),
inference(cnfTransformation,[status(thm)],[f_372]) ).
tff(c_448,plain,
succ(tptp_minus_1) = n0,
inference(cnfTransformation,[status(thm)],[f_377]) ).
tff(c_714,plain,
! [X_191] : ( pred(succ(X_191)) = X_191 ),
inference(cnfTransformation,[status(thm)],[f_401]) ).
tff(c_738,plain,
pred(n0) = tptp_minus_1,
inference(superposition,[status(thm),theory(equality)],[c_448,c_714]) ).
tff(c_470,plain,
! [X_140] : ( minus(X_140,n1) = pred(X_140) ),
inference(cnfTransformation,[status(thm)],[f_399]) ).
tff(c_498,plain,
! [X_168,U_169,VAL_170] : ( a_select2(tptp_update2(X_168,U_169,VAL_170),U_169) = VAL_170 ),
inference(cnfTransformation,[status(thm)],[f_452]) ).
tff(c_508,plain,
true,
inference(cnfTransformation,[status(thm)],[f_474]) ).
tff(c_512,plain,
leq(pv35,minus(n5,n1)),
inference(cnfTransformation,[status(thm)],[f_502]) ).
tff(c_514,plain,
leq(n0,pv35),
inference(cnfTransformation,[status(thm)],[f_502]) ).
tff(c_518,plain,
sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) = pv78,
inference(cnfTransformation,[status(thm)],[f_502]) ).
tff(c_520,plain,
( ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| ( sum(n0,minus(n135300,n1),a_select3(q,pv79,pv35)) != pv78 )
| ( sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) != n0 )
| ~ true ),
inference(cnfTransformation,[status(thm)],[f_502]) ).
tff(c_613,plain,
( ~ leq(pv35,minus(n5,n1))
| ~ leq(n0,pv35)
| ( sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) != n0 )
| ~ true ),
inference(demodulation,[status(thm),theory(equality)],[c_518,c_520]) ).
tff(c_617,plain,
( ~ leq(pv35,minus(n5,n1))
| ( sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) != n0 )
| ~ true ),
inference(demodulation,[status(thm),theory(equality)],[c_514,c_613]) ).
tff(c_621,plain,
( ( sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) != n0 )
| ~ true ),
inference(demodulation,[status(thm),theory(equality)],[c_512,c_617]) ).
tff(c_625,plain,
sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),times(minus(a_select2(x,pv83),a_select2(tptp_update2(mu,pv35,divide(pv80,pv44)),pv35)),a_select3(q,pv83,pv35)))) != n0,
inference(demodulation,[status(thm),theory(equality)],[c_508,c_621]) ).
tff(c_627,plain,
sum(n0,minus(n0,n1),times(minus(a_select2(x,pv83),divide(pv80,pv44)),times(minus(a_select2(x,pv83),divide(pv80,pv44)),a_select3(q,pv83,pv35)))) != n0,
inference(demodulation,[status(thm),theory(equality)],[c_498,c_498,c_625]) ).
tff(c_631,plain,
sum(n0,pred(n0),times(minus(a_select2(x,pv83),divide(pv80,pv44)),times(minus(a_select2(x,pv83),divide(pv80,pv44)),a_select3(q,pv83,pv35)))) != n0,
inference(demodulation,[status(thm),theory(equality)],[c_470,c_627]) ).
tff(c_773,plain,
sum(n0,tptp_minus_1,times(minus(a_select2(x,pv83),divide(pv80,pv44)),times(minus(a_select2(x,pv83),divide(pv80,pv44)),a_select3(q,pv83,pv35)))) != n0,
inference(demodulation,[status(thm),theory(equality)],[c_738,c_631]) ).
tff(c_854,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_444,c_773]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : SWV046+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 : n002.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:44:46 EDT 2023
% 0.14/0.36 % CPUTime :
% 7.06/2.62 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.06/2.63
% 7.06/2.63 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 7.06/2.66
% 7.06/2.66 Inference rules
% 7.06/2.66 ----------------------
% 7.06/2.66 #Ref : 0
% 7.06/2.66 #Sup : 68
% 7.06/2.66 #Fact : 0
% 7.06/2.66 #Define : 0
% 7.06/2.66 #Split : 0
% 7.06/2.66 #Chain : 0
% 7.06/2.66 #Close : 0
% 7.06/2.66
% 7.06/2.66 Ordering : KBO
% 7.06/2.66
% 7.06/2.66 Simplification rules
% 7.06/2.66 ----------------------
% 7.06/2.66 #Subsume : 1
% 7.06/2.66 #Demod : 52
% 7.06/2.66 #Tautology : 62
% 7.06/2.66 #SimpNegUnit : 1
% 7.06/2.66 #BackRed : 2
% 7.06/2.66
% 7.06/2.66 #Partial instantiations: 0
% 7.06/2.66 #Strategies tried : 1
% 7.06/2.66
% 7.06/2.66 Timing (in seconds)
% 7.06/2.66 ----------------------
% 7.06/2.66 Preprocessing : 0.92
% 7.06/2.66 Parsing : 0.36
% 7.06/2.66 CNF conversion : 0.07
% 7.06/2.66 Main loop : 0.67
% 7.06/2.66 Inferencing : 0.10
% 7.06/2.66 Reduction : 0.28
% 7.06/2.66 Demodulation : 0.19
% 7.06/2.66 BG Simplification : 0.11
% 7.06/2.66 Subsumption : 0.19
% 7.06/2.66 Abstraction : 0.06
% 7.06/2.66 MUC search : 0.00
% 7.06/2.66 Cooper : 0.00
% 7.06/2.66 Total : 1.63
% 7.06/2.66 Index Insertion : 0.00
% 7.06/2.66 Index Deletion : 0.00
% 7.06/2.66 Index Matching : 0.00
% 7.06/2.66 BG Taut test : 0.00
%------------------------------------------------------------------------------