TSTP Solution File: SWV415+2 by Beagle---0.9.51
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Beagle---0.9.51
% Problem : SWV415+2 : TPTP v8.1.2. Released 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 : n010.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:04:03 EDT 2023
% Result : Theorem 46.99s 28.07s
% Output : CNFRefutation 46.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 69
% Syntax : Number of formulae : 95 ( 25 unt; 64 typ; 0 def)
% Number of atoms : 42 ( 39 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 26 ( 15 ~; 8 |; 1 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 5 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 76 ( 45 >; 31 *; 0 +; 0 <<)
% Number of predicates : 21 ( 19 usr; 1 prp; 0-3 aty)
% Number of functors : 45 ( 45 usr; 19 con; 0-3 aty)
% Number of variables : 127 (; 127 !; 0 ?; 0 :)
% Comments :
%------------------------------------------------------------------------------
%$ pair_in_list > succ_cpq > strictly_less_than > pi_sharp_removemin > pi_sharp_remove > pi_sharp_find_min > pi_remove > less_than > issmallestelement_pq > contains_slb > contains_pq > contains_cpq > pi_removemin > pi_find_min > phi > ok > isnonempty_slb > isnonempty_pq > check_cpq > triple > update_slb > removemin_pq_res > removemin_pq_eff > remove_slb > remove_pqp > remove_pq > remove_cpq > pair > lookup_slb > insert_slb > insert_pqp > insert_pq > insert_cpq > findmin_pq_res > findmin_pq_eff > #nlpp > removemin_cpq_res > removemin_cpq_eff > i > findmin_pqp_res > findmin_cpq_res > findmin_cpq_eff > create_slb > create_pq > bottom > bad > #skF_2 > #skF_4 > #skF_18 > #skF_17 > #skF_11 > #skF_15 > #skF_19 > #skF_7 > #skF_10 > #skF_16 > #skF_14 > #skF_5 > #skF_6 > #skF_13 > #skF_9 > #skF_8 > #skF_3 > #skF_1 > #skF_12
%Foreground sorts:
%Background operators:
%Foreground operators:
tff(bad,type,
bad: $i ).
tff(insert_cpq,type,
insert_cpq: ( $i * $i ) > $i ).
tff(pi_sharp_find_min,type,
pi_sharp_find_min: ( $i * $i ) > $o ).
tff(pi_remove,type,
pi_remove: ( $i * $i ) > $o ).
tff('#skF_2',type,
'#skF_2': $i > $i ).
tff('#skF_4',type,
'#skF_4': $i > $i ).
tff('#skF_18',type,
'#skF_18': $i ).
tff(succ_cpq,type,
succ_cpq: ( $i * $i ) > $o ).
tff(insert_pq,type,
insert_pq: ( $i * $i ) > $i ).
tff('#skF_17',type,
'#skF_17': $i ).
tff(pi_find_min,type,
pi_find_min: $i > $o ).
tff('#skF_11',type,
'#skF_11': $i ).
tff(i,type,
i: $i > $i ).
tff(remove_cpq,type,
remove_cpq: ( $i * $i ) > $i ).
tff('#skF_15',type,
'#skF_15': $i ).
tff(pi_sharp_removemin,type,
pi_sharp_removemin: ( $i * $i ) > $o ).
tff(pi_sharp_remove,type,
pi_sharp_remove: ( $i * $i ) > $o ).
tff(contains_slb,type,
contains_slb: ( $i * $i ) > $o ).
tff(contains_pq,type,
contains_pq: ( $i * $i ) > $o ).
tff(findmin_pq_eff,type,
findmin_pq_eff: ( $i * $i ) > $i ).
tff(lookup_slb,type,
lookup_slb: ( $i * $i ) > $i ).
tff('#skF_19',type,
'#skF_19': $i ).
tff(pi_removemin,type,
pi_removemin: $i > $o ).
tff('#skF_7',type,
'#skF_7': $i ).
tff(phi,type,
phi: $i > $o ).
tff('#skF_10',type,
'#skF_10': $i ).
tff('#skF_16',type,
'#skF_16': $i ).
tff(pair_in_list,type,
pair_in_list: ( $i * $i * $i ) > $o ).
tff(isnonempty_pq,type,
isnonempty_pq: $i > $o ).
tff(findmin_pq_res,type,
findmin_pq_res: ( $i * $i ) > $i ).
tff('#skF_14',type,
'#skF_14': $i ).
tff('#skF_5',type,
'#skF_5': $i ).
tff(less_than,type,
less_than: ( $i * $i ) > $o ).
tff('#skF_6',type,
'#skF_6': $i ).
tff(issmallestelement_pq,type,
issmallestelement_pq: ( $i * $i ) > $o ).
tff('#skF_13',type,
'#skF_13': $i ).
tff(contains_cpq,type,
contains_cpq: ( $i * $i ) > $o ).
tff(strictly_less_than,type,
strictly_less_than: ( $i * $i ) > $o ).
tff(pair,type,
pair: ( $i * $i ) > $i ).
tff(ok,type,
ok: $i > $o ).
tff(insert_pqp,type,
insert_pqp: ( $i * $i ) > $i ).
tff('#skF_9',type,
'#skF_9': $i ).
tff(remove_pq,type,
remove_pq: ( $i * $i ) > $i ).
tff(findmin_pqp_res,type,
findmin_pqp_res: $i > $i ).
tff(remove_pqp,type,
remove_pqp: ( $i * $i ) > $i ).
tff(bottom,type,
bottom: $i ).
tff(removemin_pq_res,type,
removemin_pq_res: ( $i * $i ) > $i ).
tff('#skF_8',type,
'#skF_8': $i ).
tff(triple,type,
triple: ( $i * $i * $i ) > $i ).
tff(create_pq,type,
create_pq: $i ).
tff(removemin_cpq_res,type,
removemin_cpq_res: $i > $i ).
tff('#skF_3',type,
'#skF_3': $i > $i ).
tff(isnonempty_slb,type,
isnonempty_slb: $i > $o ).
tff(check_cpq,type,
check_cpq: $i > $o ).
tff(remove_slb,type,
remove_slb: ( $i * $i ) > $i ).
tff(findmin_cpq_eff,type,
findmin_cpq_eff: $i > $i ).
tff(removemin_cpq_eff,type,
removemin_cpq_eff: $i > $i ).
tff(create_slb,type,
create_slb: $i ).
tff(removemin_pq_eff,type,
removemin_pq_eff: ( $i * $i ) > $i ).
tff('#skF_1',type,
'#skF_1': ( $i * $i ) > $i ).
tff(findmin_cpq_res,type,
findmin_cpq_res: $i > $i ).
tff(insert_slb,type,
insert_slb: ( $i * $i ) > $i ).
tff('#skF_12',type,
'#skF_12': $i ).
tff(update_slb,type,
update_slb: ( $i * $i ) > $i ).
tff(f_305,axiom,
! [U,V,W,X] : ( insert_cpq(triple(U,V,W),X) = triple(insert_pqp(U,X),insert_slb(V,pair(X,bottom)),W) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+3.ax',ax42) ).
tff(f_391,axiom,
! [U,V,W,X,Y] : ( i(triple(U,insert_slb(V,pair(X,Y)),W)) = insert_pq(i(triple(U,V,W)),X) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax55) ).
tff(f_389,axiom,
! [U,V] : ( i(triple(U,create_slb,V)) = create_pq ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWV007+4.ax',ax54) ).
tff(f_445,axiom,
( ( ! [U,V,W,X] : ( i(triple(U,create_slb,W)) = i(triple(V,create_slb,X)) )
& ! [Y] :
( ! [Z,X1,X2,X3] : ( i(triple(Z,Y,X2)) = i(triple(X1,Y,X3)) )
=> ! [X4,X5,X6,X7,X8,X9] : ( i(triple(X4,insert_slb(Y,pair(X8,X9)),X6)) = i(triple(X5,insert_slb(Y,pair(X8,X9)),X7)) ) ) )
=> ! [X10,X11,X12,X13,X14] : ( i(triple(X10,X12,X13)) = i(triple(X11,X12,X14)) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',big2_induction) ).
tff(f_448,negated_conjecture,
~ ! [U,V,W,X] : ( i(insert_cpq(triple(U,V,W),X)) = insert_pq(i(triple(U,V,W)),X) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co2) ).
tff(c_110,plain,
! [U_107,X_110,V_108,W_109] : ( triple(insert_pqp(U_107,X_110),insert_slb(V_108,pair(X_110,bottom)),W_109) = insert_cpq(triple(U_107,V_108,W_109),X_110) ),
inference(cnfTransformation,[status(thm)],[f_305]) ).
tff(c_2001,plain,
! [U_473,X_474,V_475,W_476] : ( triple(insert_pqp(U_473,X_474),insert_slb(V_475,pair(X_474,bottom)),W_476) = insert_cpq(triple(U_473,V_475,W_476),X_474) ),
inference(cnfTransformation,[status(thm)],[f_305]) ).
tff(c_136,plain,
! [V_148,U_147,X_150,Y_151,W_149] : ( i(triple(U_147,insert_slb(V_148,pair(X_150,Y_151)),W_149)) = insert_pq(i(triple(U_147,V_148,W_149)),X_150) ),
inference(cnfTransformation,[status(thm)],[f_391]) ).
tff(c_153061,plain,
! [U_25533,X_25534,V_25535,W_25536] : ( insert_pq(i(triple(insert_pqp(U_25533,X_25534),V_25535,W_25536)),X_25534) = i(insert_cpq(triple(U_25533,V_25535,W_25536),X_25534)) ),
inference(superposition,[status(thm),theory(equality)],[c_2001,c_136]) ).
tff(c_134,plain,
! [U_145,V_146] : ( i(triple(U_145,create_slb,V_146)) = create_pq ),
inference(cnfTransformation,[status(thm)],[f_389]) ).
tff(c_176,plain,
! [X10_186,X12_188,Z_182,X14_190,X2_184,X13_189,X1_183,X3_185,X11_187] :
( ( i(triple(Z_182,'#skF_9',X2_184)) = i(triple(X1_183,'#skF_9',X3_185)) )
| ( i(triple(X11_187,X12_188,X14_190)) = i(triple(X10_186,X12_188,X13_189)) )
| ( i(triple('#skF_5',create_slb,'#skF_7')) != i(triple('#skF_6',create_slb,'#skF_8')) ) ),
inference(cnfTransformation,[status(thm)],[f_445]) ).
tff(c_181,plain,
! [X10_186,X12_188,Z_182,X14_190,X2_184,X13_189,X1_183,X3_185,X11_187] :
( ( i(triple(Z_182,'#skF_9',X2_184)) = i(triple(X1_183,'#skF_9',X3_185)) )
| ( i(triple(X11_187,X12_188,X14_190)) = i(triple(X10_186,X12_188,X13_189)) ) ),
inference(demodulation,[status(thm),theory(equality)],[c_134,c_134,c_176]) ).
tff(c_2698,plain,
! [X14_579,X12_578,X10_582,X13_581,X11_580] : ( i(triple(X11_580,X12_578,X14_579)) = i(triple(X10_582,X12_578,X13_581)) ),
inference(splitLeft,[status(thm)],[c_181]) ).
tff(c_178,plain,
insert_pq(i(triple('#skF_16','#skF_17','#skF_18')),'#skF_19') != i(insert_cpq(triple('#skF_16','#skF_17','#skF_18'),'#skF_19')),
inference(cnfTransformation,[status(thm)],[f_448]) ).
tff(c_2859,plain,
! [X11_580,X14_579] : ( insert_pq(i(triple(X11_580,'#skF_17',X14_579)),'#skF_19') != i(insert_cpq(triple('#skF_16','#skF_17','#skF_18'),'#skF_19')) ),
inference(superposition,[status(thm),theory(equality)],[c_2698,c_178]) ).
tff(c_153157,plain,
! [U_25533,W_25536] : ( i(insert_cpq(triple(U_25533,'#skF_17',W_25536),'#skF_19')) != i(insert_cpq(triple('#skF_16','#skF_17','#skF_18'),'#skF_19')) ),
inference(superposition,[status(thm),theory(equality)],[c_153061,c_2859]) ).
tff(c_157278,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_153157]) ).
tff(c_157279,plain,
! [Z_182,X2_184,X1_183,X3_185] : ( i(triple(Z_182,'#skF_9',X2_184)) = i(triple(X1_183,'#skF_9',X3_185)) ),
inference(splitRight,[status(thm)],[c_181]) ).
tff(c_174,plain,
! [X10_186,X12_188,X14_190,X13_189,X11_187] :
( ( i(triple('#skF_11',insert_slb('#skF_9',pair('#skF_14','#skF_15')),'#skF_13')) != i(triple('#skF_10',insert_slb('#skF_9',pair('#skF_14','#skF_15')),'#skF_12')) )
| ( i(triple(X11_187,X12_188,X14_190)) = i(triple(X10_186,X12_188,X13_189)) )
| ( i(triple('#skF_5',create_slb,'#skF_7')) != i(triple('#skF_6',create_slb,'#skF_8')) ) ),
inference(cnfTransformation,[status(thm)],[f_445]) ).
tff(c_179,plain,
! [X10_186,X12_188,X14_190,X13_189,X11_187] :
( ( insert_pq(i(triple('#skF_11','#skF_9','#skF_13')),'#skF_14') != insert_pq(i(triple('#skF_10','#skF_9','#skF_12')),'#skF_14') )
| ( i(triple(X11_187,X12_188,X14_190)) = i(triple(X10_186,X12_188,X13_189)) )
| ( i(triple('#skF_5',create_slb,'#skF_7')) != i(triple('#skF_6',create_slb,'#skF_8')) ) ),
inference(demodulation,[status(thm),theory(equality)],[c_136,c_136,c_174]) ).
tff(c_183,plain,
! [X10_186,X12_188,X14_190,X13_189,X11_187] :
( ( insert_pq(i(triple('#skF_11','#skF_9','#skF_13')),'#skF_14') != insert_pq(i(triple('#skF_10','#skF_9','#skF_12')),'#skF_14') )
| ( i(triple(X11_187,X12_188,X14_190)) = i(triple(X10_186,X12_188,X13_189)) ) ),
inference(demodulation,[status(thm),theory(equality)],[c_134,c_134,c_179]) ).
tff(c_157611,plain,
insert_pq(i(triple('#skF_11','#skF_9','#skF_13')),'#skF_14') != insert_pq(i(triple('#skF_10','#skF_9','#skF_12')),'#skF_14'),
inference(splitLeft,[status(thm)],[c_183]) ).
tff(c_157794,plain,
! [Z_182,X2_184] : ( insert_pq(i(triple(Z_182,'#skF_9',X2_184)),'#skF_14') != insert_pq(i(triple('#skF_10','#skF_9','#skF_12')),'#skF_14') ),
inference(superposition,[status(thm),theory(equality)],[c_157279,c_157611]) ).
tff(c_160453,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_157794]) ).
tff(c_160465,plain,
! [X13_26132,X11_26131,X10_26133,X14_26130,X12_26129] : ( i(triple(X11_26131,X12_26129,X14_26130)) = i(triple(X10_26133,X12_26129,X13_26132)) ),
inference(splitRight,[status(thm)],[c_183]) ).
tff(c_339186,plain,
! [U_54348,W_54351,X13_54350,X10_54346,V_54349,X_54347] : ( i(triple(X10_54346,insert_slb(V_54349,pair(X_54347,bottom)),X13_54350)) = i(insert_cpq(triple(U_54348,V_54349,W_54351),X_54347)) ),
inference(superposition,[status(thm),theory(equality)],[c_110,c_160465]) ).
tff(c_326837,plain,
! [X13_53427,X11_53429,X_53424,V_53426,Y_53423,X14_53428,X10_53425] : ( insert_pq(i(triple(X10_53425,V_53426,X13_53427)),X_53424) = i(triple(X11_53429,insert_slb(V_53426,pair(X_53424,Y_53423)),X14_53428)) ),
inference(superposition,[status(thm),theory(equality)],[c_160465,c_136]) ).
tff(c_160637,plain,
! [X10_26133,X13_26132] : ( insert_pq(i(triple(X10_26133,'#skF_17',X13_26132)),'#skF_19') != i(insert_cpq(triple('#skF_16','#skF_17','#skF_18'),'#skF_19')) ),
inference(superposition,[status(thm),theory(equality)],[c_160465,c_178]) ).
tff(c_327013,plain,
! [X11_53429,Y_53423,X14_53428] : ( i(triple(X11_53429,insert_slb('#skF_17',pair('#skF_19',Y_53423)),X14_53428)) != i(insert_cpq(triple('#skF_16','#skF_17','#skF_18'),'#skF_19')) ),
inference(superposition,[status(thm),theory(equality)],[c_326837,c_160637]) ).
tff(c_339199,plain,
! [U_54348,W_54351] : ( i(insert_cpq(triple(U_54348,'#skF_17',W_54351),'#skF_19')) != i(insert_cpq(triple('#skF_16','#skF_17','#skF_18'),'#skF_19')) ),
inference(superposition,[status(thm),theory(equality)],[c_339186,c_327013]) ).
tff(c_372701,plain,
$false,
inference(reflexivity,[status(thm),theory(equality)],[c_339199]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13 % Problem : SWV415+2 : TPTP v8.1.2. Released v3.3.0.
% 0.00/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.35 % Computer : n010.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Thu Aug 3 22:37:59 EDT 2023
% 0.14/0.35 % CPUTime :
% 46.99/28.07 % SZS status Theorem for /export/starexec/sandbox2/benchmark/theBenchmark.p
% 46.99/28.08
% 46.99/28.08 % SZS output start CNFRefutation for /export/starexec/sandbox2/benchmark/theBenchmark.p
% See solution above
% 46.99/28.11
% 46.99/28.11 Inference rules
% 46.99/28.11 ----------------------
% 46.99/28.11 #Ref : 4
% 46.99/28.11 #Sup : 65880
% 46.99/28.11 #Fact : 44
% 46.99/28.11 #Define : 0
% 46.99/28.11 #Split : 26
% 46.99/28.11 #Chain : 0
% 46.99/28.11 #Close : 0
% 46.99/28.11
% 46.99/28.11 Ordering : KBO
% 46.99/28.11
% 46.99/28.11 Simplification rules
% 46.99/28.11 ----------------------
% 46.99/28.11 #Subsume : 11661
% 46.99/28.11 #Demod : 9499
% 46.99/28.11 #Tautology : 1665
% 46.99/28.11 #SimpNegUnit : 207
% 46.99/28.11 #BackRed : 1
% 46.99/28.11
% 46.99/28.11 #Partial instantiations: 56070
% 46.99/28.11 #Strategies tried : 1
% 46.99/28.11
% 46.99/28.11 Timing (in seconds)
% 46.99/28.11 ----------------------
% 46.99/28.12 Preprocessing : 0.69
% 46.99/28.12 Parsing : 0.35
% 46.99/28.12 CNF conversion : 0.05
% 46.99/28.12 Main loop : 26.31
% 46.99/28.12 Inferencing : 4.11
% 46.99/28.12 Reduction : 12.19
% 46.99/28.12 Demodulation : 10.46
% 46.99/28.12 BG Simplification : 0.49
% 46.99/28.12 Subsumption : 8.69
% 46.99/28.12 Abstraction : 0.47
% 46.99/28.12 MUC search : 0.00
% 46.99/28.12 Cooper : 0.00
% 46.99/28.12 Total : 27.06
% 46.99/28.12 Index Insertion : 0.00
% 46.99/28.12 Index Deletion : 0.00
% 46.99/28.12 Index Matching : 0.00
% 46.99/28.12 BG Taut test : 0.00
%------------------------------------------------------------------------------