TSTP Solution File: SWV041+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV041+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 : n004.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:43 EDT 2023
% Result : Theorem 11.81s 3.76s
% Output : CNFRefutation 12.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 77
% Syntax : Number of formulae : 113 ( 32 unt; 66 typ; 0 def)
% Number of atoms : 71 ( 16 equ)
% Maximal formula atoms : 7 ( 1 avg)
% Number of connectives : 44 ( 20 ~; 11 |; 5 &)
% ( 2 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 4 ( 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 : 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 > uninit > true > tptp_minus_1 > tptp_float_0_0 > n5 > n410 > n4 > n330 > n3 > n2 > n1 > n0 > init > 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_29 > #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(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(uninit,type,
uninit: $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(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(init,type,
init: $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(n410,type,
n410: $i ).
tff('#skF_29',type,
'#skF_29': $i ).
tff('#skF_28',type,
'#skF_28': $i ).
tff(lt,type,
lt: ( $i * $i ) > $o ).
tff(n330,type,
n330: $i ).
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_496,negated_conjecture,
~ ( ( geq(minus(n330,n1),n0)
& geq(minus(n410,n1),n0) )
=> ! [A] :
( ( leq(n0,A)
& leq(A,n2) )
=> ! [B] :
( ( leq(n0,B)
& leq(B,minus(n0,n1)) )
=> ( a_select3(tptp_const_array2(dim(n0,n3),dim(n0,n2),uninit),B,A) = init ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',gauss_init_0077) ).
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_378,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_tptp_minus_1) ).
tff(f_402,axiom,
! [X] : ( pred(succ(X)) = X ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_succ) ).
tff(f_400,axiom,
! [X] : ( minus(X,n1) = pred(X) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',pred_minus_1) ).
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_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_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(f_94,axiom,
! [X,Y] :
( gt(Y,X)
=> leq(X,Y) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',leq_gt1) ).
tff(f_404,axiom,
! [X] : ( succ(pred(X)) = X ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',succ_pred) ).
tff(c_516,plain,
leq(n0,'#skF_29'),
inference(cnfTransformation,[status(thm)],[f_496]) ).
tff(c_939,plain,
! [X_203,Y_204] :
( geq(X_203,Y_204)
| ~ leq(Y_204,X_203) ),
inference(cnfTransformation,[status(thm)],[f_89]) ).
tff(c_963,plain,
geq('#skF_29',n0),
inference(resolution,[status(thm)],[c_516,c_939]) ).
tff(c_448,plain,
succ(tptp_minus_1) = n0,
inference(cnfTransformation,[status(thm)],[f_378]) ).
tff(c_673,plain,
! [X_191] : ( pred(succ(X_191)) = X_191 ),
inference(cnfTransformation,[status(thm)],[f_402]) ).
tff(c_691,plain,
pred(n0) = tptp_minus_1,
inference(superposition,[status(thm),theory(equality)],[c_448,c_673]) ).
tff(c_470,plain,
! [X_140] : ( minus(X_140,n1) = pred(X_140) ),
inference(cnfTransformation,[status(thm)],[f_400]) ).
tff(c_514,plain,
leq('#skF_29',minus(n0,n1)),
inference(cnfTransformation,[status(thm)],[f_496]) ).
tff(c_626,plain,
leq('#skF_29',pred(n0)),
inference(demodulation,[status(thm),theory(equality)],[c_470,c_514]) ).
tff(c_748,plain,
leq('#skF_29',tptp_minus_1),
inference(demodulation,[status(thm),theory(equality)],[c_691,c_626]) ).
tff(c_2811,plain,
! [Y_252,X_253] :
( gt(Y_252,X_253)
| ( Y_252 = X_253 )
| ~ leq(X_253,Y_252) ),
inference(cnfTransformation,[status(thm)],[f_101]) ).
tff(c_2851,plain,
( gt(tptp_minus_1,'#skF_29')
| ( tptp_minus_1 = '#skF_29' ) ),
inference(resolution,[status(thm)],[c_748,c_2811]) ).
tff(c_4063,plain,
tptp_minus_1 = '#skF_29',
inference(splitLeft,[status(thm)],[c_2851]) ).
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_1734,plain,
! [Y_225,X_226] :
( gt(succ(Y_225),X_226)
| ~ leq(X_226,Y_225) ),
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_2265,plain,
! [Y_242] : ~ leq(succ(Y_242),Y_242),
inference(resolution,[status(thm)],[c_1734,c_6]) ).
tff(c_2316,plain,
~ leq(n0,tptp_minus_1),
inference(superposition,[status(thm),theory(equality)],[c_448,c_2265]) ).
tff(c_2356,plain,
~ geq(tptp_minus_1,n0),
inference(resolution,[status(thm)],[c_16,c_2316]) ).
tff(c_4070,plain,
~ geq('#skF_29',n0),
inference(demodulation,[status(thm),theory(equality)],[c_4063,c_2356]) ).
tff(c_4094,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_963,c_4070]) ).
tff(c_4095,plain,
gt(tptp_minus_1,'#skF_29'),
inference(splitRight,[status(thm)],[c_2851]) ).
tff(c_959,plain,
geq(tptp_minus_1,'#skF_29'),
inference(resolution,[status(thm)],[c_748,c_939]) ).
tff(c_2858,plain,
( gt('#skF_29',n0)
| ( n0 = '#skF_29' ) ),
inference(resolution,[status(thm)],[c_516,c_2811]) ).
tff(c_3430,plain,
n0 = '#skF_29',
inference(splitLeft,[status(thm)],[c_2858]) ).
tff(c_3438,plain,
~ geq(tptp_minus_1,'#skF_29'),
inference(demodulation,[status(thm),theory(equality)],[c_3430,c_2356]) ).
tff(c_3473,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_959,c_3438]) ).
tff(c_3474,plain,
gt('#skF_29',n0),
inference(splitRight,[status(thm)],[c_2858]) ).
tff(c_3575,plain,
! [X_272,Z_273,Y_274] :
( gt(X_272,Z_273)
| ~ gt(Y_274,Z_273)
| ~ gt(X_272,Y_274) ),
inference(cnfTransformation,[status(thm)],[f_68]) ).
tff(c_4722,plain,
! [X_332] :
( gt(X_332,n0)
| ~ gt(X_332,'#skF_29') ),
inference(resolution,[status(thm)],[c_3474,c_3575]) ).
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_474,plain,
! [X_142] : ( succ(pred(X_142)) = X_142 ),
inference(cnfTransformation,[status(thm)],[f_404]) ).
tff(c_2768,plain,
! [X_251] : ~ leq(X_251,pred(X_251)),
inference(superposition,[status(thm),theory(equality)],[c_474,c_2265]) ).
tff(c_2810,plain,
! [X_15] : ~ gt(pred(X_15),X_15),
inference(resolution,[status(thm)],[c_20,c_2768]) ).
tff(c_4726,plain,
~ gt(pred(n0),'#skF_29'),
inference(resolution,[status(thm)],[c_4722,c_2810]) ).
tff(c_4746,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_4095,c_691,c_4726]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWV041+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.13 % 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.12/0.34 % Computer : n004.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 : Thu Aug 3 22:57:26 EDT 2023
% 0.12/0.35 % CPUTime :
% 11.81/3.76 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 12.02/3.77
% 12.02/3.77 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 12.02/3.80
% 12.02/3.80 Inference rules
% 12.02/3.80 ----------------------
% 12.02/3.80 #Ref : 0
% 12.02/3.80 #Sup : 1066
% 12.02/3.80 #Fact : 2
% 12.02/3.80 #Define : 0
% 12.02/3.80 #Split : 5
% 12.02/3.80 #Chain : 0
% 12.02/3.80 #Close : 0
% 12.02/3.80
% 12.02/3.80 Ordering : KBO
% 12.02/3.80
% 12.02/3.80 Simplification rules
% 12.02/3.80 ----------------------
% 12.02/3.80 #Subsume : 82
% 12.02/3.80 #Demod : 553
% 12.02/3.80 #Tautology : 392
% 12.02/3.80 #SimpNegUnit : 7
% 12.02/3.80 #BackRed : 159
% 12.02/3.80
% 12.02/3.80 #Partial instantiations: 0
% 12.02/3.80 #Strategies tried : 1
% 12.02/3.80
% 12.02/3.80 Timing (in seconds)
% 12.02/3.80 ----------------------
% 12.02/3.80 Preprocessing : 0.94
% 12.02/3.80 Parsing : 0.37
% 12.02/3.80 CNF conversion : 0.07
% 12.02/3.80 Main loop : 1.73
% 12.02/3.80 Inferencing : 0.44
% 12.02/3.80 Reduction : 0.70
% 12.02/3.80 Demodulation : 0.50
% 12.02/3.80 BG Simplification : 0.12
% 12.02/3.80 Subsumption : 0.36
% 12.02/3.80 Abstraction : 0.08
% 12.02/3.80 MUC search : 0.00
% 12.02/3.80 Cooper : 0.00
% 12.02/3.80 Total : 2.73
% 12.02/3.80 Index Insertion : 0.00
% 12.02/3.80 Index Deletion : 0.00
% 12.02/3.80 Index Matching : 0.00
% 12.02/3.80 BG Taut test : 0.00
%------------------------------------------------------------------------------