TSTP Solution File: SWV165+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV165+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 : 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:03:04 EDT 2023
% Result : Theorem 10.56s 3.47s
% Output : CNFRefutation 10.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 68
% Syntax : Number of formulae : 79 ( 10 unt; 63 typ; 0 def)
% Number of atoms : 25 ( 3 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 10 ~; 4 |; 2 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 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 : 58 ( 58 usr; 13 con; 0-8 aty)
% Number of variables : 15 (; 15 !; 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 > n4 > 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_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('#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_487,negated_conjecture,
~ ! [A] :
( ( leq(n0,A)
& leq(A,tptp_minus_1) )
=> ( uninit = init ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cl5_nebula_init_0001) ).
tff(f_80,axiom,
! [X,Y,Z] :
( ( leq(X,Y)
& leq(Y,Z) )
=> leq(X,Z) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWV003+0.ax',transitivity_leq) ).
tff(f_378,axiom,
succ(tptp_minus_1) = n0,
file('/export/starexec/sandbox/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/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(c_516,plain,
leq(n0,'#skF_28'),
inference(cnfTransformation,[status(thm)],[f_487]) ).
tff(c_514,plain,
leq('#skF_28',tptp_minus_1),
inference(cnfTransformation,[status(thm)],[f_487]) ).
tff(c_3110,plain,
! [X_267,Z_268,Y_269] :
( leq(X_267,Z_268)
| ~ leq(Y_269,Z_268)
| ~ leq(X_267,Y_269) ),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_3553,plain,
! [X_282] :
( leq(X_282,tptp_minus_1)
| ~ leq(X_282,'#skF_28') ),
inference(resolution,[status(thm)],[c_514,c_3110]) ).
tff(c_448,plain,
succ(tptp_minus_1) = n0,
inference(cnfTransformation,[status(thm)],[f_378]) ).
tff(c_1952,plain,
! [Y_237,X_238] :
( gt(succ(Y_237),X_238)
| ~ leq(X_238,Y_237) ),
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_2005,plain,
! [Y_239] : ~ leq(succ(Y_239),Y_239),
inference(resolution,[status(thm)],[c_1952,c_6]) ).
tff(c_2061,plain,
~ leq(n0,tptp_minus_1),
inference(superposition,[status(thm),theory(equality)],[c_448,c_2005]) ).
tff(c_3573,plain,
~ leq(n0,'#skF_28'),
inference(resolution,[status(thm)],[c_3553,c_2061]) ).
tff(c_3606,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_516,c_3573]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV165+1 : TPTP v8.1.2. Bugfixed v3.3.0.
% 0.00/0.14 % 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.16/0.35 % Computer : n002.cluster.edu
% 0.16/0.35 % Model : x86_64 x86_64
% 0.16/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.35 % Memory : 8042.1875MB
% 0.16/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.35 % CPULimit : 300
% 0.16/0.35 % WCLimit : 300
% 0.16/0.35 % DateTime : Thu Aug 3 23:09:46 EDT 2023
% 0.16/0.35 % CPUTime :
% 10.56/3.47 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.56/3.48
% 10.56/3.48 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 10.75/3.51
% 10.75/3.51 Inference rules
% 10.75/3.51 ----------------------
% 10.75/3.51 #Ref : 0
% 10.75/3.51 #Sup : 808
% 10.75/3.51 #Fact : 2
% 10.75/3.51 #Define : 0
% 10.75/3.51 #Split : 2
% 10.75/3.51 #Chain : 0
% 10.75/3.51 #Close : 0
% 10.75/3.51
% 10.75/3.51 Ordering : KBO
% 10.75/3.51
% 10.75/3.51 Simplification rules
% 10.75/3.51 ----------------------
% 10.75/3.51 #Subsume : 104
% 10.75/3.51 #Demod : 298
% 10.75/3.51 #Tautology : 246
% 10.75/3.51 #SimpNegUnit : 3
% 10.75/3.51 #BackRed : 56
% 10.75/3.51
% 10.75/3.51 #Partial instantiations: 0
% 10.75/3.51 #Strategies tried : 1
% 10.75/3.51
% 10.75/3.51 Timing (in seconds)
% 10.75/3.51 ----------------------
% 10.75/3.51 Preprocessing : 0.97
% 10.75/3.51 Parsing : 0.39
% 10.75/3.51 CNF conversion : 0.07
% 10.75/3.51 Main loop : 1.42
% 10.75/3.51 Inferencing : 0.33
% 10.75/3.51 Reduction : 0.57
% 10.75/3.51 Demodulation : 0.40
% 10.75/3.51 BG Simplification : 0.13
% 10.75/3.51 Subsumption : 0.33
% 10.75/3.51 Abstraction : 0.08
% 10.75/3.51 MUC search : 0.00
% 10.75/3.51 Cooper : 0.00
% 10.75/3.51 Total : 2.44
% 10.75/3.51 Index Insertion : 0.00
% 10.75/3.51 Index Deletion : 0.00
% 10.75/3.51 Index Matching : 0.00
% 10.75/3.51 BG Taut test : 0.00
%------------------------------------------------------------------------------