TSTP Solution File: SWV191+1 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV191+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 : n026.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:09 EDT 2023
% Result : Theorem 11.36s 3.68s
% Output : CNFRefutation 11.36s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 74
% Syntax : Number of formulae : 85 ( 10 unt; 69 typ; 0 def)
% Number of atoms : 54 ( 30 equ)
% Maximal formula atoms : 32 ( 3 avg)
% Number of connectives : 48 ( 10 ~; 4 |; 30 &)
% ( 1 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 29 ( 5 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 : 64 ( 64 usr; 19 con; 0-8 aty)
% Number of variables : 16 (; 16 !; 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 > z_defuse > xinit_noise_defuse > xinit_mean_defuse > xinit_defuse > use > u_defuse > true > tptp_minus_1 > tptp_float_0_0 > sigma_defuse > rho_defuse > n5 > n4 > n3 > n2 > n1 > n0 > 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(xinit_defuse,type,
xinit_defuse: $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(xinit_noise_defuse,type,
xinit_noise_defuse: $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(z_defuse,type,
z_defuse: $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(rho_defuse,type,
rho_defuse: $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(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(u_defuse,type,
u_defuse: $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(xinit_mean_defuse,type,
xinit_mean_defuse: $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(sigma_defuse,type,
sigma_defuse: $i ).
tff(minus,type,
minus: ( $i * $i ) > $i ).
tff(f_545,negated_conjecture,
~ ( ( ( a_select2(rho_defuse,n0) = use )
& ( a_select2(rho_defuse,n1) = use )
& ( a_select2(rho_defuse,n2) = use )
& ( a_select2(sigma_defuse,n0) = use )
& ( a_select2(sigma_defuse,n1) = use )
& ( a_select2(sigma_defuse,n2) = use )
& ( a_select2(sigma_defuse,n3) = use )
& ( a_select2(sigma_defuse,n4) = use )
& ( a_select2(sigma_defuse,n5) = use )
& ( a_select3(u_defuse,n0,n0) = use )
& ( a_select3(u_defuse,n1,n0) = use )
& ( a_select3(u_defuse,n2,n0) = use )
& ( a_select2(xinit_defuse,n3) = use )
& ( a_select2(xinit_defuse,n4) = use )
& ( a_select2(xinit_defuse,n5) = use )
& ( a_select2(xinit_mean_defuse,n0) = use )
& ( a_select2(xinit_mean_defuse,n1) = use )
& ( a_select2(xinit_mean_defuse,n2) = use )
& ( a_select2(xinit_mean_defuse,n3) = use )
& ( a_select2(xinit_mean_defuse,n4) = use )
& ( a_select2(xinit_mean_defuse,n5) = use )
& ( a_select2(xinit_noise_defuse,n0) = use )
& ( a_select2(xinit_noise_defuse,n1) = use )
& ( a_select2(xinit_noise_defuse,n2) = use )
& ( a_select2(xinit_noise_defuse,n3) = use )
& ( a_select2(xinit_noise_defuse,n4) = use )
& ( a_select2(xinit_noise_defuse,n5) = use ) )
=> ! [A,B] :
( ( leq(n0,A)
& leq(n0,B)
& leq(A,n2)
& leq(B,tptp_minus_1) )
=> ( a_select3(z_defuse,A,B) = use ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',quaternion_ds1_inuse_0002) ).
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_518,plain,
leq(n0,'#skF_29'),
inference(cnfTransformation,[status(thm)],[f_545]) ).
tff(c_514,plain,
leq('#skF_29',tptp_minus_1),
inference(cnfTransformation,[status(thm)],[f_545]) ).
tff(c_4666,plain,
! [X_296,Z_297,Y_298] :
( leq(X_296,Z_297)
| ~ leq(Y_298,Z_297)
| ~ leq(X_296,Y_298) ),
inference(cnfTransformation,[status(thm)],[f_80]) ).
tff(c_4810,plain,
! [X_306] :
( leq(X_306,tptp_minus_1)
| ~ leq(X_306,'#skF_29') ),
inference(resolution,[status(thm)],[c_514,c_4666]) ).
tff(c_448,plain,
succ(tptp_minus_1) = n0,
inference(cnfTransformation,[status(thm)],[f_378]) ).
tff(c_1884,plain,
! [Y_233,X_234] :
( gt(succ(Y_233),X_234)
| ~ leq(X_234,Y_233) ),
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_1934,plain,
! [Y_235] : ~ leq(succ(Y_235),Y_235),
inference(resolution,[status(thm)],[c_1884,c_6]) ).
tff(c_1975,plain,
~ leq(n0,tptp_minus_1),
inference(superposition,[status(thm),theory(equality)],[c_448,c_1934]) ).
tff(c_4822,plain,
~ leq(n0,'#skF_29'),
inference(resolution,[status(thm)],[c_4810,c_1975]) ).
tff(c_4840,plain,
$false,
inference(demodulation,[status(thm),theory(equality)],[c_518,c_4822]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV191+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.13/0.35 % Computer : n026.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Thu Aug 3 23:09:47 EDT 2023
% 0.13/0.35 % CPUTime :
% 11.36/3.68 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 11.36/3.68
% 11.36/3.68 % SZS output start CNFRefutation for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
% 11.36/3.71
% 11.36/3.71 Inference rules
% 11.36/3.71 ----------------------
% 11.36/3.71 #Ref : 0
% 11.36/3.71 #Sup : 1141
% 11.36/3.71 #Fact : 4
% 11.36/3.71 #Define : 0
% 11.36/3.71 #Split : 5
% 11.36/3.71 #Chain : 0
% 11.36/3.71 #Close : 0
% 11.36/3.71
% 11.36/3.71 Ordering : KBO
% 11.36/3.71
% 11.36/3.71 Simplification rules
% 11.36/3.71 ----------------------
% 11.36/3.71 #Subsume : 109
% 11.36/3.71 #Demod : 441
% 11.36/3.71 #Tautology : 410
% 11.36/3.71 #SimpNegUnit : 7
% 11.36/3.71 #BackRed : 164
% 11.36/3.71
% 11.36/3.71 #Partial instantiations: 0
% 11.36/3.71 #Strategies tried : 1
% 11.36/3.71
% 11.36/3.71 Timing (in seconds)
% 11.36/3.71 ----------------------
% 11.36/3.72 Preprocessing : 0.98
% 11.36/3.72 Parsing : 0.39
% 11.36/3.72 CNF conversion : 0.08
% 11.36/3.72 Main loop : 1.73
% 11.36/3.72 Inferencing : 0.39
% 11.36/3.72 Reduction : 0.66
% 11.36/3.72 Demodulation : 0.48
% 11.36/3.72 BG Simplification : 0.12
% 11.36/3.72 Subsumption : 0.35
% 11.36/3.72 Abstraction : 0.08
% 11.36/3.72 MUC search : 0.00
% 11.36/3.72 Cooper : 0.00
% 11.36/3.72 Total : 2.76
% 11.36/3.72 Index Insertion : 0.00
% 11.36/3.72 Index Deletion : 0.00
% 11.36/3.72 Index Matching : 0.00
% 11.36/3.72 BG Taut test : 0.00
%------------------------------------------------------------------------------