TSTP Solution File: SWV189+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV189+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 : n024.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:03:08 EDT 2023
% Result : Theorem 11.03s 3.65s
% Output : CNFRefutation 11.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 70
% Syntax : Number of formulae : 81 ( 10 unt; 65 typ; 0 def)
% Number of atoms : 30 ( 4 equ)
% Maximal formula atoms : 8 ( 1 avg)
% Number of connectives : 24 ( 10 ~; 4 |; 4 &)
% ( 1 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 17 (; 17 !; 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_init > n5 > n4 > n3 > n2 > n1 > n0 > init > def > center_init > #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(center_init,type,
center_init: $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('#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(q_init,type,
q_init: $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('#skF_29',type,
'#skF_29': $i ).
tff('#skF_28',type,
'#skF_28': $i ).
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_499,negated_conjecture,
~ ( ! [A] :
( ( leq(n0,A)
& leq(A,n4) )
=> ( a_select3(center_init,A,n0) = init ) )
=> ! [B] :
( ( leq(n0,B)
& leq(B,tptp_minus_1) )
=> ! [C] :
( ( leq(n0,C)
& leq(C,n4) )
=> ( a_select3(q_init,B,C) = init ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_init_0121) ).
tff(f_80,axiom,
! [X,Y,Z] :
( ( leq(X,Y)
& leq(Y,Z) )
=> leq(X,Z) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).
tff(f_378,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox2/benchmark/Axioms/SWV003+0.ax',succ_tptp_minus_1) ).
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_520,plain,
leq(n0,'#skF_28'),
inference(cnfTransformation,[status(thm)],[f_499]) ).
tff(c_518,plain,
leq('#skF_28',tptp_minus_1),
inference(cnfTransformation,[status(thm)],[f_499]) ).
tff(c_6083,plain,
! [X_322,Z_323,Y_324] :
( leq(X_322,Z_323)
| ~ leq(Y_324,Z_323)
| ~ leq(X_322,Y_324) ),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_6174,plain,
! [X_330] :
( leq(X_330,tptp_minus_1)
| ~ leq(X_330,'#skF_28') ),
inference(resolution,[status(thm)],[c_518,c_6083]) ).
tff(c_448,plain,
succ(tptp_minus_1) = n0,
inference(cnfTransformation,[status(thm)],[f_378]) ).
tff(c_2005,plain,
! [Y_239,X_240] :
( gt(succ(Y_239),X_240)
| ~ leq(X_240,Y_239) ),
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_2052,plain,
! [Y_241] : ~ leq(succ(Y_241),Y_241),
inference(resolution,[status(thm)],[c_2005,c_6]) ).
tff(c_2093,plain,
~ leq(n0,tptp_minus_1),
inference(superposition,[status(thm),theory(equality)],[c_448,c_2052]) ).
tff(c_6205,plain,
~ leq(n0,'#skF_28'),
inference(resolution,[status(thm)],[c_6174,c_2093]) ).
tff(c_6228,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_520,c_6205]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV189+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.14/0.14 % 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 : n024.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 23:02:00 EDT 2023
% 0.14/0.36 % CPUTime :
% 11.03/3.65 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 11.03/3.66
% 11.03/3.66 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 11.45/3.69
% 11.45/3.69 Inference rules
% 11.45/3.69 ----------------------
% 11.45/3.69 #Ref : 0
% 11.45/3.69 #Sup : 1405
% 11.45/3.69 #Fact : 4
% 11.45/3.69 #Define : 0
% 11.45/3.69 #Split : 10
% 11.45/3.69 #Chain : 0
% 11.45/3.69 #Close : 0
% 11.45/3.69
% 11.45/3.69 Ordering : KBO
% 11.45/3.69
% 11.45/3.69 Simplification rules
% 11.45/3.69 ----------------------
% 11.45/3.69 #Subsume : 194
% 11.45/3.69 #Demod : 1010
% 11.45/3.69 #Tautology : 499
% 11.45/3.69 #SimpNegUnit : 7
% 11.45/3.69 #BackRed : 271
% 11.45/3.69
% 11.45/3.69 #Partial instantiations: 0
% 11.45/3.69 #Strategies tried : 1
% 11.45/3.69
% 11.45/3.69 Timing (in seconds)
% 11.45/3.69 ----------------------
% 11.45/3.69 Preprocessing : 0.91
% 11.45/3.69 Parsing : 0.37
% 11.45/3.69 CNF conversion : 0.07
% 11.45/3.69 Main loop : 1.67
% 11.45/3.69 Inferencing : 0.40
% 11.45/3.69 Reduction : 0.68
% 11.45/3.69 Demodulation : 0.49
% 11.45/3.69 BG Simplification : 0.12
% 11.45/3.69 Subsumption : 0.38
% 11.45/3.69 Abstraction : 0.08
% 11.45/3.69 MUC search : 0.00
% 11.45/3.69 Cooper : 0.00
% 11.45/3.69 Total : 2.63
% 11.45/3.69 Index Insertion : 0.00
% 11.45/3.69 Index Deletion : 0.00
% 11.45/3.69 Index Matching : 0.00
% 11.45/3.69 BG Taut test : 0.00
%------------------------------------------------------------------------------