%------------------------------------------------------------------------------
% File : Beagle---0.9.52
% Problem : SWV140+1 : TPTP v9.0.0. 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 : 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 : Wed Apr 9 09:29:36 PM UTC 2025
% Result : Theorem 10.36s 3.29s
% Output : CNFRefutation 10.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 12
% Syntax : Number of formulae : 47 ( 29 unt; 0 typ; 0 def)
% Number of atoms : 96 ( 15 equ)
% Maximal formula atoms : 27 ( 2 avg)
% Number of connectives : 78 ( 29 ~; 16 |; 15 &)
% ( 2 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 7 ( 5 usr; 2 prp; 0-2 aty)
% Number of functors : 61 ( 61 usr; 16 con; 0-8 aty)
% Number of variables : 38 ( 38 !; 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_001 > tptp_float_0_0 > s_worst7 > s_sworst7 > s_best7 > pv1341 > n5 > n4 > n3 > n2 > n1 > n0 > loopcounter > 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(loopcounter,type,
loopcounter: $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(tptp_float_0_001,type,
tptp_float_0_001: $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('#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(s_worst7,type,
s_worst7: $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(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(s_best7,type,
s_best7: $i ).
tff(n2,type,
n2: $i ).
tff(s_sworst7,type,
s_sworst7: $i ).
tff(n5,type,
n5: $i ).
tff(pv1341,type,
pv1341: $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_540,negated_conjecture,
~ ( ( leq(tptp_float_0_001,pv1341)
& leq(n1,loopcounter)
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_best7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_sworst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(n0,s_worst7) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_best7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_sworst7,n3) )
& ( ~ leq(tptp_float_0_001,pv1341)
=> leq(s_worst7,n3) )
& ( gt(loopcounter,n0)
=> leq(n0,s_best7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_sworst7) )
& ( gt(loopcounter,n0)
=> leq(n0,s_worst7) )
& ( gt(loopcounter,n0)
=> leq(s_best7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_sworst7,n3) )
& ( gt(loopcounter,n0)
=> leq(s_worst7,n3) ) )
=> leq(n0,s_sworst7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gauss_array_0010) ).
tff(f_89,axiom,
! [X,Y] :
( geq(X,Y)
<=> leq(Y,X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_geq) ).
tff(f_62,axiom,
! [X,Y] :
( gt(X,Y)
| gt(Y,X)
| ( X = Y ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',totality) ).
tff(f_631,axiom,
succ(n0) = n1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',successor_1) ).
tff(f_402,axiom,
! [X] : ( pred(succ(X)) = X ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
tff(f_101,axiom,
! [X,Y] :
( ( leq(X,Y)
& ( X != Y ) )
=> gt(Y,X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',leq_gt2) ).
tff(f_551,axiom,
gt(n1,n0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',gt_1_0) ).
tff(f_68,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(f_404,axiom,
! [X] : ( succ(pred(X)) = X ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_pred) ).
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_116,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_71,axiom,
! [X] : ~ gt(X,X),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',irreflexivity_gt) ).
tff(c_538,plain,
leq(n1,loopcounter),
inference(cnfTransformation,[status(thm)],[f_540]) ).
tff(c_1029,plain,
! [X_207,Y_208] :
( geq(X_207,Y_208)
| ~ leq(Y_208,X_207) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_1049,plain,
geq(loopcounter,n1),
inference(resolution,[status(thm)],[c_538,c_1029]) ).
tff(c_512,plain,
~ leq(n0,s_sworst7),
inference(cnfTransformation,[status(thm)],[f_540]) ).
tff(c_522,plain,
( leq(n0,s_sworst7)
| ~ gt(loopcounter,n0) ),
inference(cnfTransformation,[status(thm)],[f_540]) ).
tff(c_616,plain,
~ gt(loopcounter,n0),
inference(negUnitSimplification,[status(thm)],[c_512,c_522]) ).
tff(c_2,plain,
! [Y_2,X_1] :
( ( Y_2 = X_1 )
| gt(Y_2,X_1)
| gt(X_1,Y_2) ),
inference(cnfTransformation,[status(thm)],[f_62]) ).
tff(c_600,plain,
succ(n0) = n1,
inference(cnfTransformation,[status(thm)],[f_631]) ).
tff(c_654,plain,
! [X_189] : ( pred(succ(X_189)) = X_189 ),
inference(cnfTransformation,[status(thm)],[f_402]) ).
tff(c_672,plain,
pred(n1) = n0,
inference(superposition,[status(thm),theory(equality)],[c_600,c_654]) ).
tff(c_2766,plain,
! [Y_254,X_255] :
( gt(Y_254,X_255)
| ( Y_254 = X_255 )
| ~ leq(X_255,Y_254) ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_2809,plain,
( gt(loopcounter,n1)
| ( n1 = loopcounter ) ),
inference(resolution,[status(thm)],[c_538,c_2766]) ).
tff(c_2867,plain,
n1 = loopcounter,
inference(splitLeft,[status(thm)],[c_2809]) ).
tff(c_560,plain,
gt(n1,n0),
inference(cnfTransformation,[status(thm)],[f_551]) ).
tff(c_2901,plain,
gt(loopcounter,n0),
inference(demodulation,[status(thm),theory(equality)],[c_2867,c_560]) ).
tff(c_2911,plain,
$false,
inference(negUnitSimplification,[status(thm)],[c_616,c_2901]) ).
tff(c_2912,plain,
gt(loopcounter,n1),
inference(splitRight,[status(thm)],[c_2809]) ).
tff(c_2957,plain,
! [X_259,Z_260,Y_261] :
( gt(X_259,Z_260)
| ~ gt(Y_261,Z_260)
| ~ gt(X_259,Y_261) ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_3116,plain,
! [X_264] :
( gt(X_264,n1)
| ~ gt(X_264,loopcounter) ),
inference(resolution,[status(thm)],[c_2912,c_2957]) ).
tff(c_474,plain,
! [X_142] : ( succ(pred(X_142)) = X_142 ),
inference(cnfTransformation,[status(thm)],[f_404]) ).
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_1263,plain,
! [Y_214,X_215] :
( gt(succ(Y_214),X_215)
| ~ leq(X_215,Y_214) ),
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_1478,plain,
! [Y_222] : ~ leq(succ(Y_222),Y_222),
inference(resolution,[status(thm)],[c_1263,c_6]) ).
tff(c_1946,plain,
! [Y_236] : ~ gt(Y_236,succ(Y_236)),
inference(resolution,[status(thm)],[c_20,c_1478]) ).
tff(c_1974,plain,
! [X_142] : ~ gt(pred(X_142),X_142),
inference(superposition,[status(thm),theory(equality)],[c_474,c_1946]) ).
tff(c_3125,plain,
~ gt(pred(n1),loopcounter),
inference(resolution,[status(thm)],[c_3116,c_1974]) ).
tff(c_3143,plain,
~ gt(n0,loopcounter),
inference(demodulation,[status(thm),theory(equality)],[c_672,c_3125]) ).
tff(c_3162,plain,
( ( n0 = loopcounter )
| gt(loopcounter,n0) ),
inference(resolution,[status(thm)],[c_2,c_3143]) ).
tff(c_3168,plain,
n0 = loopcounter,
inference(negUnitSimplification,[status(thm)],[c_616,c_3162]) ).
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_1520,plain,
~ leq(n1,n0),
inference(superposition,[status(thm),theory(equality)],[c_600,c_1478]) ).
tff(c_1639,plain,
~ geq(n0,n1),
inference(resolution,[status(thm)],[c_16,c_1520]) ).
tff(c_3188,plain,
~ geq(loopcounter,n1),
inference(demodulation,[status(thm),theory(equality)],[c_3168,c_1639]) ).
tff(c_3220,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_1049,c_3188]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SWV140+1 : TPTP v9.0.0. Bugfixed v3.3.0.
% 0.12/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.12/0.34 % Computer : n020.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Apr 9 02:47:04 EDT 2025
% 0.12/0.34 % CPUTime :
% 10.36/3.29 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.36/3.29
% 10.36/3.29 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------